/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.c /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 12:57:36,656 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 12:57:36,658 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 12:57:36,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 12:57:36,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 12:57:36,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 12:57:36,673 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 12:57:36,675 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 12:57:36,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 12:57:36,677 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 12:57:36,678 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 12:57:36,679 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 12:57:36,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 12:57:36,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 12:57:36,681 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 12:57:36,682 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 12:57:36,683 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 12:57:36,684 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 12:57:36,686 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 12:57:36,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 12:57:36,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 12:57:36,690 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 12:57:36,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 12:57:36,692 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 12:57:36,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 12:57:36,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 12:57:36,694 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 12:57:36,695 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 12:57:36,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 12:57:36,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 12:57:36,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 12:57:36,697 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 12:57:36,698 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 12:57:36,699 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 12:57:36,700 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 12:57:36,700 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 12:57:36,701 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 12:57:36,701 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 12:57:36,701 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 12:57:36,702 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 12:57:36,703 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 12:57:36,703 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox/solver/bin/./../termcomp2017.epf [2020-07-01 12:57:36,718 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 12:57:36,718 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 12:57:36,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 12:57:36,720 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 12:57:36,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 12:57:36,720 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:57:36,720 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 12:57:36,720 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 12:57:36,721 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 12:57:36,721 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 12:57:36,721 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 12:57:36,721 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 12:57:36,721 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 12:57:36,722 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 12:57:36,722 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 12:57:36,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 12:57:36,722 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 12:57:36,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 12:57:36,722 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 12:57:36,723 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 12:57:36,723 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 12:57:36,723 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 12:57:36,723 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 12:57:36,723 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 12:57:36,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 12:57:36,724 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 12:57:36,724 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 12:57:36,724 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 12:57:36,724 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 12:57:36,886 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 12:57:36,901 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 12:57:36,904 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 12:57:36,906 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 12:57:36,906 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 12:57:36,907 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:57:36,969 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_fJAVfe/tmp/051a70d5808e4f70865d376ee4b32ae0/FLAG5eff3eb6f [2020-07-01 12:57:37,319 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 12:57:37,319 INFO L160 CDTParser]: Scanning /export/starexec/sandbox/benchmark/theBenchmark.c [2020-07-01 12:57:37,320 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 12:57:37,326 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox/tmp/BenchExec_run_fJAVfe/tmp/051a70d5808e4f70865d376ee4b32ae0/FLAG5eff3eb6f [2020-07-01 12:57:37,713 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox/tmp/BenchExec_run_fJAVfe/tmp/051a70d5808e4f70865d376ee4b32ae0 [2020-07-01 12:57:37,725 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 12:57:37,726 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 12:57:37,728 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 12:57:37,728 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 12:57:37,731 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 12:57:37,732 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:57:37" (1/1) ... [2020-07-01 12:57:37,735 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fb860a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:37, skipping insertion in model container [2020-07-01 12:57:37,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 12:57:37" (1/1) ... [2020-07-01 12:57:37,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 12:57:37,761 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 12:57:37,986 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:57:37,998 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 12:57:38,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 12:57:38,030 INFO L208 MainTranslator]: Completed translation [2020-07-01 12:57:38,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38 WrapperNode [2020-07-01 12:57:38,031 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 12:57:38,032 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 12:57:38,032 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 12:57:38,032 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 12:57:38,041 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 12:57:38,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 12:57:38,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 12:57:38,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 12:57:38,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,087 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,092 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 12:57:38,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 12:57:38,096 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 12:57:38,096 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 12:57:38,097 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (1/1) ... No working directory specified, using /export/starexec/sandbox/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 12:57:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 12:57:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 12:57:38,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 12:57:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 12:57:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 12:57:38,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 12:57:38,397 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 12:57:38,398 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-01 12:57:38,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:57:38 BoogieIcfgContainer [2020-07-01 12:57:38,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 12:57:38,403 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 12:57:38,403 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 12:57:38,405 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 12:57:38,406 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:57:38" (1/1) ... [2020-07-01 12:57:38,420 INFO L313 BlockEncoder]: Initial Icfg 30 locations, 38 edges [2020-07-01 12:57:38,421 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 12:57:38,422 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 12:57:38,423 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 12:57:38,423 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 12:57:38,425 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 12:57:38,426 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 12:57:38,426 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 12:57:38,447 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 12:57:38,471 INFO L200 BlockEncoder]: SBE split 10 edges [2020-07-01 12:57:38,476 INFO L70 emoveInfeasibleEdges]: Removed 3 edges and 0 locations because of local infeasibility [2020-07-01 12:57:38,478 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:57:38,515 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-07-01 12:57:38,517 INFO L70 RemoveSinkStates]: Removed 3 edges and 2 locations by removing sink states [2020-07-01 12:57:38,519 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 12:57:38,519 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 12:57:38,519 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 12:57:38,520 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 12:57:38,520 INFO L313 BlockEncoder]: Encoded RCFG 20 locations, 36 edges [2020-07-01 12:57:38,521 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:57:38 BasicIcfg [2020-07-01 12:57:38,521 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 12:57:38,522 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 12:57:38,523 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 12:57:38,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 12:57:38,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 12:57:37" (1/4) ... [2020-07-01 12:57:38,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:57:38, skipping insertion in model container [2020-07-01 12:57:38,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (2/4) ... [2020-07-01 12:57:38,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 12:57:38, skipping insertion in model container [2020-07-01 12:57:38,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:57:38" (3/4) ... [2020-07-01 12:57:38,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b825f02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:57:38, skipping insertion in model container [2020-07-01 12:57:38,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:57:38" (4/4) ... [2020-07-01 12:57:38,530 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:57:38,541 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 12:57:38,548 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2020-07-01 12:57:38,562 INFO L251 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2020-07-01 12:57:38,586 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 12:57:38,586 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 12:57:38,586 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:57:38,586 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:57:38,586 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:57:38,587 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 12:57:38,587 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:57:38,587 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 12:57:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-01 12:57:38,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:57:38,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:38,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:38,609 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1674118285, now seen corresponding path program 1 times [2020-07-01 12:57:38,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:38,626 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892149927] [2020-07-01 12:57:38,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:38,783 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 12:57:38,784 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892149927] [2020-07-01 12:57:38,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:38,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:57:38,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451203502] [2020-07-01 12:57:38,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:57:38,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:38,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:38,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:38,808 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2020-07-01 12:57:38,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:38,885 INFO L93 Difference]: Finished difference Result 37 states and 67 transitions. [2020-07-01 12:57:38,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:38,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:57:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:38,900 INFO L225 Difference]: With dead ends: 37 [2020-07-01 12:57:38,900 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:57:38,903 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 12:57:38,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:57:38,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:57:38,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:57:38,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 35 transitions. [2020-07-01 12:57:38,941 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 35 transitions. Word has length 7 [2020-07-01 12:57:38,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:38,941 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 35 transitions. [2020-07-01 12:57:38,941 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:57:38,941 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 35 transitions. [2020-07-01 12:57:38,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:57:38,942 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:38,942 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:38,944 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 12:57:38,944 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:38,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:38,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1673194764, now seen corresponding path program 1 times [2020-07-01 12:57:38,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:38,945 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674104143] [2020-07-01 12:57:38,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:38,971 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 12:57:38,972 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674104143] [2020-07-01 12:57:38,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:38,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:57:38,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51581511] [2020-07-01 12:57:38,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:57:38,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:38,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:38,975 INFO L87 Difference]: Start difference. First operand 20 states and 35 transitions. Second operand 3 states. [2020-07-01 12:57:39,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:39,030 INFO L93 Difference]: Finished difference Result 36 states and 62 transitions. [2020-07-01 12:57:39,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:39,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:57:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:39,032 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:57:39,032 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:57:39,033 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:57:39,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:57:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:57:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 34 transitions. [2020-07-01 12:57:39,037 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 34 transitions. Word has length 7 [2020-07-01 12:57:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:39,038 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 34 transitions. [2020-07-01 12:57:39,038 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:57:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 34 transitions. [2020-07-01 12:57:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:57:39,039 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:39,039 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:39,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 12:57:39,039 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1673164973, now seen corresponding path program 1 times [2020-07-01 12:57:39,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:39,040 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010546109] [2020-07-01 12:57:39,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:39,072 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 12:57:39,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010546109] [2020-07-01 12:57:39,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:39,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:57:39,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166689861] [2020-07-01 12:57:39,074 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:57:39,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:39,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:39,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:39,075 INFO L87 Difference]: Start difference. First operand 20 states and 34 transitions. Second operand 3 states. [2020-07-01 12:57:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:39,137 INFO L93 Difference]: Finished difference Result 36 states and 61 transitions. [2020-07-01 12:57:39,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:39,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:57:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:39,139 INFO L225 Difference]: With dead ends: 36 [2020-07-01 12:57:39,139 INFO L226 Difference]: Without dead ends: 20 [2020-07-01 12:57:39,140 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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 12:57:39,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-07-01 12:57:39,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-07-01 12:57:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-01 12:57:39,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 32 transitions. [2020-07-01 12:57:39,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 32 transitions. Word has length 7 [2020-07-01 12:57:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:39,144 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 32 transitions. [2020-07-01 12:57:39,144 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:57:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 32 transitions. [2020-07-01 12:57:39,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:57:39,145 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:39,145 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:39,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 12:57:39,146 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:39,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:39,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1673105391, now seen corresponding path program 1 times [2020-07-01 12:57:39,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:39,147 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031522014] [2020-07-01 12:57:39,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:39,177 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 12:57:39,178 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031522014] [2020-07-01 12:57:39,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:39,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:57:39,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135070855] [2020-07-01 12:57:39,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 12:57:39,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:39,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:39,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:39,180 INFO L87 Difference]: Start difference. First operand 20 states and 32 transitions. Second operand 3 states. [2020-07-01 12:57:39,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:39,226 INFO L93 Difference]: Finished difference Result 20 states and 32 transitions. [2020-07-01 12:57:39,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:39,244 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 12:57:39,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:39,245 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:57:39,245 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 12:57:39,246 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 12:57:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 12:57:39,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:57:39,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:57:39,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 24 transitions. [2020-07-01 12:57:39,249 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 24 transitions. Word has length 7 [2020-07-01 12:57:39,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:39,250 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 24 transitions. [2020-07-01 12:57:39,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 12:57:39,250 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 24 transitions. [2020-07-01 12:57:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 12:57:39,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:39,250 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:39,251 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 12:57:39,251 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:39,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:39,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1673105389, now seen corresponding path program 1 times [2020-07-01 12:57:39,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:39,252 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135544892] [2020-07-01 12:57:39,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:39,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:39,332 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 12:57:39,332 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135544892] [2020-07-01 12:57:39,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:39,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-01 12:57:39,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845146872] [2020-07-01 12:57:39,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:57:39,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:39,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:57:39,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:57:39,334 INFO L87 Difference]: Start difference. First operand 16 states and 24 transitions. Second operand 6 states. [2020-07-01 12:57:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:39,438 INFO L93 Difference]: Finished difference Result 28 states and 43 transitions. [2020-07-01 12:57:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:57:39,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 12:57:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:39,439 INFO L225 Difference]: With dead ends: 28 [2020-07-01 12:57:39,440 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:57:39,440 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:57:39,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:57:39,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:57:39,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:57:39,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 28 transitions. [2020-07-01 12:57:39,445 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 28 transitions. Word has length 7 [2020-07-01 12:57:39,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:39,445 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 28 transitions. [2020-07-01 12:57:39,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:57:39,446 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 28 transitions. [2020-07-01 12:57:39,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:57:39,446 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:39,446 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:39,447 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 12:57:39,447 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:39,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash -386577041, now seen corresponding path program 1 times [2020-07-01 12:57:39,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:39,448 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348603394] [2020-07-01 12:57:39,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:39,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:39,509 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:57:39,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348603394] [2020-07-01 12:57:39,510 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902027074] [2020-07-01 12:57:39,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:39,551 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:57:39,556 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:39,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 12:57:39,616 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:57:39,623 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:57:39,624 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:57:39,624 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-07-01 12:57:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:57:39,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:57:39,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-01 12:57:39,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253567229] [2020-07-01 12:57:39,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 12:57:39,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 12:57:39,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 12:57:39,664 INFO L87 Difference]: Start difference. First operand 19 states and 28 transitions. Second operand 6 states. [2020-07-01 12:57:39,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:39,794 INFO L93 Difference]: Finished difference Result 20 states and 28 transitions. [2020-07-01 12:57:39,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:57:39,795 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2020-07-01 12:57:39,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:39,796 INFO L225 Difference]: With dead ends: 20 [2020-07-01 12:57:39,796 INFO L226 Difference]: Without dead ends: 19 [2020-07-01 12:57:39,796 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:57:39,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-01 12:57:39,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-01 12:57:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-01 12:57:39,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 27 transitions. [2020-07-01 12:57:39,801 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 27 transitions. Word has length 10 [2020-07-01 12:57:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:39,801 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 27 transitions. [2020-07-01 12:57:39,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 12:57:39,801 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 27 transitions. [2020-07-01 12:57:39,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:57:39,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:39,802 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:40,002 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-01 12:57:40,003 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:40,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:40,004 INFO L82 PathProgramCache]: Analyzing trace with hash -386577040, now seen corresponding path program 1 times [2020-07-01 12:57:40,004 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:40,004 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767979470] [2020-07-01 12:57:40,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:40,053 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767979470] [2020-07-01 12:57:40,054 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304735794] [2020-07-01 12:57:40,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:57:40,084 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:40,108 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:40,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:57:40,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 7 [2020-07-01 12:57:40,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994212837] [2020-07-01 12:57:40,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 12:57:40,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:57:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:57:40,110 INFO L87 Difference]: Start difference. First operand 19 states and 27 transitions. Second operand 5 states. [2020-07-01 12:57:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:40,150 INFO L93 Difference]: Finished difference Result 19 states and 27 transitions. [2020-07-01 12:57:40,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:57:40,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-01 12:57:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:40,151 INFO L225 Difference]: With dead ends: 19 [2020-07-01 12:57:40,151 INFO L226 Difference]: Without dead ends: 18 [2020-07-01 12:57:40,152 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2020-07-01 12:57:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-01 12:57:40,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-07-01 12:57:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:57:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 23 transitions. [2020-07-01 12:57:40,156 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 23 transitions. Word has length 10 [2020-07-01 12:57:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:40,156 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 23 transitions. [2020-07-01 12:57:40,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 12:57:40,157 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 23 transitions. [2020-07-01 12:57:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:57:40,157 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:40,157 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:40,358 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:40,358 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:40,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:40,358 INFO L82 PathProgramCache]: Analyzing trace with hash -386516587, now seen corresponding path program 1 times [2020-07-01 12:57:40,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:40,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168841045] [2020-07-01 12:57:40,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:57:40,399 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168841045] [2020-07-01 12:57:40,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:40,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:57:40,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723546514] [2020-07-01 12:57:40,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 12:57:40,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:40,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:57:40,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:57:40,401 INFO L87 Difference]: Start difference. First operand 16 states and 23 transitions. Second operand 4 states. [2020-07-01 12:57:40,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:40,452 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2020-07-01 12:57:40,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:57:40,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-01 12:57:40,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:40,453 INFO L225 Difference]: With dead ends: 27 [2020-07-01 12:57:40,453 INFO L226 Difference]: Without dead ends: 24 [2020-07-01 12:57:40,454 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:57:40,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-01 12:57:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2020-07-01 12:57:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:57:40,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2020-07-01 12:57:40,459 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 10 [2020-07-01 12:57:40,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:40,459 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2020-07-01 12:57:40,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 12:57:40,459 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2020-07-01 12:57:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-01 12:57:40,460 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:40,460 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:40,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 12:57:40,460 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:40,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:40,461 INFO L82 PathProgramCache]: Analyzing trace with hash -386516586, now seen corresponding path program 1 times [2020-07-01 12:57:40,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:40,461 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058465771] [2020-07-01 12:57:40,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:40,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,513 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:40,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058465771] [2020-07-01 12:57:40,513 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379320911] [2020-07-01 12:57:40,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,548 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:57:40,549 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:40,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:57:40,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2020-07-01 12:57:40,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858959341] [2020-07-01 12:57:40,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-01 12:57:40,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:40,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-01 12:57:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:57:40,586 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand 7 states. [2020-07-01 12:57:40,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:40,706 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-01 12:57:40,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:57:40,706 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2020-07-01 12:57:40,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:40,707 INFO L225 Difference]: With dead ends: 26 [2020-07-01 12:57:40,707 INFO L226 Difference]: Without dead ends: 23 [2020-07-01 12:57:40,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:57:40,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-01 12:57:40,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-01 12:57:40,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-01 12:57:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2020-07-01 12:57:40,712 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 10 [2020-07-01 12:57:40,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:40,712 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2020-07-01 12:57:40,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-01 12:57:40,712 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2020-07-01 12:57:40,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-01 12:57:40,713 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:40,713 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:40,914 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:40,914 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 90609296, now seen corresponding path program 1 times [2020-07-01 12:57:40,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:40,915 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373854960] [2020-07-01 12:57:40,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:40,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:57:40,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373854960] [2020-07-01 12:57:40,964 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915032750] [2020-07-01 12:57:40,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:40,999 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:57:41,001 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:41,064 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:41,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:57:41,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 9 [2020-07-01 12:57:41,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661900082] [2020-07-01 12:57:41,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 12:57:41,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:41,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:57:41,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:57:41,066 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 9 states. [2020-07-01 12:57:41,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:41,233 INFO L93 Difference]: Finished difference Result 40 states and 56 transitions. [2020-07-01 12:57:41,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-01 12:57:41,233 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 13 [2020-07-01 12:57:41,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:41,234 INFO L225 Difference]: With dead ends: 40 [2020-07-01 12:57:41,234 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 12:57:41,235 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2020-07-01 12:57:41,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 12:57:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2020-07-01 12:57:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:57:41,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-07-01 12:57:41,240 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 13 [2020-07-01 12:57:41,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:41,240 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-01 12:57:41,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 12:57:41,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2020-07-01 12:57:41,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-01 12:57:41,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:41,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:41,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:41,442 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:41,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:41,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1534656237, now seen corresponding path program 1 times [2020-07-01 12:57:41,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:41,442 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887021964] [2020-07-01 12:57:41,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:41,513 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:41,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887021964] [2020-07-01 12:57:41,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894211098] [2020-07-01 12:57:41,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:41,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:41,545 INFO L264 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:57:41,547 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:41,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:41,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:57:41,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-07-01 12:57:41,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482347014] [2020-07-01 12:57:41,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 12:57:41,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:41,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 12:57:41,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:57:41,593 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2020-07-01 12:57:41,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:41,763 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2020-07-01 12:57:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-01 12:57:41,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-01 12:57:41,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:41,764 INFO L225 Difference]: With dead ends: 33 [2020-07-01 12:57:41,764 INFO L226 Difference]: Without dead ends: 30 [2020-07-01 12:57:41,765 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2020-07-01 12:57:41,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-01 12:57:41,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2020-07-01 12:57:41,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-01 12:57:41,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-07-01 12:57:41,770 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 16 [2020-07-01 12:57:41,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:41,771 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-07-01 12:57:41,771 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 12:57:41,771 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2020-07-01 12:57:41,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-01 12:57:41,772 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 12:57:41,772 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:41,972 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2020-07-01 12:57:41,973 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 12:57:41,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:41,973 INFO L82 PathProgramCache]: Analyzing trace with hash -984007206, now seen corresponding path program 2 times [2020-07-01 12:57:41,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:41,974 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282151930] [2020-07-01 12:57:41,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:41,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:42,039 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:42,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282151930] [2020-07-01 12:57:42,040 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54441027] [2020-07-01 12:57:42,040 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:42,066 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-01 12:57:42,066 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:57:42,067 INFO L264 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:57:42,068 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:42,074 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2020-07-01 12:57:42,075 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 12:57:42,080 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 12:57:42,080 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 12:57:42,080 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2020-07-01 12:57:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2020-07-01 12:57:42,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:57:42,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2020-07-01 12:57:42,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206315665] [2020-07-01 12:57:42,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 12:57:42,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 12:57:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-01 12:57:42,114 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2020-07-01 12:57:42,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:42,358 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2020-07-01 12:57:42,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-01 12:57:42,359 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2020-07-01 12:57:42,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 12:57:42,359 INFO L225 Difference]: With dead ends: 46 [2020-07-01 12:57:42,359 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 12:57:42,360 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2020-07-01 12:57:42,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 12:57:42,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 12:57:42,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 12:57:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 12:57:42,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2020-07-01 12:57:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 12:57:42,361 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:57:42,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 12:57:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:57:42,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 12:57:42,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:42,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 12:57:42,871 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2020-07-01 12:57:43,059 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 35 [2020-07-01 12:57:43,166 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 28 [2020-07-01 12:57:43,170 INFO L268 CegarLoopResult]: For program point L19-1(lines 19 21) no Hoare annotation was computed. [2020-07-01 12:57:43,170 INFO L264 CegarLoopResult]: At program point L19-3(lines 19 21) the Hoare annotation is: (let ((.cse4 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse0 (<= 1 ULTIMATE.start_main_~arr~0.base)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse7 (= 0 ULTIMATE.start_main_~j~0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse3 (= 0 ULTIMATE.start_main_~arr~0.offset)) (.cse5 (<= 1 |#StackHeapBarrier|)) (.cse6 (= (* ULTIMATE.start_main_~length~0 4) .cse4))) (or (and .cse0 .cse1 .cse2 .cse3 (< ULTIMATE.start_main_~j~0 (div .cse4 4)) .cse5 .cse6 (<= 1 ULTIMATE.start_main_~j~0)) (and .cse0 .cse1 .cse7 .cse2 .cse3 .cse5 .cse6 (<= (+ ULTIMATE.start_main_~arr~0.offset 4) .cse4) (<= ULTIMATE.start_main_~i~0 1)) (and .cse0 .cse1 (<= (+ ULTIMATE.start_main_~arr~0.offset 8) .cse4) .cse7 .cse2 .cse3 .cse5 .cse6)))) [2020-07-01 12:57:43,171 INFO L268 CegarLoopResult]: For program point L13(lines 13 15) no Hoare annotation was computed. [2020-07-01 12:57:43,171 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 15) no Hoare annotation was computed. [2020-07-01 12:57:43,171 INFO L264 CegarLoopResult]: At program point L11-2(lines 11 17) the Hoare annotation is: (let ((.cse6 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse0 (<= 1 ULTIMATE.start_main_~arr~0.base)) (.cse1 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse2 (<= 0 ULTIMATE.start_main_~i~0)) (.cse3 (= 0 ULTIMATE.start_main_~arr~0.offset)) (.cse4 (<= 1 |#StackHeapBarrier|)) (.cse5 (= (* ULTIMATE.start_main_~length~0 4) .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= (+ ULTIMATE.start_main_~arr~0.offset 4) .cse6) (<= ULTIMATE.start_main_~i~0 1)) (and .cse0 (<= (+ ULTIMATE.start_main_~arr~0.offset 8) .cse6) .cse1 .cse2 .cse3 .cse4 .cse5)))) [2020-07-01 12:57:43,171 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 12:57:43,171 INFO L268 CegarLoopResult]: For program point L20(line 20) no Hoare annotation was computed. [2020-07-01 12:57:43,171 INFO L268 CegarLoopResult]: For program point L20-2(line 20) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 22) the Hoare annotation is: (let ((.cse11 (select |#length| ULTIMATE.start_main_~arr~0.base))) (let ((.cse6 (<= (+ ULTIMATE.start_main_~arr~0.offset 4) .cse11)) (.cse8 (<= ULTIMATE.start_main_~i~0 1)) (.cse9 (= 0 ULTIMATE.start_main_~j~0)) (.cse0 (<= 1 ULTIMATE.start_main_~arr~0.base)) (.cse1 (<= 1 ULTIMATE.start_main_~i~0)) (.cse10 (<= (+ ULTIMATE.start_main_~arr~0.offset 8) .cse11)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_main_~arr~0.base))) (.cse3 (= 0 ULTIMATE.start_main_~arr~0.offset)) (.cse4 (<= 1 |#StackHeapBarrier|)) (.cse5 (= (* ULTIMATE.start_main_~length~0 4) .cse11)) (.cse7 (<= 1 ULTIMATE.start_main_~j~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse9 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8) (and .cse0 .cse1 .cse10 .cse9 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse7)))) [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed. [2020-07-01 12:57:43,172 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:57:43,173 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 20) no Hoare annotation was computed. [2020-07-01 12:57:43,173 INFO L268 CegarLoopResult]: For program point L8-2(line 8) no Hoare annotation was computed. [2020-07-01 12:57:43,173 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 12:57:43,173 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 12:57:43,176 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 12:57:43,186 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,187 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,188 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,189 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,198 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,199 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,200 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,203 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,204 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,206 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,207 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,208 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,210 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,211 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:43,212 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:43,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:57:43 BasicIcfg [2020-07-01 12:57:43,215 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 12:57:43,215 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 12:57:43,215 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 12:57:43,219 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 12:57:43,220 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:57:43,220 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 12:57:37" (1/5) ... [2020-07-01 12:57:43,221 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588a8560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:57:43, skipping insertion in model container [2020-07-01 12:57:43,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:57:43,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 12:57:38" (2/5) ... [2020-07-01 12:57:43,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588a8560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 12:57:43, skipping insertion in model container [2020-07-01 12:57:43,222 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:57:43,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 12:57:38" (3/5) ... [2020-07-01 12:57:43,223 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588a8560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:57:43, skipping insertion in model container [2020-07-01 12:57:43,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:57:43,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 12:57:38" (4/5) ... [2020-07-01 12:57:43,223 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@588a8560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:57:43, skipping insertion in model container [2020-07-01 12:57:43,223 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 12:57:43,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 12:57:43" (5/5) ... [2020-07-01 12:57:43,225 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 12:57:43,247 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 12:57:43,247 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 12:57:43,247 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 12:57:43,247 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 12:57:43,247 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 12:57:43,248 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 12:57:43,248 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 12:57:43,248 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 12:57:43,252 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-01 12:57:43,257 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:57:43,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:43,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:43,261 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:57:43,262 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:43,262 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 12:57:43,262 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states. [2020-07-01 12:57:43,263 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:57:43,263 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:43,263 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:43,264 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:57:43,264 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:43,269 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 11#L8true [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 6#L8-2true [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 17#L10true [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 13#L11-2true [2020-07-01 12:57:43,270 INFO L796 eck$LassoCheckResult]: Loop: 13#L11-2true [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 22#L13true [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 20#L13-2true [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 13#L11-2true [2020-07-01 12:57:43,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:43,271 INFO L82 PathProgramCache]: Analyzing trace with hash 5558776, now seen corresponding path program 1 times [2020-07-01 12:57:43,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:43,271 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152515972] [2020-07-01 12:57:43,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:43,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:43,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:43,300 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:43,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:43,301 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 1 times [2020-07-01 12:57:43,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:43,302 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992412207] [2020-07-01 12:57:43,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:43,311 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:43,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:43,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1902138580, now seen corresponding path program 1 times [2020-07-01 12:57:43,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:43,312 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335096189] [2020-07-01 12:57:43,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:43,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:43,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:43,330 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:43,492 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:57:43,492 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:57:43,493 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:57:43,493 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:57:43,493 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:57:43,493 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:43,493 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:57:43,493 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:57:43,494 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 12:57:43,494 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:57:43,494 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:57:43,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:43,817 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:57:43,823 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:43,827 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:43,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:43,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:43,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:43,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:43,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:43,833 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:43,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:43,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:43,869 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:43,870 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:43,871 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:43,871 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:43,871 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:43,871 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:43,872 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:43,872 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:43,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:43,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:43,907 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:43,907 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:43,907 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:43,907 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:43,908 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:43,908 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:43,908 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:43,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:43,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:43,943 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:43,944 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:43,944 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:43,944 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:43,948 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:43,949 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:43,955 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:43,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:43,990 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:43,990 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:43,990 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:43,990 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:43,999 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:43,999 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:44,012 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:57:44,043 INFO L443 ModelExtractionUtils]: Simplification made 11 calls to the SMT solver. [2020-07-01 12:57:44,043 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 18 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:44,058 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:57:44,062 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 12:57:44,062 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:57:44,063 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-01 12:57:44,102 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-01 12:57:44,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:44,134 INFO L264 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:57:44,135 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:44,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:44,142 INFO L264 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:57:44,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:44,155 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 12:57:44,175 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 2 predicates after loop cannibalization [2020-07-01 12:57:44,179 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-01 12:57:44,180 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 20 states. Second operand 3 states. [2020-07-01 12:57:44,286 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 20 states.. Second operand 3 states. Result 53 states and 94 transitions. Complement of second has 6 states. [2020-07-01 12:57:44,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 12:57:44,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-01 12:57:44,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2020-07-01 12:57:44,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 4 letters. Loop has 3 letters. [2020-07-01 12:57:44,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 7 letters. Loop has 3 letters. [2020-07-01 12:57:44,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:44,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 64 transitions. Stem has 4 letters. Loop has 6 letters. [2020-07-01 12:57:44,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:44,312 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 94 transitions. [2020-07-01 12:57:44,314 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-01 12:57:44,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 22 states and 34 transitions. [2020-07-01 12:57:44,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-07-01 12:57:44,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-01 12:57:44,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 34 transitions. [2020-07-01 12:57:44,317 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:57:44,318 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 34 transitions. [2020-07-01 12:57:44,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 34 transitions. [2020-07-01 12:57:44,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 16. [2020-07-01 12:57:44,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:57:44,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 27 transitions. [2020-07-01 12:57:44,320 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 27 transitions. [2020-07-01 12:57:44,320 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 27 transitions. [2020-07-01 12:57:44,320 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 12:57:44,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 27 transitions. [2020-07-01 12:57:44,321 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:57:44,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:44,322 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:44,322 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:57:44,322 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:44,322 INFO L794 eck$LassoCheckResult]: Stem: 139#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 140#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 144#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 135#L10 [134] L10-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (< 0 v_ULTIMATE.start_main_~arr~0.offset_5)) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_5} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 136#L11-2 [2020-07-01 12:57:44,323 INFO L796 eck$LassoCheckResult]: Loop: 136#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 147#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 141#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 136#L11-2 [2020-07-01 12:57:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,323 INFO L82 PathProgramCache]: Analyzing trace with hash 5558775, now seen corresponding path program 1 times [2020-07-01 12:57:44,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,324 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663760908] [2020-07-01 12:57:44,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:44,337 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 12:57:44,337 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663760908] [2020-07-01 12:57:44,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:44,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:57:44,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090676053] [2020-07-01 12:57:44,338 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:57:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,339 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 2 times [2020-07-01 12:57:44,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,339 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275193133] [2020-07-01 12:57:44,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,347 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:44,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:44,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:44,393 INFO L87 Difference]: Start difference. First operand 16 states and 27 transitions. cyclomatic complexity: 14 Second operand 3 states. [2020-07-01 12:57:44,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:44,409 INFO L93 Difference]: Finished difference Result 16 states and 25 transitions. [2020-07-01 12:57:44,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:44,412 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 25 transitions. [2020-07-01 12:57:44,413 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:57:44,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 25 transitions. [2020-07-01 12:57:44,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-01 12:57:44,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-01 12:57:44,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 25 transitions. [2020-07-01 12:57:44,414 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:57:44,414 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-07-01 12:57:44,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 25 transitions. [2020-07-01 12:57:44,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-01 12:57:44,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-01 12:57:44,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 25 transitions. [2020-07-01 12:57:44,416 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-07-01 12:57:44,416 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 25 transitions. [2020-07-01 12:57:44,416 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-01 12:57:44,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 25 transitions. [2020-07-01 12:57:44,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:57:44,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:44,417 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:44,417 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:57:44,417 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:44,418 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 178#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 182#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 173#L10 [132] L10-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> 0 v_ULTIMATE.start_main_~arr~0.base_5)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 174#L11-2 [2020-07-01 12:57:44,418 INFO L796 eck$LassoCheckResult]: Loop: 174#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 185#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 179#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 174#L11-2 [2020-07-01 12:57:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,418 INFO L82 PathProgramCache]: Analyzing trace with hash 5558773, now seen corresponding path program 1 times [2020-07-01 12:57:44,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,419 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733413980] [2020-07-01 12:57:44,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:44,430 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 12:57:44,430 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733413980] [2020-07-01 12:57:44,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:44,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:57:44,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945828675] [2020-07-01 12:57:44,431 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:57:44,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,432 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 3 times [2020-07-01 12:57:44,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,432 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597539395] [2020-07-01 12:57:44,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,440 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:44,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:44,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:44,476 INFO L87 Difference]: Start difference. First operand 16 states and 25 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-01 12:57:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:44,498 INFO L93 Difference]: Finished difference Result 22 states and 32 transitions. [2020-07-01 12:57:44,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:44,501 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 32 transitions. [2020-07-01 12:57:44,502 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2020-07-01 12:57:44,502 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 32 transitions. [2020-07-01 12:57:44,503 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-07-01 12:57:44,503 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-07-01 12:57:44,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 32 transitions. [2020-07-01 12:57:44,503 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:57:44,503 INFO L688 BuchiCegarLoop]: Abstraction has 22 states and 32 transitions. [2020-07-01 12:57:44,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 32 transitions. [2020-07-01 12:57:44,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2020-07-01 12:57:44,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-01 12:57:44,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 26 transitions. [2020-07-01 12:57:44,505 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-07-01 12:57:44,505 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 26 transitions. [2020-07-01 12:57:44,505 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-01 12:57:44,505 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 26 transitions. [2020-07-01 12:57:44,506 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2020-07-01 12:57:44,506 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:44,506 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:44,506 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 12:57:44,506 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:44,507 INFO L794 eck$LassoCheckResult]: Stem: 219#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 220#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 226#L8-2 [130] L8-2-->L10: Formula: (and (> 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 227#L10 [132] L10-->L11-2: Formula: (and (= v_ULTIMATE.start_main_~i~0_4 0) (> 0 v_ULTIMATE.start_main_~arr~0.base_5)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 223#L11-2 [2020-07-01 12:57:44,507 INFO L796 eck$LassoCheckResult]: Loop: 223#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 230#L13 [113] L13-->L13-2: Formula: (and (< v_ULTIMATE.start_main_~val~0_6 0) (= v_ULTIMATE.start_main_~val~0_5 0)) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_6} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_~val~0] 222#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 223#L11-2 [2020-07-01 12:57:44,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,508 INFO L82 PathProgramCache]: Analyzing trace with hash 5558742, now seen corresponding path program 1 times [2020-07-01 12:57:44,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,508 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338630367] [2020-07-01 12:57:44,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:44,522 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 12:57:44,523 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338630367] [2020-07-01 12:57:44,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:44,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 12:57:44,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930140205] [2020-07-01 12:57:44,523 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:57:44,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash 119939, now seen corresponding path program 4 times [2020-07-01 12:57:44,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,524 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214539574] [2020-07-01 12:57:44,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,532 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:44,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 12:57:44,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 12:57:44,569 INFO L87 Difference]: Start difference. First operand 17 states and 26 transitions. cyclomatic complexity: 12 Second operand 3 states. [2020-07-01 12:57:44,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:44,577 INFO L93 Difference]: Finished difference Result 13 states and 18 transitions. [2020-07-01 12:57:44,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 12:57:44,579 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 18 transitions. [2020-07-01 12:57:44,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:57:44,580 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 13 states and 18 transitions. [2020-07-01 12:57:44,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-01 12:57:44,581 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-01 12:57:44,581 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-07-01 12:57:44,581 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:57:44,581 INFO L688 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-01 12:57:44,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-07-01 12:57:44,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-01 12:57:44,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:57:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-07-01 12:57:44,583 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-01 12:57:44,583 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-07-01 12:57:44,583 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-01 12:57:44,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-07-01 12:57:44,583 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:57:44,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:44,584 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:44,584 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 12:57:44,584 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:44,584 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 256#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 260#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 253#L10 [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 254#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 251#L18-3 [2020-07-01 12:57:44,585 INFO L796 eck$LassoCheckResult]: Loop: 251#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 252#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 257#L19-1 [157] L19-1-->L18-3: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem5_9| 0) (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 251#L18-3 [2020-07-01 12:57:44,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,585 INFO L82 PathProgramCache]: Analyzing trace with hash 172322210, now seen corresponding path program 1 times [2020-07-01 12:57:44,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141132356] [2020-07-01 12:57:44,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:44,605 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 12:57:44,606 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141132356] [2020-07-01 12:57:44,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 12:57:44,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 12:57:44,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103719022] [2020-07-01 12:57:44,607 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:57:44,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,607 INFO L82 PathProgramCache]: Analyzing trace with hash 108998, now seen corresponding path program 1 times [2020-07-01 12:57:44,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,607 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893755033] [2020-07-01 12:57:44,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,614 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:44,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 12:57:44,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 12:57:44,646 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-01 12:57:44,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:44,668 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-01 12:57:44,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 12:57:44,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 20 transitions. [2020-07-01 12:57:44,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:57:44,672 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 20 transitions. [2020-07-01 12:57:44,672 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-01 12:57:44,672 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-01 12:57:44,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-01 12:57:44,673 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:57:44,673 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-01 12:57:44,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-01 12:57:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 13. [2020-07-01 12:57:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-01 12:57:44,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2020-07-01 12:57:44,674 INFO L711 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-01 12:57:44,674 INFO L591 BuchiCegarLoop]: Abstraction has 13 states and 17 transitions. [2020-07-01 12:57:44,674 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-01 12:57:44,674 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 17 transitions. [2020-07-01 12:57:44,675 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-07-01 12:57:44,675 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:44,675 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:44,675 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:44,676 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-01 12:57:44,676 INFO L794 eck$LassoCheckResult]: Stem: 290#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 291#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 295#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 288#L10 [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 289#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 298#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 293#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 294#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 286#L18-3 [2020-07-01 12:57:44,676 INFO L796 eck$LassoCheckResult]: Loop: 286#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 287#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 292#L19-1 [157] L19-1-->L18-3: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem5_9| 0) (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 286#L18-3 [2020-07-01 12:57:44,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1163252084, now seen corresponding path program 1 times [2020-07-01 12:57:44,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,677 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056113601] [2020-07-01 12:57:44,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,693 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,693 INFO L82 PathProgramCache]: Analyzing trace with hash 108998, now seen corresponding path program 2 times [2020-07-01 12:57:44,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,694 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316179006] [2020-07-01 12:57:44,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,700 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:44,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1648197773, now seen corresponding path program 1 times [2020-07-01 12:57:44,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:44,701 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228345600] [2020-07-01 12:57:44,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:44,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:44,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:44,882 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2020-07-01 12:57:44,926 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:57:44,926 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:57:44,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:57:44,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:57:44,927 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:57:44,927 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:44,927 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:57:44,927 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:57:44,927 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration6_Lasso [2020-07-01 12:57:44,927 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:57:44,927 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:57:44,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:44,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:45,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:45,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:45,283 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:57:45,283 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,286 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,288 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,288 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,289 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,289 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,322 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:45,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:45,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,363 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,364 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,364 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,400 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,400 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,434 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,437 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,437 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,439 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,474 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,474 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,474 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,474 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,474 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,475 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,475 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,508 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,510 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,510 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,511 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,511 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,513 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,546 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:45,546 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,546 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,546 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:45,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:45,548 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,583 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,583 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,587 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:45,587 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:45,593 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,627 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:45,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:45,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:45,630 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:45,630 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:45,637 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:45,637 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:45,651 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:57:45,689 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-07-01 12:57:45,689 INFO L444 ModelExtractionUtils]: 10 out of 25 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-01 12:57:45,705 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:45,710 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-01 12:57:45,711 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:57:45,711 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0, v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2) = -4*ULTIMATE.start_main_~j~0 + 1*v_rep(select #length ULTIMATE.start_main_~arr~0.base)_2 Supporting invariants [1*ULTIMATE.start_main_~arr~0.offset >= 0] [2020-07-01 12:57:45,749 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-01 12:57:45,751 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:45,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:45,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:45,780 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:57:45,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:45,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:45,791 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:57:45,792 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:45,804 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 12:57:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:45,831 INFO L264 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-01 12:57:45,832 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:45,871 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 12:57:45,871 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-07-01 12:57:45,871 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 13 states and 17 transitions. cyclomatic complexity: 6 Second operand 5 states. [2020-07-01 12:57:45,927 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 13 states and 17 transitions. cyclomatic complexity: 6. Second operand 5 states. Result 20 states and 26 transitions. Complement of second has 7 states. [2020-07-01 12:57:45,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 12:57:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 12:57:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 24 transitions. [2020-07-01 12:57:45,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-01 12:57:45,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:45,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 11 letters. Loop has 3 letters. [2020-07-01 12:57:45,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:45,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 24 transitions. Stem has 8 letters. Loop has 6 letters. [2020-07-01 12:57:45,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:45,931 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2020-07-01 12:57:45,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:45,933 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 26 transitions. [2020-07-01 12:57:45,933 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-01 12:57:45,933 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-01 12:57:45,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 26 transitions. [2020-07-01 12:57:45,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:57:45,933 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 26 transitions. [2020-07-01 12:57:45,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 26 transitions. [2020-07-01 12:57:45,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-07-01 12:57:45,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-01 12:57:45,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2020-07-01 12:57:45,935 INFO L711 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-01 12:57:45,935 INFO L591 BuchiCegarLoop]: Abstraction has 18 states and 24 transitions. [2020-07-01 12:57:45,935 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-01 12:57:45,935 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 24 transitions. [2020-07-01 12:57:45,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:45,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:45,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:45,936 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:45,936 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:57:45,937 INFO L794 eck$LassoCheckResult]: Stem: 416#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 417#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 420#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 412#L10 [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 413#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 425#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 418#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 419#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 408#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 410#L19-3 [2020-07-01 12:57:45,937 INFO L796 eck$LassoCheckResult]: Loop: 410#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 414#L19-1 [106] L19-1-->L20: 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] 421#L20 [158] L20-->L20-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_20))) (and (= |v_ULTIMATE.start_main_#t~post7_6| |v_ULTIMATE.start_main_#t~mem6_6|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~arr~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem6_6| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_19) (+ (* v_ULTIMATE.start_main_~j~0_20 4) v_ULTIMATE.start_main_~arr~0.offset_15))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15 4) (select |v_#length_12| v_ULTIMATE.start_main_~arr~0.base_19)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 423#L20-2 [159] L20-2-->L19-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_21))) (and (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20) (+ (* v_ULTIMATE.start_main_~j~0_21 4) v_ULTIMATE.start_main_~arr~0.offset_16) (+ |v_ULTIMATE.start_main_#t~post7_8| (- 1)))) |v_#memory_int_10|) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr~0.base_20)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~arr~0.base_20)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_8|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 410#L19-3 [2020-07-01 12:57:45,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:45,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1701076315, now seen corresponding path program 1 times [2020-07-01 12:57:45,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:45,938 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561350751] [2020-07-01 12:57:45,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:45,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:45,952 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:45,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:45,953 INFO L82 PathProgramCache]: Analyzing trace with hash 4039335, now seen corresponding path program 1 times [2020-07-01 12:57:45,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:45,953 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314922455] [2020-07-01 12:57:45,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:45,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:45,960 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:45,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:45,960 INFO L82 PathProgramCache]: Analyzing trace with hash 924828417, now seen corresponding path program 1 times [2020-07-01 12:57:45,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:45,961 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421837701] [2020-07-01 12:57:45,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:45,980 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:46,131 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2020-07-01 12:57:46,170 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:57:46,170 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:57:46,170 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:57:46,170 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:57:46,171 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:57:46,171 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,171 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:57:46,171 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:57:46,171 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration7_Lasso [2020-07-01 12:57:46,171 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:57:46,171 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:57:46,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,181 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,323 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,329 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,335 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:46,544 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:57:46,545 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,547 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,549 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:46,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,550 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:46,550 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:46,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,585 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,585 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:46,585 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,586 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,586 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,586 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:46,586 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:46,588 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:46,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,622 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:46,622 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:46,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,655 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,656 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,657 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:46,657 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,657 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,657 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,658 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:46,658 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:46,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,693 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,693 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:46,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:46,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,729 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,731 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,736 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:46,737 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:46,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,779 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,782 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:46,783 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:46,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,820 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:46,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:46,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:46,864 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:46,865 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:46,865 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:46,865 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:46,868 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:46,868 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:46,877 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:57:46,888 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-07-01 12:57:46,888 INFO L444 ModelExtractionUtils]: 4 out of 13 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:46,890 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:57:46,893 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 12:57:46,893 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:57:46,894 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) ULTIMATE.start_main_~arr~0.offset)_1 Supporting invariants [] [2020-07-01 12:57:46,933 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-01 12:57:46,935 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:57:46,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:46,964 INFO L264 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:57:46,965 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:46,977 INFO L264 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-01 12:57:46,978 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:47,023 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 12:57:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,085 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 12:57:47,085 INFO L98 LoopCannibalizer]: 5 predicates before loop cannibalization 5 predicates after loop cannibalization [2020-07-01 12:57:47,085 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2020-07-01 12:57:47,085 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-07-01 12:57:47,217 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 18 states and 24 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 47 states and 58 transitions. Complement of second has 19 states. [2020-07-01 12:57:47,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 7 non-accepting loop states 2 accepting loop states [2020-07-01 12:57:47,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-01 12:57:47,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 36 transitions. [2020-07-01 12:57:47,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 9 letters. Loop has 4 letters. [2020-07-01 12:57:47,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:47,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 13 letters. Loop has 4 letters. [2020-07-01 12:57:47,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:47,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 36 transitions. Stem has 9 letters. Loop has 8 letters. [2020-07-01 12:57:47,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:47,221 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 58 transitions. [2020-07-01 12:57:47,222 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:47,223 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 26 states and 32 transitions. [2020-07-01 12:57:47,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-01 12:57:47,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-01 12:57:47,223 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 32 transitions. [2020-07-01 12:57:47,223 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:57:47,223 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-01 12:57:47,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 32 transitions. [2020-07-01 12:57:47,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 23. [2020-07-01 12:57:47,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:57:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2020-07-01 12:57:47,225 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-01 12:57:47,225 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-01 12:57:47,225 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-01 12:57:47,226 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2020-07-01 12:57:47,226 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:47,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:47,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:47,227 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:47,227 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:57:47,227 INFO L794 eck$LassoCheckResult]: Stem: 596#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 597#L8 [107] L8-->L8-2: Formula: (and (< v_ULTIMATE.start_main_~length~0_5 1) (= v_ULTIMATE.start_main_~length~0_4 1)) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_5} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~length~0] 600#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 592#L10 [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 593#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 606#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 598#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 599#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 587#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 588#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 608#L19-1 [157] L19-1-->L18-3: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem5_9| 0) (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 589#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 591#L19-3 [2020-07-01 12:57:47,228 INFO L796 eck$LassoCheckResult]: Loop: 591#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 594#L19-1 [106] L19-1-->L20: 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] 603#L20 [158] L20-->L20-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_20))) (and (= |v_ULTIMATE.start_main_#t~post7_6| |v_ULTIMATE.start_main_#t~mem6_6|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~arr~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem6_6| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_19) (+ (* v_ULTIMATE.start_main_~j~0_20 4) v_ULTIMATE.start_main_~arr~0.offset_15))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15 4) (select |v_#length_12| v_ULTIMATE.start_main_~arr~0.base_19)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 601#L20-2 [159] L20-2-->L19-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_21))) (and (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20) (+ (* v_ULTIMATE.start_main_~j~0_21 4) v_ULTIMATE.start_main_~arr~0.offset_16) (+ |v_ULTIMATE.start_main_#t~post7_8| (- 1)))) |v_#memory_int_10|) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr~0.base_20)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~arr~0.base_20)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_8|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 591#L19-3 [2020-07-01 12:57:47,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 445476668, now seen corresponding path program 2 times [2020-07-01 12:57:47,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,229 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337449801] [2020-07-01 12:57:47,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:47,266 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:57:47,266 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337449801] [2020-07-01 12:57:47,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873482993] [2020-07-01 12:57:47,267 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:47,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 12:57:47,302 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 12:57:47,302 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-01 12:57:47,303 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:47,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 12:57:47,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 12:57:47,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2020-07-01 12:57:47,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748402370] [2020-07-01 12:57:47,328 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:57:47,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,329 INFO L82 PathProgramCache]: Analyzing trace with hash 4039335, now seen corresponding path program 2 times [2020-07-01 12:57:47,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,329 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113475136] [2020-07-01 12:57:47,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,336 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:47,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:47,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 12:57:47,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-07-01 12:57:47,370 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-01 12:57:47,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:47,405 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2020-07-01 12:57:47,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 12:57:47,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 44 transitions. [2020-07-01 12:57:47,408 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:47,408 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 23 states and 28 transitions. [2020-07-01 12:57:47,409 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-01 12:57:47,409 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-01 12:57:47,409 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-07-01 12:57:47,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:57:47,409 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:57:47,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-07-01 12:57:47,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-01 12:57:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-01 12:57:47,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-01 12:57:47,411 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:57:47,411 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-01 12:57:47,411 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2020-07-01 12:57:47,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 28 transitions. [2020-07-01 12:57:47,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:47,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:47,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:47,412 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:47,412 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:57:47,413 INFO L794 eck$LassoCheckResult]: Stem: 698#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 699#L8 [115] L8-->L8-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 702#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 694#L10 [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 695#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 708#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 700#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 701#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 689#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 690#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 710#L19-1 [157] L19-1-->L18-3: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem5_9| 0) (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 691#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 693#L19-3 [2020-07-01 12:57:47,413 INFO L796 eck$LassoCheckResult]: Loop: 693#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 696#L19-1 [106] L19-1-->L20: 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] 703#L20 [158] L20-->L20-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_20))) (and (= |v_ULTIMATE.start_main_#t~post7_6| |v_ULTIMATE.start_main_#t~mem6_6|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~arr~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem6_6| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_19) (+ (* v_ULTIMATE.start_main_~j~0_20 4) v_ULTIMATE.start_main_~arr~0.offset_15))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15 4) (select |v_#length_12| v_ULTIMATE.start_main_~arr~0.base_19)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 706#L20-2 [159] L20-2-->L19-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_21))) (and (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20) (+ (* v_ULTIMATE.start_main_~j~0_21 4) v_ULTIMATE.start_main_~arr~0.offset_16) (+ |v_ULTIMATE.start_main_#t~post7_8| (- 1)))) |v_#memory_int_10|) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr~0.base_20)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~arr~0.base_20)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_8|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 693#L19-3 [2020-07-01 12:57:47,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1045232316, now seen corresponding path program 1 times [2020-07-01 12:57:47,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,414 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741513022] [2020-07-01 12:57:47,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:47,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:47,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741513022] [2020-07-01 12:57:47,446 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854115316] [2020-07-01 12:57:47,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 12:57:47,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:47,473 INFO L264 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-01 12:57:47,474 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 12:57:47,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 12:57:47,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-01 12:57:47,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308262186] [2020-07-01 12:57:47,502 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 12:57:47,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,503 INFO L82 PathProgramCache]: Analyzing trace with hash 4039335, now seen corresponding path program 3 times [2020-07-01 12:57:47,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050697526] [2020-07-01 12:57:47,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,510 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:47,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 12:57:47,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 12:57:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-01 12:57:47,541 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. cyclomatic complexity: 9 Second operand 9 states. [2020-07-01 12:57:47,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 12:57:47,615 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-07-01 12:57:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 12:57:47,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 43 transitions. [2020-07-01 12:57:47,618 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:47,619 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 28 states and 35 transitions. [2020-07-01 12:57:47,619 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-01 12:57:47,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-07-01 12:57:47,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2020-07-01 12:57:47,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-01 12:57:47,619 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2020-07-01 12:57:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2020-07-01 12:57:47,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2020-07-01 12:57:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 12:57:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2020-07-01 12:57:47,621 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-01 12:57:47,622 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 32 transitions. [2020-07-01 12:57:47,622 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2020-07-01 12:57:47,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 32 transitions. [2020-07-01 12:57:47,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-01 12:57:47,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 12:57:47,622 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 12:57:47,623 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 12:57:47,623 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-01 12:57:47,624 INFO L794 eck$LassoCheckResult]: Stem: 805#ULTIMATE.startENTRY [152] ULTIMATE.startENTRY-->L8: Formula: (and (= 0 |v_#NULL.base_2|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|) (= |v_#valid_17| (store |v_#valid_18| 0 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~nondet0=|v_ULTIMATE.start_main_#t~nondet0_6|, ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_7|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_13, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_4|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_4|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_11, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_5|, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_4|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_7|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_17, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_15, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_5|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_9, #valid=|v_#valid_17|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_5|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_7|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet0, ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_#t~post2, #NULL.offset, ULTIMATE.start_main_~i~0, ULTIMATE.start_main_#t~post7, #NULL.base, ULTIMATE.start_main_#t~post4, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.base, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#res, ULTIMATE.start_main_~val~0, #valid, ULTIMATE.start_main_#t~mem6, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_~length~0] 806#L8 [115] L8-->L8-2: Formula: (>= v_ULTIMATE.start_main_~length~0_6 1) InVars {ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} OutVars{ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_6} AuxVars[] AssignedVars[] 809#L8-2 [131] L8-2-->L10: Formula: (and (< 0 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.base_3 |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= v_ULTIMATE.start_main_~arr~0.offset_3 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2| 1)) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_main_#t~malloc1.base_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc1.base_2|)) (= 0 |v_ULTIMATE.start_main_#t~malloc1.offset_2|) (= (store |v_#length_3| |v_ULTIMATE.start_main_#t~malloc1.base_2| (* v_ULTIMATE.start_main_~length~0_7 4)) |v_#length_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_3|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7, #valid=|v_#valid_4|} OutVars{ULTIMATE.start_main_#t~malloc1.offset=|v_ULTIMATE.start_main_#t~malloc1.offset_2|, ULTIMATE.start_main_#t~malloc1.base=|v_ULTIMATE.start_main_#t~malloc1.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_3, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_3, #valid=|v_#valid_3|, #length=|v_#length_2|, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc1.offset, ULTIMATE.start_main_#t~malloc1.base, ULTIMATE.start_main_~arr~0.offset, ULTIMATE.start_main_~arr~0.base, #valid, #length] 801#L10 [135] L10-->L11-2: Formula: (and (< 0 v_ULTIMATE.start_main_~arr~0.base_5) (= v_ULTIMATE.start_main_~i~0_4 0)) InVars {ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5} OutVars{ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_5, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~i~0] 802#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 817#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 807#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 808#L11-2 [90] L11-2-->L13: Formula: (and (= v_ULTIMATE.start_main_~val~0_4 |v_ULTIMATE.start_main_#t~nondet3_3|) (< v_ULTIMATE.start_main_~i~0_6 v_ULTIMATE.start_main_~length~0_9)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_3|} OutVars{ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_6, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_9, ULTIMATE.start_main_#t~nondet3=|v_ULTIMATE.start_main_#t~nondet3_2|, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet3, ULTIMATE.start_main_~val~0] 815#L13 [119] L13-->L13-2: Formula: (>= v_ULTIMATE.start_main_~val~0_7 0) InVars {ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} OutVars{ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_7} AuxVars[] AssignedVars[] 816#L13-2 [155] L13-2-->L11-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~i~0_14))) (and (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_main_~arr~0.base_18)) (= v_ULTIMATE.start_main_~i~0_13 (+ v_ULTIMATE.start_main_~i~0_14 1)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_14 4) (select |v_#length_11| v_ULTIMATE.start_main_~arr~0.base_18)) (= |v_#memory_int_7| (store |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18 (store (select |v_#memory_int_8| v_ULTIMATE.start_main_~arr~0.base_18) (+ (* v_ULTIMATE.start_main_~i~0_14 4) v_ULTIMATE.start_main_~arr~0.offset_14) v_ULTIMATE.start_main_~val~0_10))))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_8|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_14, #length=|v_#length_11|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_14, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_18, ULTIMATE.start_main_~val~0=v_ULTIMATE.start_main_~val~0_10, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~post2=|v_ULTIMATE.start_main_#t~post2_5|, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_13, #length=|v_#length_11|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post2, ULTIMATE.start_main_~i~0] 818#L11-2 [154] L11-2-->L18-3: Formula: (and (<= v_ULTIMATE.start_main_~length~0_13 v_ULTIMATE.start_main_~i~0_12) (= 0 v_ULTIMATE.start_main_~j~0_16)) InVars {ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_16, ULTIMATE.start_main_~i~0=v_ULTIMATE.start_main_~i~0_12, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_13} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0] 796#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 797#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 819#L19-1 [157] L19-1-->L18-3: Formula: (and (<= |v_ULTIMATE.start_main_#t~mem5_9| 0) (= v_ULTIMATE.start_main_~j~0_18 (+ v_ULTIMATE.start_main_~j~0_19 1))) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_19, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_9|} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_18, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_8|, ULTIMATE.start_main_#t~post4=|v_ULTIMATE.start_main_#t~post4_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~j~0, ULTIMATE.start_main_#t~mem5, ULTIMATE.start_main_#t~post4] 798#L18-3 [79] L18-3-->L19-3: Formula: (< v_ULTIMATE.start_main_~j~0_9 v_ULTIMATE.start_main_~length~0_11) InVars {ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} OutVars{ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_9, ULTIMATE.start_main_~length~0=v_ULTIMATE.start_main_~length~0_11} AuxVars[] AssignedVars[] 800#L19-3 [2020-07-01 12:57:47,624 INFO L796 eck$LassoCheckResult]: Loop: 800#L19-3 [101] L19-3-->L19-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_10))) (and (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8 4) (select |v_#length_6| v_ULTIMATE.start_main_~arr~0.base_9)) (= |v_ULTIMATE.start_main_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_main_~arr~0.base_9) (+ (* v_ULTIMATE.start_main_~j~0_10 4) v_ULTIMATE.start_main_~arr~0.offset_8))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_8)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_main_~arr~0.base_9)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_8, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_9, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_10, #valid=|v_#valid_11|, #memory_int=|v_#memory_int_3|, #length=|v_#length_6|, ULTIMATE.start_main_#t~mem5=|v_ULTIMATE.start_main_#t~mem5_2|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem5] 803#L19-1 [106] L19-1-->L20: 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] 810#L20 [158] L20-->L20-2: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_20))) (and (= |v_ULTIMATE.start_main_#t~post7_6| |v_ULTIMATE.start_main_#t~mem6_6|) (= 1 (select |v_#valid_22| v_ULTIMATE.start_main_~arr~0.base_19)) (= |v_ULTIMATE.start_main_#t~mem6_6| (select (select |v_#memory_int_9| v_ULTIMATE.start_main_~arr~0.base_19) (+ (* v_ULTIMATE.start_main_~j~0_20 4) v_ULTIMATE.start_main_~arr~0.offset_15))) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_15 4) (select |v_#length_12| v_ULTIMATE.start_main_~arr~0.base_19)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_15, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_19, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_20, #valid=|v_#valid_22|, #memory_int=|v_#memory_int_9|, #length=|v_#length_12|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_6|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 813#L20-2 [159] L20-2-->L19-3: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_main_~j~0_21))) (and (= (store |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20 (store (select |v_#memory_int_11| v_ULTIMATE.start_main_~arr~0.base_20) (+ (* v_ULTIMATE.start_main_~j~0_21 4) v_ULTIMATE.start_main_~arr~0.offset_16) (+ |v_ULTIMATE.start_main_#t~post7_8| (- 1)))) |v_#memory_int_10|) (<= 0 (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16)) (<= (+ .cse0 v_ULTIMATE.start_main_~arr~0.offset_16 4) (select |v_#length_13| v_ULTIMATE.start_main_~arr~0.base_20)) (= 1 (select |v_#valid_23| v_ULTIMATE.start_main_~arr~0.base_20)))) InVars {ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_8|} OutVars{ULTIMATE.start_main_~arr~0.offset=v_ULTIMATE.start_main_~arr~0.offset_16, ULTIMATE.start_main_~arr~0.base=v_ULTIMATE.start_main_~arr~0.base_20, ULTIMATE.start_main_~j~0=v_ULTIMATE.start_main_~j~0_21, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_10|, #length=|v_#length_13|, ULTIMATE.start_main_#t~post7=|v_ULTIMATE.start_main_#t~post7_7|, ULTIMATE.start_main_#t~mem6=|v_ULTIMATE.start_main_#t~mem6_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_main_#t~post7, ULTIMATE.start_main_#t~mem6] 800#L19-3 [2020-07-01 12:57:47,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1484994526, now seen corresponding path program 2 times [2020-07-01 12:57:47,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,625 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448344949] [2020-07-01 12:57:47,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,649 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:47,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,649 INFO L82 PathProgramCache]: Analyzing trace with hash 4039335, now seen corresponding path program 4 times [2020-07-01 12:57:47,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542788996] [2020-07-01 12:57:47,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,656 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:47,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1914211768, now seen corresponding path program 1 times [2020-07-01 12:57:47,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 12:57:47,657 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841839219] [2020-07-01 12:57:47,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 12:57:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:47,682 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 12:57:47,961 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 83 [2020-07-01 12:57:48,027 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 12:57:48,027 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 12:57:48,027 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 12:57:48,027 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 12:57:48,027 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 12:57:48,028 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,028 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 12:57:48,028 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 12:57:48,028 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration10_Lasso [2020-07-01 12:57:48,028 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 12:57:48,028 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 12:57:48,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,034 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 12:57:48,341 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 12:57:48,341 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,347 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,347 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:48,348 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,348 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,348 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,348 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:48,348 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:48,350 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,382 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,384 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,384 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:48,384 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,384 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,384 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,385 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:48,385 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:48,386 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:48,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:48,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,457 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,459 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,459 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:48,459 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,459 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,459 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,460 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:48,460 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:48,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,494 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,495 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:48,496 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,496 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,496 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,497 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:48,497 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:48,498 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,531 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,532 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:48,532 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,532 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,532 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:48,533 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:48,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,568 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,569 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:48,569 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:48,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,604 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,606 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,606 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,606 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,607 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,608 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:48,608 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:48,611 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,645 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,647 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 12:57:48,647 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 12:57:48,651 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 12:57:48,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 12:57:48,685 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 12:57:48,685 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 12:57:48,685 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 12:57:48,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 12:57:48,686 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 12:57:48,686 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 12:57:48,688 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 12:57:48,691 INFO L443 ModelExtractionUtils]: Simplification made 2 calls to the SMT solver. [2020-07-01 12:57:48,691 INFO L444 ModelExtractionUtils]: 1 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. No working directory specified, using /export/starexec/sandbox/solver/bin/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 12:57:48,693 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 12:57:48,693 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2020-07-01 12:57:48,694 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 12:57:48,694 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~arr~0.base) (+ (* ULTIMATE.start_main_~j~0 4) ULTIMATE.start_main_~arr~0.offset))_2 Supporting invariants [] [2020-07-01 12:57:48,732 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-01 12:57:48,733 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 12:57:48,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 12:57:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:48,754 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-01 12:57:48,755 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 12:57:48,762 INFO L264 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-01 12:57:48,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 12:57:48,799 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 12:57:48,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 12:57:48,838 INFO L137 LoopCannibalizer]: termination argument not suffcient for all loop shiftings [2020-07-01 12:57:48,838 INFO L98 LoopCannibalizer]: 4 predicates before loop cannibalization 4 predicates after loop cannibalization [2020-07-01 12:57:48,838 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-07-01 12:57:48,838 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 10 Second operand 5 states. [2020-07-01 12:57:48,867 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 26 states and 32 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 37 states and 44 transitions. Complement of second has 8 states. [2020-07-01 12:57:48,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-01 12:57:48,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-01 12:57:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2020-07-01 12:57:48,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-01 12:57:48,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:48,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2020-07-01 12:57:48,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:48,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 15 letters. Loop has 8 letters. [2020-07-01 12:57:48,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 12:57:48,871 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 44 transitions. [2020-07-01 12:57:48,872 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:57:48,872 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2020-07-01 12:57:48,872 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 12:57:48,872 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 12:57:48,872 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 12:57:48,872 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 12:57:48,872 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:57:48,873 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:57:48,873 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 12:57:48,873 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2020-07-01 12:57:48,873 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 12:57:48,873 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 12:57:48,873 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 12:57:48,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 12:57:48 BasicIcfg [2020-07-01 12:57:48,879 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 12:57:48,880 INFO L168 Benchmark]: Toolchain (without parser) took 11154.69 ms. Allocated memory was 649.6 MB in the beginning and 843.1 MB in the end (delta: 193.5 MB). Free memory was 562.8 MB in the beginning and 602.4 MB in the end (delta: -39.6 MB). Peak memory consumption was 153.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,881 INFO L168 Benchmark]: CDTParser took 0.17 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 12:57:48,881 INFO L168 Benchmark]: CACSL2BoogieTranslator took 303.88 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 562.8 MB in the beginning and 647.2 MB in the end (delta: -84.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,881 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 685.2 MB. Free memory was 647.2 MB in the beginning and 645.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,882 INFO L168 Benchmark]: Boogie Preprocessor took 24.74 ms. Allocated memory is still 685.2 MB. Free memory was 645.9 MB in the beginning and 643.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,882 INFO L168 Benchmark]: RCFGBuilder took 306.65 ms. Allocated memory is still 685.2 MB. Free memory was 643.2 MB in the beginning and 621.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,882 INFO L168 Benchmark]: BlockEncodingV2 took 118.55 ms. Allocated memory is still 685.2 MB. Free memory was 621.1 MB in the beginning and 613.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,883 INFO L168 Benchmark]: TraceAbstraction took 4692.17 ms. Allocated memory was 685.2 MB in the beginning and 751.8 MB in the end (delta: 66.6 MB). Free memory was 611.6 MB in the beginning and 434.3 MB in the end (delta: 177.3 MB). Peak memory consumption was 243.9 MB. Max. memory is 50.3 GB. [2020-07-01 12:57:48,883 INFO L168 Benchmark]: BuchiAutomizer took 5663.93 ms. Allocated memory was 751.8 MB in the beginning and 843.1 MB in the end (delta: 91.2 MB). Free memory was 434.3 MB in the beginning and 602.4 MB in the end (delta: -168.1 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 12:57:48,886 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 30 locations, 38 edges - StatisticsResult: Encoded RCFG 20 locations, 36 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 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 303.88 ms. Allocated memory was 649.6 MB in the beginning and 685.2 MB in the end (delta: 35.7 MB). Free memory was 562.8 MB in the beginning and 647.2 MB in the end (delta: -84.4 MB). Peak memory consumption was 28.6 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 38.20 ms. Allocated memory is still 685.2 MB. Free memory was 647.2 MB in the beginning and 645.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.74 ms. Allocated memory is still 685.2 MB. Free memory was 645.9 MB in the beginning and 643.2 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 306.65 ms. Allocated memory is still 685.2 MB. Free memory was 643.2 MB in the beginning and 621.1 MB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 118.55 ms. Allocated memory is still 685.2 MB. Free memory was 621.1 MB in the beginning and 613.0 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4692.17 ms. Allocated memory was 685.2 MB in the beginning and 751.8 MB in the end (delta: 66.6 MB). Free memory was 611.6 MB in the beginning and 434.3 MB in the end (delta: 177.3 MB). Peak memory consumption was 243.9 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 5663.93 ms. Allocated memory was 751.8 MB in the beginning and 843.1 MB in the end (delta: 91.2 MB). Free memory was 434.3 MB in the beginning and 602.4 MB in the end (delta: -168.1 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 - 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 - 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 #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - 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 #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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: 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: 16]: 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: 20]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant [2020-07-01 12:57:48,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,894 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,895 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,896 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,897 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,898 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,899 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((1 <= arr && 1 <= i) && 1 == \valid[arr]) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) && arr + 4 <= unknown-#length-unknown[arr]) && 1 <= j) && i <= 1) || ((((((((1 <= arr && 1 <= i) && 0 == j) && 1 == \valid[arr]) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) && arr + 4 <= unknown-#length-unknown[arr]) && i <= 1)) || (((((((1 <= arr && 1 <= i) && arr + 8 <= unknown-#length-unknown[arr]) && 0 == j) && 1 == \valid[arr]) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr])) || (((((((1 <= arr && 1 <= i) && arr + 8 <= unknown-#length-unknown[arr]) && 1 == \valid[arr]) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) && 1 <= j) - InvariantResult [Line: 19]: Loop Invariant [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,901 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,902 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,903 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,904 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 <= arr && 1 <= i) && 1 == \valid[arr]) && 0 == arr) && j < unknown-#length-unknown[arr] / 4) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) && 1 <= j) || ((((((((1 <= arr && 1 <= i) && 0 == j) && 1 == \valid[arr]) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) && arr + 4 <= unknown-#length-unknown[arr]) && i <= 1)) || (((((((1 <= arr && 1 <= i) && arr + 8 <= unknown-#length-unknown[arr]) && 0 == j) && 1 == \valid[arr]) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) - InvariantResult [Line: 11]: Loop Invariant [2020-07-01 12:57:48,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 12:57:48,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 12:57:48,907 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((1 <= arr && 1 == \valid[arr]) && 0 <= i) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) && arr + 4 <= unknown-#length-unknown[arr]) && i <= 1) || ((((((1 <= arr && arr + 8 <= unknown-#length-unknown[arr]) && 1 == \valid[arr]) && 0 <= i) && 0 == arr) && 1 <= unknown-#StackHeapBarrier-unknown) && length * 4 == unknown-#length-unknown[arr]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 20 locations, 8 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.9s, OverallIterations: 12, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 80 SDtfs, 436 SDslu, 161 SDs, 0 SdLazy, 679 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 139 GetRequests, 69 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=10, 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, 12 MinimizatonAttempts, 15 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 21 NumberOfFragments, 324 HoareAnnotationTreeSize, 3 FomulaSimplifications, 517 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 459 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 201 NumberOfCodeBlocks, 189 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 183 ConstructedInterpolants, 0 QuantifiedInterpolants, 12183 SizeOfPredicates, 10 NumberOfNonLiveVariables, 276 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 18 InterpolantComputations, 7 PerfectInterpolantSequences, 25/59 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 - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 0 deterministic, 4 nondeterministic). One nondeterministic module has affine ranking function -1 * i + length and consists of 4 locations. One nondeterministic module has affine ranking function -4 * j + unknown-#length-unknown[arr] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][arr] and consists of 11 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[arr][j * 4 + arr] and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 9 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.6s and 11 iterations. TraceHistogramMax:2. Analysis of lassos took 4.5s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 26 states and ocurred in iteration 9. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 110 SDtfs, 243 SDslu, 119 SDs, 0 SdLazy, 372 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU6 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital131 mio100 ax100 hnf100 lsp93 ukn78 mio100 lsp55 div100 bol100 ite100 ukn100 eq170 hnf88 smp97 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 15ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 12:57:34.423 ----------------------------------------------- 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/sandbox/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/sandbox/tmp/BenchExec_run_fJAVfe/tmp -i /export/starexec/sandbox/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 12:57:49.735 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check