/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:10:07,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:10:07,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:10:07,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:10:07,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:10:07,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:10:07,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:10:07,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:10:07,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:10:07,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:10:07,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:10:07,744 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:10:07,744 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:10:07,745 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:10:07,746 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:10:07,747 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:10:07,748 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:10:07,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:10:07,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:10:07,752 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:10:07,754 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:10:07,755 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:10:07,756 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:10:07,756 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:10:07,759 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:10:07,759 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:10:07,759 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:10:07,760 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:10:07,760 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:10:07,761 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:10:07,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:10:07,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:10:07,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:10:07,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:10:07,764 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:10:07,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:10:07,765 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:10:07,765 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:10:07,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:10:07,766 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:10:07,767 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:10:07,768 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:10:07,782 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:10:07,782 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:10:07,783 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:10:07,784 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:10:07,784 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:10:07,784 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:10:07,784 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:10:07,785 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:10:07,785 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:10:07,785 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:10:07,785 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:10:07,785 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:10:07,785 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:10:07,786 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:10:07,786 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:10:07,786 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:10:07,786 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:10:07,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:10:07,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:10:07,787 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:10:07,787 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:10:07,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:10:07,787 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:10:07,788 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:10:07,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:10:07,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:10:07,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:10:07,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:10:07,788 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:10:07,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:10:07,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:10:07,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:10:07,972 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:10:07,972 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:10:07,973 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:10:08,043 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_s9uC8T/tmp/10deb7f7f85d4534ae9665ed39e8ad23/FLAGc3afebb85 [2020-07-01 13:10:08,388 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:10:08,389 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:10:08,389 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:10:08,396 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_s9uC8T/tmp/10deb7f7f85d4534ae9665ed39e8ad23/FLAGc3afebb85 [2020-07-01 13:10:08,810 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_s9uC8T/tmp/10deb7f7f85d4534ae9665ed39e8ad23 [2020-07-01 13:10:08,821 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:10:08,823 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:10:08,824 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:10:08,824 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:10:08,827 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:10:08,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,831 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16d9825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:08, skipping insertion in model container [2020-07-01 13:10:08,831 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:10:08" (1/1) ... [2020-07-01 13:10:08,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:10:08,856 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:10:09,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:10:09,086 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:10:09,103 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:10:09,118 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:10:09,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09 WrapperNode [2020-07-01 13:10:09,118 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:10:09,119 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:10:09,119 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:10:09,119 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:10:09,128 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:10:09,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:10:09,157 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:10:09,157 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:10:09,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,177 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:10:09,181 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:10:09,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:10:09,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:10:09,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:10:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:10:09,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:10:09,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:10:09,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:10:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:10:09,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:10:09,557 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:10:09,557 INFO L295 CfgBuilder]: Removed 5 assume(true) statements. [2020-07-01 13:10:09,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09 BoogieIcfgContainer [2020-07-01 13:10:09,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:10:09,562 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:10:09,563 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:10:09,565 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:10:09,565 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09" (1/1) ... [2020-07-01 13:10:09,582 INFO L313 BlockEncoder]: Initial Icfg 58 locations, 63 edges [2020-07-01 13:10:09,584 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:10:09,584 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:10:09,585 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:10:09,585 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:10:09,587 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:10:09,588 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:10:09,589 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:10:09,618 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:10:09,650 INFO L200 BlockEncoder]: SBE split 31 edges [2020-07-01 13:10:09,655 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 13:10:09,657 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:10:09,693 INFO L100 BaseMinimizeStates]: Removed 18 edges and 9 locations by large block encoding [2020-07-01 13:10:09,696 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:10:09,697 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:10:09,698 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:10:09,698 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:10:09,699 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:10:09,699 INFO L313 BlockEncoder]: Encoded RCFG 48 locations, 86 edges [2020-07-01 13:10:09,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:10:09 BasicIcfg [2020-07-01 13:10:09,700 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:10:09,701 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:10:09,701 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:10:09,705 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:10:09,705 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:10:08" (1/4) ... [2020-07-01 13:10:09,706 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0cbeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:10:09, skipping insertion in model container [2020-07-01 13:10:09,706 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (2/4) ... [2020-07-01 13:10:09,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0cbeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:10:09, skipping insertion in model container [2020-07-01 13:10:09,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09" (3/4) ... [2020-07-01 13:10:09,707 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c0cbeb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:10:09, skipping insertion in model container [2020-07-01 13:10:09,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:10:09" (4/4) ... [2020-07-01 13:10:09,709 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:10:09,720 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:10:09,727 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 26 error locations. [2020-07-01 13:10:09,741 INFO L251 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2020-07-01 13:10:09,764 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:10:09,764 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:10:09,764 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:10:09,764 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:10:09,764 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:10:09,765 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:10:09,765 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:10:09,765 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:10:09,780 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2020-07-01 13:10:09,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:09,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:09,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:09,787 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:09,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:09,793 INFO L82 PathProgramCache]: Analyzing trace with hash 151003, now seen corresponding path program 1 times [2020-07-01 13:10:09,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:09,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905520058] [2020-07-01 13:10:09,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:09,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:09,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:09,955 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905520058] [2020-07-01 13:10:09,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:09,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:09,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923672300] [2020-07-01 13:10:09,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:09,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:09,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:09,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:09,979 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-07-01 13:10:10,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,130 INFO L93 Difference]: Finished difference Result 94 states and 167 transitions. [2020-07-01 13:10:10,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,146 INFO L225 Difference]: With dead ends: 94 [2020-07-01 13:10:10,146 INFO L226 Difference]: Without dead ends: 48 [2020-07-01 13:10:10,149 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-01 13:10:10,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-07-01 13:10:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-07-01 13:10:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 83 transitions. [2020-07-01 13:10:10,191 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 83 transitions. Word has length 3 [2020-07-01 13:10:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,191 INFO L479 AbstractCegarLoop]: Abstraction has 48 states and 83 transitions. [2020-07-01 13:10:10,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,191 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 83 transitions. [2020-07-01 13:10:10,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:10,192 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,192 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:10,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:10:10,194 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,194 INFO L82 PathProgramCache]: Analyzing trace with hash 151065, now seen corresponding path program 1 times [2020-07-01 13:10:10,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,195 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063481145] [2020-07-01 13:10:10,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,248 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063481145] [2020-07-01 13:10:10,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,248 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,248 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782441335] [2020-07-01 13:10:10,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,251 INFO L87 Difference]: Start difference. First operand 48 states and 83 transitions. Second operand 3 states. [2020-07-01 13:10:10,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,368 INFO L93 Difference]: Finished difference Result 48 states and 83 transitions. [2020-07-01 13:10:10,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,370 INFO L225 Difference]: With dead ends: 48 [2020-07-01 13:10:10,370 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 13:10:10,372 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 13:10:10,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 13:10:10,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:10:10,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 69 transitions. [2020-07-01 13:10:10,377 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 69 transitions. Word has length 3 [2020-07-01 13:10:10,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,378 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 69 transitions. [2020-07-01 13:10:10,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,378 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 69 transitions. [2020-07-01 13:10:10,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:10,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,379 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:10,379 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:10:10,379 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,380 INFO L82 PathProgramCache]: Analyzing trace with hash 151067, now seen corresponding path program 1 times [2020-07-01 13:10:10,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,380 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401903444] [2020-07-01 13:10:10,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,409 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401903444] [2020-07-01 13:10:10,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410396294] [2020-07-01 13:10:10,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,411 INFO L87 Difference]: Start difference. First operand 41 states and 69 transitions. Second operand 3 states. [2020-07-01 13:10:10,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,493 INFO L93 Difference]: Finished difference Result 48 states and 69 transitions. [2020-07-01 13:10:10,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,494 INFO L225 Difference]: With dead ends: 48 [2020-07-01 13:10:10,494 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 13:10:10,495 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 13:10:10,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 13:10:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:10:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 62 transitions. [2020-07-01 13:10:10,500 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 62 transitions. Word has length 3 [2020-07-01 13:10:10,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,500 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 62 transitions. [2020-07-01 13:10:10,500 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,500 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 62 transitions. [2020-07-01 13:10:10,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:10:10,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:10:10,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:10:10,501 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,502 INFO L82 PathProgramCache]: Analyzing trace with hash 151068, now seen corresponding path program 1 times [2020-07-01 13:10:10,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,502 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47150847] [2020-07-01 13:10:10,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,547 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47150847] [2020-07-01 13:10:10,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195329925] [2020-07-01 13:10:10,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,549 INFO L87 Difference]: Start difference. First operand 41 states and 62 transitions. Second operand 3 states. [2020-07-01 13:10:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,656 INFO L93 Difference]: Finished difference Result 41 states and 62 transitions. [2020-07-01 13:10:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,657 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:10:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,658 INFO L225 Difference]: With dead ends: 41 [2020-07-01 13:10:10,658 INFO L226 Difference]: Without dead ends: 34 [2020-07-01 13:10:10,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-01 13:10:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-07-01 13:10:10,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-01 13:10:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 55 transitions. [2020-07-01 13:10:10,662 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 55 transitions. Word has length 3 [2020-07-01 13:10:10,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,662 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 55 transitions. [2020-07-01 13:10:10,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 55 transitions. [2020-07-01 13:10:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:10:10,664 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,664 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:10:10,664 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,665 INFO L82 PathProgramCache]: Analyzing trace with hash 204347138, now seen corresponding path program 1 times [2020-07-01 13:10:10,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,665 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243028978] [2020-07-01 13:10:10,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,695 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243028978] [2020-07-01 13:10:10,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677933883] [2020-07-01 13:10:10,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,697 INFO L87 Difference]: Start difference. First operand 34 states and 55 transitions. Second operand 3 states. [2020-07-01 13:10:10,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,769 INFO L93 Difference]: Finished difference Result 34 states and 55 transitions. [2020-07-01 13:10:10,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:10:10,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,771 INFO L225 Difference]: With dead ends: 34 [2020-07-01 13:10:10,771 INFO L226 Difference]: Without dead ends: 28 [2020-07-01 13:10:10,772 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-01 13:10:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-01 13:10:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-01 13:10:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 43 transitions. [2020-07-01 13:10:10,775 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 43 transitions. Word has length 6 [2020-07-01 13:10:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,776 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 43 transitions. [2020-07-01 13:10:10,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 43 transitions. [2020-07-01 13:10:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-01 13:10:10,776 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:10:10,776 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:10:10,777 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:10:10,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash 204347140, now seen corresponding path program 1 times [2020-07-01 13:10:10,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,778 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470114833] [2020-07-01 13:10:10,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:10,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470114833] [2020-07-01 13:10:10,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:10:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438817000] [2020-07-01 13:10:10,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:10:10,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:10,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:10,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,815 INFO L87 Difference]: Start difference. First operand 28 states and 43 transitions. Second operand 3 states. [2020-07-01 13:10:10,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:10,870 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-07-01 13:10:10,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:10,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2020-07-01 13:10:10,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:10:10,871 INFO L225 Difference]: With dead ends: 28 [2020-07-01 13:10:10,871 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:10:10,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:10,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:10:10,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:10:10,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:10:10,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:10:10,872 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2020-07-01 13:10:10,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:10:10,873 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:10:10,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:10:10,873 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:10:10,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:10:10,874 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:10:10,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:10:10,908 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:10,909 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:10,910 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 13:10:10,910 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:10,910 INFO L268 CegarLoopResult]: For program point L20-1(line 20) no Hoare annotation was computed. [2020-07-01 13:10:10,910 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point L12(line 12) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point L8-1(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,911 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,912 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,912 INFO L268 CegarLoopResult]: For program point L8-3(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,912 INFO L268 CegarLoopResult]: For program point L8-4(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,912 INFO L268 CegarLoopResult]: For program point L8-6(lines 8 24) no Hoare annotation was computed. [2020-07-01 13:10:10,912 INFO L268 CegarLoopResult]: For program point L21(line 21) no Hoare annotation was computed. [2020-07-01 13:10:10,912 INFO L268 CegarLoopResult]: For program point L17(lines 17 22) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L264 CegarLoopResult]: At program point L17-2(lines 8 24) the Hoare annotation is: (and (= 4 (select |#length| ULTIMATE.start_main_~y~0.base)) (= (select |#valid| ULTIMATE.start_main_~x~0.base) 1) (= 0 ULTIMATE.start_main_~y~0.offset) (= (select |#length| ULTIMATE.start_main_~x~0.base) 4) (<= 1 |#StackHeapBarrier|) (= 1 (select |#valid| ULTIMATE.start_main_~y~0.base)) (= 0 ULTIMATE.start_main_~x~0.offset)) [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point L9(line 9) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point L9-1(lines 9 23) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 13:10:10,913 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 18) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point L18(line 18) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point L18-1(line 18) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:10:10,914 INFO L268 CegarLoopResult]: For program point L14-1(line 14) no Hoare annotation was computed. [2020-07-01 13:10:10,915 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:10:10,915 INFO L268 CegarLoopResult]: For program point L10(lines 10 15) no Hoare annotation was computed. [2020-07-01 13:10:10,915 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,915 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 9) no Hoare annotation was computed. [2020-07-01 13:10:10,916 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 8) no Hoare annotation was computed. [2020-07-01 13:10:10,918 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:10:10,927 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:10,928 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:10,929 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:10,934 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:10,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:10,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:10,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:10:10 BasicIcfg [2020-07-01 13:10:10,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:10:10,938 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:10:10,938 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:10:10,942 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:10:10,942 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:10,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:10:08" (1/5) ... [2020-07-01 13:10:10,943 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a0decef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:10:10, skipping insertion in model container [2020-07-01 13:10:10,943 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:10,943 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:10:09" (2/5) ... [2020-07-01 13:10:10,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a0decef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:10:10, skipping insertion in model container [2020-07-01 13:10:10,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:10,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:10:09" (3/5) ... [2020-07-01 13:10:10,944 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a0decef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:10:10, skipping insertion in model container [2020-07-01 13:10:10,944 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:10,944 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:10:09" (4/5) ... [2020-07-01 13:10:10,945 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7a0decef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:10:10, skipping insertion in model container [2020-07-01 13:10:10,945 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:10:10,945 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:10:10" (5/5) ... [2020-07-01 13:10:10,946 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:10:10,968 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:10:10,968 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:10:10,968 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:10:10,969 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:10:10,969 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:10:10,969 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:10:10,969 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:10:10,969 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:10:10,973 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2020-07-01 13:10:10,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-01 13:10:10,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:10:10,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:10:10,984 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:10:10,984 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,984 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:10:10,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states. [2020-07-01 13:10:10,987 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-07-01 13:10:10,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:10:10,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:10:10,988 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-07-01 13:10:10,988 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:10:10,993 INFO L794 eck$LassoCheckResult]: Stem: 43#ULTIMATE.startENTRYtrue [120] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 19#L-1true [187] L-1-->L17-2: Formula: (let ((.cse0 (store |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1| 1))) (and (= 0 (select |v_#valid_5| |v_ULTIMATE.start_main_#t~malloc0.base_1|)) (= v_ULTIMATE.start_main_~y~0.offset_1 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= 0 (select .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1|)) (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= v_ULTIMATE.start_main_~x~0.offset_1 |v_ULTIMATE.start_main_#t~malloc0.offset_1|) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_1|) (= |v_#valid_3| (store .cse0 |v_ULTIMATE.start_main_#t~malloc1.base_1| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_1|) (= v_ULTIMATE.start_main_~x~0.base_1 |v_ULTIMATE.start_main_#t~malloc0.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc0.base_1|) (= (store (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc0.base_1| 4) |v_ULTIMATE.start_main_#t~malloc1.base_1| 4) |v_#length_1|) (= v_ULTIMATE.start_main_~y~0.base_1 |v_ULTIMATE.start_main_#t~malloc1.base_1|) (> 0 |v_ULTIMATE.start_main_#t~malloc0.base_1|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, #valid=|v_#valid_5|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_1|, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet13=|v_ULTIMATE.start_main_#t~nondet13_1|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_1, ULTIMATE.start_main_#t~nondet8=|v_ULTIMATE.start_main_#t~nondet8_1|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_1|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_1, ULTIMATE.start_main_#t~malloc0.base=|v_ULTIMATE.start_main_#t~malloc0.base_1|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_1|, #length=|v_#length_1|, ULTIMATE.start_main_~y~0.base=v_ULTIMATE.start_main_~y~0.base_1, ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_1|, ULTIMATE.start_main_#t~mem12=|v_ULTIMATE.start_main_#t~mem12_1|, ULTIMATE.start_main_#t~malloc0.offset=|v_ULTIMATE.start_main_#t~malloc0.offset_1|, ULTIMATE.start_main_#t~mem9=|v_ULTIMATE.start_main_#t~mem9_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_1|, ULTIMATE.start_main_#t~mem7=|v_ULTIMATE.start_main_#t~mem7_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_1|, ULTIMATE.start_main_~y~0.offset=v_ULTIMATE.start_main_~y~0.offset_1, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_1|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_1|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~mem11, ULTIMATE.start_main_#t~mem12, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet13, ULTIMATE.start_main_~x~0.offset, ULTIMATE.start_main_#t~nondet8, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_#t~malloc0.offset, ULTIMATE.start_main_~x~0.base, ULTIMATE.start_main_#t~malloc0.base, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_#t~mem9, ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem7, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~mem2, #length, ULTIMATE.start_main_~y~0.base, ULTIMATE.start_main_~y~0.offset, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~mem3] 30#L17-2true [2020-07-01 13:10:10,994 INFO L796 eck$LassoCheckResult]: Loop: 30#L17-2true [146] L17-2-->L8-1: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_4 4) (select |v_#length_4| v_ULTIMATE.start_main_~x~0.base_4)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_4) (= (select |v_#valid_6| v_ULTIMATE.start_main_~x~0.base_4) 1) (= |v_ULTIMATE.start_main_#t~mem2_2| (select (select |v_#memory_int_1| v_ULTIMATE.start_main_~x~0.base_4) v_ULTIMATE.start_main_~x~0.offset_4))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4, #valid=|v_#valid_6|} OutVars{#valid=|v_#valid_6|, ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_2|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_4, #memory_int=|v_#memory_int_1|, #length=|v_#length_4|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem2] 37#L8-1true [192] L8-1-->L8-2: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~mem2_3|) |v_ULTIMATE.start_main_#t~short4_2|) InVars {ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_3|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4] 34#L8-2true [115] L8-2-->L8-6: Formula: (not |v_ULTIMATE.start_main_#t~short4_5|) InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} OutVars{ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_5|} AuxVars[] AssignedVars[] 46#L8-6true [126] L8-6-->L9: Formula: |v_ULTIMATE.start_main_#t~short4_9| InVars {ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_9|} OutVars{ULTIMATE.start_main_#t~mem2=|v_ULTIMATE.start_main_#t~mem2_5|, ULTIMATE.start_main_#t~short4=|v_ULTIMATE.start_main_#t~short4_8|, ULTIMATE.start_main_#t~mem3=|v_ULTIMATE.start_main_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~short4, ULTIMATE.start_main_#t~mem2, ULTIMATE.start_main_#t~mem3] 15#L9true [135] L9-->L9-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_6) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~x~0.base_7) v_ULTIMATE.start_main_~x~0.offset_6)) (<= (+ v_ULTIMATE.start_main_~x~0.offset_6 4) (select |v_#length_8| v_ULTIMATE.start_main_~x~0.base_7)) (= 1 (select |v_#valid_10| v_ULTIMATE.start_main_~x~0.base_7))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, #valid=|v_#valid_10|} OutVars{#valid=|v_#valid_10|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_6, #memory_int=|v_#memory_int_3|, #length=|v_#length_8|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_7, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 12#L9-1true [161] L9-1-->L17: Formula: (>= 0 |v_ULTIMATE.start_main_#t~mem5_6|) InVars {ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_6|} OutVars{ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 35#L17true [208] L17-->L18: Formula: (> |v_ULTIMATE.start_main_#t~nondet10_3| 0) InVars {ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_3|} OutVars{ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet10] 11#L18true [93] L18-->L18-1: Formula: (and (<= 0 v_ULTIMATE.start_main_~x~0.offset_12) (= (select (select |v_#memory_int_12| v_ULTIMATE.start_main_~x~0.base_16) v_ULTIMATE.start_main_~x~0.offset_12) |v_ULTIMATE.start_main_#t~mem11_2|) (= (select |v_#valid_22| v_ULTIMATE.start_main_~x~0.base_16) 1) (<= (+ v_ULTIMATE.start_main_~x~0.offset_12 4) (select |v_#length_20| v_ULTIMATE.start_main_~x~0.base_16))) InVars {ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16, #valid=|v_#valid_22|} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_2|, #valid=|v_#valid_22|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_12, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_16} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11] 9#L18-1true [255] L18-1-->L17-2: Formula: (and (<= (+ v_ULTIMATE.start_main_~x~0.offset_19 4) (select |v_#length_33| v_ULTIMATE.start_main_~x~0.base_26)) (= 1 (select |v_#valid_44| v_ULTIMATE.start_main_~x~0.base_26)) (<= 0 v_ULTIMATE.start_main_~x~0.offset_19) (= |v_#memory_int_26| (store |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26 (store (select |v_#memory_int_27| v_ULTIMATE.start_main_~x~0.base_26) v_ULTIMATE.start_main_~x~0.offset_19 (+ |v_ULTIMATE.start_main_#t~mem11_6| 1))))) InVars {ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_6|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} OutVars{ULTIMATE.start_main_#t~mem11=|v_ULTIMATE.start_main_#t~mem11_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_26|, ULTIMATE.start_main_~x~0.offset=v_ULTIMATE.start_main_~x~0.offset_19, #length=|v_#length_33|, ULTIMATE.start_main_~x~0.base=v_ULTIMATE.start_main_~x~0.base_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem11, #memory_int] 30#L17-2true [2020-07-01 13:10:10,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:10,995 INFO L82 PathProgramCache]: Analyzing trace with hash 4868, now seen corresponding path program 1 times [2020-07-01 13:10:10,995 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:10,995 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573546878] [2020-07-01 13:10:10,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573546878] [2020-07-01 13:10:11,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-07-01 13:10:11,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299950032] [2020-07-01 13:10:11,017 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:10:11,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:10:11,017 INFO L82 PathProgramCache]: Analyzing trace with hash 240931134, now seen corresponding path program 1 times [2020-07-01 13:10:11,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:10:11,018 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114018720] [2020-07-01 13:10:11,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:10:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:10:11,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:10:11,033 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114018720] [2020-07-01 13:10:11,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:10:11,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 13:10:11,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915521077] [2020-07-01 13:10:11,035 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-07-01 13:10:11,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:10:11,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:10:11,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:10:11,037 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2020-07-01 13:10:11,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:10:11,134 INFO L93 Difference]: Finished difference Result 48 states and 83 transitions. [2020-07-01 13:10:11,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:10:11,137 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:10:11,142 INFO L168 Benchmark]: Toolchain (without parser) took 2318.07 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 561.6 MB in the beginning and 437.5 MB in the end (delta: 124.1 MB). Peak memory consumption was 155.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,142 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:10:11,143 INFO L168 Benchmark]: CACSL2BoogieTranslator took 295.03 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 561.6 MB in the beginning and 642.4 MB in the end (delta: -80.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.65 ms. Allocated memory is still 680.5 MB. Free memory was 642.4 MB in the beginning and 641.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,144 INFO L168 Benchmark]: Boogie Preprocessor took 23.14 ms. Allocated memory is still 680.5 MB. Free memory was 641.0 MB in the beginning and 639.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,145 INFO L168 Benchmark]: RCFGBuilder took 381.45 ms. Allocated memory is still 680.5 MB. Free memory was 639.7 MB in the beginning and 610.7 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,145 INFO L168 Benchmark]: BlockEncodingV2 took 137.56 ms. Allocated memory is still 680.5 MB. Free memory was 610.7 MB in the beginning and 599.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,146 INFO L168 Benchmark]: TraceAbstraction took 1236.28 ms. Allocated memory is still 680.5 MB. Free memory was 599.9 MB in the beginning and 464.0 MB in the end (delta: 135.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,146 INFO L168 Benchmark]: BuchiAutomizer took 201.09 ms. Allocated memory is still 680.5 MB. Free memory was 462.6 MB in the beginning and 437.5 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:10:11,150 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 58 locations, 63 edges - StatisticsResult: Encoded RCFG 48 locations, 86 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 649.6 MB. Free memory is still 583.3 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 295.03 ms. Allocated memory was 649.6 MB in the beginning and 680.5 MB in the end (delta: 30.9 MB). Free memory was 561.6 MB in the beginning and 642.4 MB in the end (delta: -80.8 MB). Peak memory consumption was 28.7 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 37.65 ms. Allocated memory is still 680.5 MB. Free memory was 642.4 MB in the beginning and 641.0 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 23.14 ms. Allocated memory is still 680.5 MB. Free memory was 641.0 MB in the beginning and 639.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 381.45 ms. Allocated memory is still 680.5 MB. Free memory was 639.7 MB in the beginning and 610.7 MB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 137.56 ms. Allocated memory is still 680.5 MB. Free memory was 610.7 MB in the beginning and 599.9 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1236.28 ms. Allocated memory is still 680.5 MB. Free memory was 599.9 MB in the beginning and 464.0 MB in the end (delta: 135.9 MB). Peak memory consumption was 135.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 201.09 ms. Allocated memory is still 680.5 MB. Free memory was 462.6 MB in the beginning and 437.5 MB in the end (delta: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 8]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 9]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 18]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 26 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-07-01 13:10:11,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:10:11,161 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:10:11,162 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: (((((4 == unknown-#length-unknown[y] && \valid[x] == 1) && 0 == y) && unknown-#length-unknown[x] == 4) && 1 <= unknown-#StackHeapBarrier-unknown) && 1 == \valid[y]) && 0 == x - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 48 locations, 26 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.1s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 61 SDtfs, 326 SDslu, 3 SDs, 0 SdLazy, 284 SolverSat, 49 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 1 LocationsWithAnnotation, 1 PreInvPairs, 2 NumberOfFragments, 30 HoareAnnotationTreeSize, 1 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 1 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 18 ConstructedInterpolants, 0 QuantifiedInterpolants, 338 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:10:05.523 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_s9uC8T/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:10:11.389 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check