YES Ultimate: Cannot open display: This is Ultimate 0.1.24-8dc7c08-m [2020-06-22 09:28:07,775 INFO L170 SettingsManager]: Resetting all preferences to default values... [2020-06-22 09:28:07,777 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2020-06-22 09:28:07,788 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-06-22 09:28:07,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-06-22 09:28:07,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-06-22 09:28:07,791 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-06-22 09:28:07,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2020-06-22 09:28:07,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-06-22 09:28:07,794 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-06-22 09:28:07,795 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-06-22 09:28:07,795 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-06-22 09:28:07,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-06-22 09:28:07,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-06-22 09:28:07,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-06-22 09:28:07,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-06-22 09:28:07,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-06-22 09:28:07,801 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-06-22 09:28:07,804 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2020-06-22 09:28:07,805 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-06-22 09:28:07,806 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-06-22 09:28:07,807 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-06-22 09:28:07,809 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-06-22 09:28:07,810 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-06-22 09:28:07,810 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-06-22 09:28:07,810 INFO L174 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-06-22 09:28:07,811 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-06-22 09:28:07,812 INFO L177 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-06-22 09:28:07,812 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-06-22 09:28:07,812 INFO L174 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-06-22 09:28:07,813 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-06-22 09:28:07,814 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2020-06-22 09:28:07,815 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-06-22 09:28:07,815 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2020-06-22 09:28:07,815 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-06-22 09:28:07,816 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-06-22 09:28:07,816 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2020-06-22 09:28:07,817 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2020-06-22 09:28:07,817 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2020-06-22 09:28:07,818 INFO L98 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-06-22 09:28:07,832 INFO L110 SettingsManager]: Loading preferences was successful [2020-06-22 09:28:07,832 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2020-06-22 09:28:07,833 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-06-22 09:28:07,833 INFO L133 SettingsManager]: * Rewrite not-equals=true [2020-06-22 09:28:07,834 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2020-06-22 09:28:07,834 INFO L133 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:28:07,834 INFO L133 SettingsManager]: * Use SBE=true [2020-06-22 09:28:07,834 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-06-22 09:28:07,834 INFO L133 SettingsManager]: * Use old map elimination=false [2020-06-22 09:28:07,835 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2020-06-22 09:28:07,835 INFO L133 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-06-22 09:28:07,835 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2020-06-22 09:28:07,835 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-06-22 09:28:07,835 INFO L133 SettingsManager]: * Construct termination proof for TermComp=true [2020-06-22 09:28:07,835 INFO L133 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-06-22 09:28:07,836 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-06-22 09:28:07,836 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-06-22 09:28:07,836 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2020-06-22 09:28:07,836 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2020-06-22 09:28:07,836 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-06-22 09:28:07,837 INFO L133 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-06-22 09:28:07,837 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-06-22 09:28:07,837 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-06-22 09:28:07,837 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-06-22 09:28:07,837 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:28:07,837 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-06-22 09:28:07,838 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-06-22 09:28:07,838 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2020-06-22 09:28:07,838 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-06-22 09:28:07,863 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-06-22 09:28:07,877 INFO L259 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-06-22 09:28:07,880 INFO L215 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-06-22 09:28:07,882 INFO L271 PluginConnector]: Initializing CDTParser... [2020-06-22 09:28:07,882 INFO L276 PluginConnector]: CDTParser initialized [2020-06-22 09:28:07,883 INFO L430 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:28:07,948 INFO L221 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/944adba74c8a44b4bb53365621b71016/FLAG70696ee6e [2020-06-22 09:28:08,284 INFO L307 CDTParser]: Found 1 translation units. [2020-06-22 09:28:08,285 INFO L161 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-06-22 09:28:08,285 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-06-22 09:28:08,292 INFO L355 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/944adba74c8a44b4bb53365621b71016/FLAG70696ee6e [2020-06-22 09:28:08,677 INFO L363 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/944adba74c8a44b4bb53365621b71016 [2020-06-22 09:28:08,689 INFO L297 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-06-22 09:28:08,690 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-06-22 09:28:08,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-06-22 09:28:08,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-06-22 09:28:08,695 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2020-06-22 09:28:08,696 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:08,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2746144d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08, skipping insertion in model container [2020-06-22 09:28:08,700 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:08,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-06-22 09:28:08,726 INFO L176 MainTranslator]: Built tables and reachable declarations [2020-06-22 09:28:08,893 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:28:08,962 INFO L191 MainTranslator]: Completed pre-run [2020-06-22 09:28:08,981 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-06-22 09:28:08,997 INFO L195 MainTranslator]: Completed translation [2020-06-22 09:28:08,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08 WrapperNode [2020-06-22 09:28:08,997 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-06-22 09:28:08,998 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-06-22 09:28:08,998 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-06-22 09:28:08,999 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2020-06-22 09:28:09,008 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,017 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,038 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-06-22 09:28:09,039 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-06-22 09:28:09,039 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-06-22 09:28:09,039 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2020-06-22 09:28:09,048 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,050 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,050 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,055 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,060 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... [2020-06-22 09:28:09,063 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-06-22 09:28:09,063 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-06-22 09:28:09,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-06-22 09:28:09,064 INFO L276 PluginConnector]: RCFGBuilder initialized [2020-06-22 09:28:09,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-06-22 09:28:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-06-22 09:28:09,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-06-22 09:28:09,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-06-22 09:28:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-06-22 09:28:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-06-22 09:28:09,136 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-06-22 09:28:09,382 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-06-22 09:28:09,382 INFO L286 CfgBuilder]: Removed 8 assue(true) statements. [2020-06-22 09:28:09,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:09 BoogieIcfgContainer [2020-06-22 09:28:09,384 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-06-22 09:28:09,385 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-06-22 09:28:09,385 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-06-22 09:28:09,387 INFO L276 PluginConnector]: BlockEncodingV2 initialized [2020-06-22 09:28:09,388 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:09" (1/1) ... [2020-06-22 09:28:09,409 INFO L313 BlockEncoder]: Initial Icfg 32 locations, 37 edges [2020-06-22 09:28:09,411 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-06-22 09:28:09,411 INFO L263 BlockEncoder]: Using Maximize final states [2020-06-22 09:28:09,412 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-06-22 09:28:09,412 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-06-22 09:28:09,414 INFO L296 BlockEncoder]: Using Remove sink states [2020-06-22 09:28:09,415 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-06-22 09:28:09,415 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-06-22 09:28:09,439 INFO L185 BlockEncoder]: Using Use SBE [2020-06-22 09:28:09,464 INFO L200 BlockEncoder]: SBE split 13 edges [2020-06-22 09:28:09,469 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-06-22 09:28:09,471 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:28:09,503 INFO L100 BaseMinimizeStates]: Removed 16 edges and 8 locations by large block encoding [2020-06-22 09:28:09,506 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-06-22 09:28:09,507 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-06-22 09:28:09,508 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-06-22 09:28:09,508 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-06-22 09:28:09,508 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-06-22 09:28:09,509 INFO L313 BlockEncoder]: Encoded RCFG 23 locations, 39 edges [2020-06-22 09:28:09,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:28:09 BasicIcfg [2020-06-22 09:28:09,509 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-06-22 09:28:09,510 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-06-22 09:28:09,510 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-06-22 09:28:09,514 INFO L276 PluginConnector]: TraceAbstraction initialized [2020-06-22 09:28:09,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.06 09:28:08" (1/4) ... [2020-06-22 09:28:09,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783c8112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:28:09, skipping insertion in model container [2020-06-22 09:28:09,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (2/4) ... [2020-06-22 09:28:09,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783c8112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.06 09:28:09, skipping insertion in model container [2020-06-22 09:28:09,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:09" (3/4) ... [2020-06-22 09:28:09,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@783c8112 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:28:09, skipping insertion in model container [2020-06-22 09:28:09,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:28:09" (4/4) ... [2020-06-22 09:28:09,518 INFO L112 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:28:09,527 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-06-22 09:28:09,535 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2020-06-22 09:28:09,552 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2020-06-22 09:28:09,581 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:28:09,582 INFO L382 AbstractCegarLoop]: Interprodecural is true [2020-06-22 09:28:09,582 INFO L383 AbstractCegarLoop]: Hoare is true [2020-06-22 09:28:09,582 INFO L384 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:28:09,582 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:28:09,582 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:28:09,582 INFO L387 AbstractCegarLoop]: Difference is false [2020-06-22 09:28:09,583 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:28:09,583 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-06-22 09:28:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2020-06-22 09:28:09,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:28:09,603 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:09,604 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:09,604 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:09,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:09,610 INFO L82 PathProgramCache]: Analyzing trace with hash 163846899, now seen corresponding path program 1 times [2020-06-22 09:28:09,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:09,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:09,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:09,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:09,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:09,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:09,776 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:09,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:09,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:09,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:09,797 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2020-06-22 09:28:09,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:09,898 INFO L93 Difference]: Finished difference Result 23 states and 39 transitions. [2020-06-22 09:28:09,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:09,900 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:28:09,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:09,911 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:28:09,911 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:28:09,915 INFO L631 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-06-22 09:28:09,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:28:09,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:28:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:28:09,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 29 transitions. [2020-06-22 09:28:09,951 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 29 transitions. Word has length 5 [2020-06-22 09:28:09,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:09,951 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 29 transitions. [2020-06-22 09:28:09,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:09,952 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 29 transitions. [2020-06-22 09:28:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:28:09,952 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:09,952 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:09,953 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:09,953 INFO L82 PathProgramCache]: Analyzing trace with hash 163846901, now seen corresponding path program 1 times [2020-06-22 09:28:09,953 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:09,953 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:09,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:09,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:09,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:09,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:09,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:09,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:09,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:09,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:09,990 INFO L87 Difference]: Start difference. First operand 18 states and 29 transitions. Second operand 3 states. [2020-06-22 09:28:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,050 INFO L93 Difference]: Finished difference Result 19 states and 29 transitions. [2020-06-22 09:28:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:10,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-06-22 09:28:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,052 INFO L225 Difference]: With dead ends: 19 [2020-06-22 09:28:10,052 INFO L226 Difference]: Without dead ends: 18 [2020-06-22 09:28:10,053 INFO L631 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-06-22 09:28:10,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-06-22 09:28:10,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-06-22 09:28:10,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:28:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 09:28:10,057 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 5 [2020-06-22 09:28:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,057 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:28:10,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-06-22 09:28:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-06-22 09:28:10,058 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-06-22 09:28:10,058 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,058 INFO L82 PathProgramCache]: Analyzing trace with hash 163846902, now seen corresponding path program 1 times [2020-06-22 09:28:10,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,143 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:10,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:10,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:28:10,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:28:10,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:28:10,144 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 4 states. [2020-06-22 09:28:10,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,202 INFO L93 Difference]: Finished difference Result 18 states and 28 transitions. [2020-06-22 09:28:10,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:28:10,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-06-22 09:28:10,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,203 INFO L225 Difference]: With dead ends: 18 [2020-06-22 09:28:10,203 INFO L226 Difference]: Without dead ends: 17 [2020-06-22 09:28:10,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:28:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2020-06-22 09:28:10,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2020-06-22 09:28:10,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-06-22 09:28:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 27 transitions. [2020-06-22 09:28:10,208 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 27 transitions. Word has length 5 [2020-06-22 09:28:10,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,208 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 27 transitions. [2020-06-22 09:28:10,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:28:10,208 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 27 transitions. [2020-06-22 09:28:10,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:28:10,209 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:10,209 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,210 INFO L82 PathProgramCache]: Analyzing trace with hash 2081015822, now seen corresponding path program 1 times [2020-06-22 09:28:10,210 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:10,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:28:10,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:28:10,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:28:10,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:28:10,242 INFO L87 Difference]: Start difference. First operand 17 states and 27 transitions. Second operand 4 states. [2020-06-22 09:28:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,333 INFO L93 Difference]: Finished difference Result 45 states and 71 transitions. [2020-06-22 09:28:10,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:28:10,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 09:28:10,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,334 INFO L225 Difference]: With dead ends: 45 [2020-06-22 09:28:10,334 INFO L226 Difference]: Without dead ends: 31 [2020-06-22 09:28:10,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:28:10,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-06-22 09:28:10,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 18. [2020-06-22 09:28:10,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-06-22 09:28:10,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 28 transitions. [2020-06-22 09:28:10,340 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 28 transitions. Word has length 8 [2020-06-22 09:28:10,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,340 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 28 transitions. [2020-06-22 09:28:10,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:28:10,341 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 28 transitions. [2020-06-22 09:28:10,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:28:10,341 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,341 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:10,342 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,342 INFO L82 PathProgramCache]: Analyzing trace with hash 2081016783, now seen corresponding path program 1 times [2020-06-22 09:28:10,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:10,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:10,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-06-22 09:28:10,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:28:10,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:28:10,381 INFO L87 Difference]: Start difference. First operand 18 states and 28 transitions. Second operand 4 states. [2020-06-22 09:28:10,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,442 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2020-06-22 09:28:10,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:28:10,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2020-06-22 09:28:10,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,443 INFO L225 Difference]: With dead ends: 32 [2020-06-22 09:28:10,443 INFO L226 Difference]: Without dead ends: 28 [2020-06-22 09:28:10,444 INFO L631 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-06-22 09:28:10,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-06-22 09:28:10,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2020-06-22 09:28:10,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:28:10,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 37 transitions. [2020-06-22 09:28:10,450 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 37 transitions. Word has length 8 [2020-06-22 09:28:10,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,450 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 37 transitions. [2020-06-22 09:28:10,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-06-22 09:28:10,450 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 37 transitions. [2020-06-22 09:28:10,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-06-22 09:28:10,451 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:10,451 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2081016784, now seen corresponding path program 1 times [2020-06-22 09:28:10,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:10,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:28:10,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-06-22 09:28:10,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:28:10,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:28:10,519 INFO L87 Difference]: Start difference. First operand 23 states and 37 transitions. Second operand 5 states. [2020-06-22 09:28:10,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,656 INFO L93 Difference]: Finished difference Result 28 states and 39 transitions. [2020-06-22 09:28:10,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-06-22 09:28:10,657 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2020-06-22 09:28:10,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,658 INFO L225 Difference]: With dead ends: 28 [2020-06-22 09:28:10,658 INFO L226 Difference]: Without dead ends: 24 [2020-06-22 09:28:10,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:28:10,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-06-22 09:28:10,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2020-06-22 09:28:10,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-06-22 09:28:10,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2020-06-22 09:28:10,663 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 8 [2020-06-22 09:28:10,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,663 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2020-06-22 09:28:10,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-06-22 09:28:10,663 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2020-06-22 09:28:10,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-06-22 09:28:10,664 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,664 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:10,664 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,664 INFO L82 PathProgramCache]: Analyzing trace with hash 924842442, now seen corresponding path program 1 times [2020-06-22 09:28:10,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,697 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:10,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:10,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:10,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:10,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:10,698 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand 3 states. [2020-06-22 09:28:10,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,732 INFO L93 Difference]: Finished difference Result 42 states and 57 transitions. [2020-06-22 09:28:10,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:10,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-06-22 09:28:10,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,735 INFO L225 Difference]: With dead ends: 42 [2020-06-22 09:28:10,735 INFO L226 Difference]: Without dead ends: 23 [2020-06-22 09:28:10,736 INFO L631 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-06-22 09:28:10,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-06-22 09:28:10,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-06-22 09:28:10,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-06-22 09:28:10,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2020-06-22 09:28:10,741 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 13 [2020-06-22 09:28:10,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,741 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2020-06-22 09:28:10,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:10,741 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2020-06-22 09:28:10,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-06-22 09:28:10,742 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,742 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:10,742 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1470140232, now seen corresponding path program 1 times [2020-06-22 09:28:10,743 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,743 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,770 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-06-22 09:28:10,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:10,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:10,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-06-22 09:28:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:10,772 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand 3 states. [2020-06-22 09:28:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:10,801 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2020-06-22 09:28:10,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:10,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-06-22 09:28:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:10,802 INFO L225 Difference]: With dead ends: 39 [2020-06-22 09:28:10,802 INFO L226 Difference]: Without dead ends: 19 [2020-06-22 09:28:10,803 INFO L631 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-06-22 09:28:10,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-06-22 09:28:10,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-06-22 09:28:10,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-06-22 09:28:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2020-06-22 09:28:10,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 15 [2020-06-22 09:28:10,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:10,807 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2020-06-22 09:28:10,807 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-06-22 09:28:10,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2020-06-22 09:28:10,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-06-22 09:28:10,807 INFO L394 BasicCegarLoop]: Found error trace [2020-06-22 09:28:10,808 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:10,808 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION]=== [2020-06-22 09:28:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:10,808 INFO L82 PathProgramCache]: Analyzing trace with hash -1670293991, now seen corresponding path program 1 times [2020-06-22 09:28:10,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:10,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:10,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:10,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2020-06-22 09:28:10,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2020-06-22 09:28:10,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:10,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 7 conjunts are in the unsatisfiable core [2020-06-22 09:28:10,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:10,949 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:10,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-06-22 09:28:10,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-06-22 09:28:10,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-06-22 09:28:10,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-06-22 09:28:10,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:28:10,981 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 8 states. [2020-06-22 09:28:11,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:11,033 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2020-06-22 09:28:11,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-06-22 09:28:11,034 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2020-06-22 09:28:11,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-06-22 09:28:11,034 INFO L225 Difference]: With dead ends: 23 [2020-06-22 09:28:11,034 INFO L226 Difference]: Without dead ends: 0 [2020-06-22 09:28:11,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-06-22 09:28:11,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-06-22 09:28:11,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-06-22 09:28:11,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-06-22 09:28:11,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-06-22 09:28:11,035 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 16 [2020-06-22 09:28:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-06-22 09:28:11,036 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:28:11,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-06-22 09:28:11,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:28:11,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-06-22 09:28:11,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-06-22 09:28:11,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2020-06-22 09:28:11,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:28:11,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-06-22 09:28:11,109 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point L11-2(line 11) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point L11-5(lines 11 12) no Hoare annotation was computed. [2020-06-22 09:28:11,110 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:28:11,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:28:11,111 INFO L444 ceAbstractionStarter]: At program point L11-8(lines 11 12) the Hoare annotation is: (let ((.cse0 (select |#length| ULTIMATE.start_insertionSort_~a.base))) (and (= 0 ULTIMATE.start_insertionSort_~a.offset) (<= (* 4 ULTIMATE.start_insertionSort_~array_size) .cse0) (<= 0 ULTIMATE.start_insertionSort_~j~0) (<= (+ (* 4 ULTIMATE.start_insertionSort_~i~0) 4) .cse0) (= 1 (select |#valid| ULTIMATE.start_insertionSort_~a.base)) (<= (+ (* 4 ULTIMATE.start_insertionSort_~j~0) 4) .cse0) (<= 1 ULTIMATE.start_insertionSort_~i~0))) [2020-06-22 09:28:11,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:28:11,111 INFO L448 ceAbstractionStarter]: For program point L11-9(lines 11 12) no Hoare annotation was computed. [2020-06-22 09:28:11,111 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 22) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L448 ceAbstractionStarter]: For program point L20-2(lines 20 22) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L448 ceAbstractionStarter]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L448 ceAbstractionStarter]: For program point L10(line 10) no Hoare annotation was computed. [2020-06-22 09:28:11,112 INFO L444 ceAbstractionStarter]: At program point L8-2(lines 8 15) the Hoare annotation is: (and (= 0 ULTIMATE.start_insertionSort_~a.offset) (<= (* 4 ULTIMATE.start_insertionSort_~array_size) (select |#length| ULTIMATE.start_insertionSort_~a.base)) (= 1 (select |#valid| ULTIMATE.start_insertionSort_~a.base)) (<= 1 ULTIMATE.start_insertionSort_~i~0)) [2020-06-22 09:28:11,113 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-06-22 09:28:11,121 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,128 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,130 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,131 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,132 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:11,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:28:11 BasicIcfg [2020-06-22 09:28:11,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-06-22 09:28:11,135 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-06-22 09:28:11,135 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-06-22 09:28:11,138 INFO L276 PluginConnector]: BuchiAutomizer initialized [2020-06-22 09:28:11,139 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:11,139 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.06 09:28:08" (1/5) ... [2020-06-22 09:28:11,140 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ab15093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:28:11, skipping insertion in model container [2020-06-22 09:28:11,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:11,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.06 09:28:08" (2/5) ... [2020-06-22 09:28:11,140 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ab15093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.06 09:28:11, skipping insertion in model container [2020-06-22 09:28:11,140 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:11,140 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.06 09:28:09" (3/5) ... [2020-06-22 09:28:11,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ab15093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:28:11, skipping insertion in model container [2020-06-22 09:28:11,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:11,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 22.06 09:28:09" (4/5) ... [2020-06-22 09:28:11,141 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ab15093 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:28:11, skipping insertion in model container [2020-06-22 09:28:11,141 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-06-22 09:28:11,141 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.06 09:28:11" (5/5) ... [2020-06-22 09:28:11,143 INFO L375 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-06-22 09:28:11,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2020-06-22 09:28:11,165 INFO L374 BuchiCegarLoop]: Interprodecural is true [2020-06-22 09:28:11,165 INFO L375 BuchiCegarLoop]: Hoare is true [2020-06-22 09:28:11,165 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-06-22 09:28:11,165 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-06-22 09:28:11,165 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-06-22 09:28:11,165 INFO L379 BuchiCegarLoop]: Difference is false [2020-06-22 09:28:11,166 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-06-22 09:28:11,166 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-06-22 09:28:11,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-06-22 09:28:11,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 09:28:11,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:11,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:11,179 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:28:11,179 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:28:11,179 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2020-06-22 09:28:11,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states. [2020-06-22 09:28:11,180 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2020-06-22 09:28:11,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:11,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:11,181 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:28:11,181 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:28:11,186 INFO L794 eck$LassoCheckResult]: Stem: 16#ULTIMATE.startENTRYtrue [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 11#L20true [73] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 7#L20-2true [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 4#L8-2true [2020-06-22 09:28:11,187 INFO L796 eck$LassoCheckResult]: Loop: 4#L8-2true [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 13#L10true [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 24#L11-8true [123] L11-8-->L11-1: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_2|) (>= 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 14#L11-1true [100] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_5|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} AuxVars[] AssignedVars[] 5#L11-5true [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 22#L11-9true [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 4#L8-2true [2020-06-22 09:28:11,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,188 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 1 times [2020-06-22 09:28:11,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,217 INFO L82 PathProgramCache]: Analyzing trace with hash -492762836, now seen corresponding path program 1 times [2020-06-22 09:28:11,217 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,217 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1972591654, now seen corresponding path program 1 times [2020-06-22 09:28:11,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:11,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:11,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:11,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:28:11,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:28:11,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:28:11,357 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 4 states. [2020-06-22 09:28:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:11,456 INFO L93 Difference]: Finished difference Result 43 states and 72 transitions. [2020-06-22 09:28:11,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:28:11,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 72 transitions. [2020-06-22 09:28:11,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2020-06-22 09:28:11,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 23 states and 32 transitions. [2020-06-22 09:28:11,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2020-06-22 09:28:11,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-06-22 09:28:11,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 32 transitions. [2020-06-22 09:28:11,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:11,465 INFO L706 BuchiCegarLoop]: Abstraction has 23 states and 32 transitions. [2020-06-22 09:28:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 32 transitions. [2020-06-22 09:28:11,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 14. [2020-06-22 09:28:11,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-06-22 09:28:11,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-06-22 09:28:11,467 INFO L729 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-06-22 09:28:11,467 INFO L609 BuchiCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-06-22 09:28:11,467 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2020-06-22 09:28:11,467 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 20 transitions. [2020-06-22 09:28:11,468 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-06-22 09:28:11,468 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:11,468 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:11,469 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:28:11,469 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:28:11,469 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 88#L20 [73] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 85#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 83#L8-2 [2020-06-22 09:28:11,470 INFO L796 eck$LassoCheckResult]: Loop: 83#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 84#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 90#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 89#L11-1 [100] L11-1-->L11-5: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_5|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_5|} AuxVars[] AssignedVars[] 80#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 81#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 83#L8-2 [2020-06-22 09:28:11,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,470 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 2 times [2020-06-22 09:28:11,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,482 INFO L82 PathProgramCache]: Analyzing trace with hash -492733045, now seen corresponding path program 1 times [2020-06-22 09:28:11,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,483 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:11,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:11,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:11,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:11,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-06-22 09:28:11,498 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:28:11,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:11,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:11,499 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 09:28:11,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:11,526 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-06-22 09:28:11,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:11,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. [2020-06-22 09:28:11,528 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 09:28:11,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-06-22 09:28:11,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 09:28:11,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 09:28:11,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-06-22 09:28:11,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:11,529 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 09:28:11,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-06-22 09:28:11,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 09:28:11,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:28:11,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-06-22 09:28:11,530 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 09:28:11,531 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-06-22 09:28:11,531 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2020-06-22 09:28:11,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-06-22 09:28:11,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 09:28:11,531 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:11,531 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:11,532 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:28:11,532 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:11,532 INFO L794 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 124#L20 [73] L20-->L20-2: Formula: (and (= v_ULTIMATE.start_main_~array_size~0_4 1) (< v_ULTIMATE.start_main_~array_size~0_5 1)) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_5} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_~array_size~0] 120#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 116#L8-2 [2020-06-22 09:28:11,533 INFO L796 eck$LassoCheckResult]: Loop: 116#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 117#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 125#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 126#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 123#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 121#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 122#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 130#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 116#L8-2 [2020-06-22 09:28:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,533 INFO L82 PathProgramCache]: Analyzing trace with hash 169595, now seen corresponding path program 3 times [2020-06-22 09:28:11,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,534 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,534 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1070869302, now seen corresponding path program 1 times [2020-06-22 09:28:11,544 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:11,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1607815492, now seen corresponding path program 1 times [2020-06-22 09:28:11,559 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:11,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:11,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:28:11,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-06-22 09:28:11,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-06-22 09:28:11,682 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-06-22 09:28:11,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:11,713 INFO L93 Difference]: Finished difference Result 18 states and 24 transitions. [2020-06-22 09:28:11,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-06-22 09:28:11,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 24 transitions. [2020-06-22 09:28:11,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 09:28:11,715 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 16 states and 21 transitions. [2020-06-22 09:28:11,715 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-06-22 09:28:11,715 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-06-22 09:28:11,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 21 transitions. [2020-06-22 09:28:11,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:11,715 INFO L706 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 09:28:11,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 21 transitions. [2020-06-22 09:28:11,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-06-22 09:28:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-06-22 09:28:11,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 21 transitions. [2020-06-22 09:28:11,717 INFO L729 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 09:28:11,717 INFO L609 BuchiCegarLoop]: Abstraction has 16 states and 21 transitions. [2020-06-22 09:28:11,717 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2020-06-22 09:28:11,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 21 transitions. [2020-06-22 09:28:11,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2020-06-22 09:28:11,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:11,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:11,719 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:28:11,719 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:11,719 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 169#L20 [102] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 165#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 161#L8-2 [2020-06-22 09:28:11,720 INFO L796 eck$LassoCheckResult]: Loop: 161#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 162#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 171#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 170#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 168#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 166#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 167#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 175#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 161#L8-2 [2020-06-22 09:28:11,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,720 INFO L82 PathProgramCache]: Analyzing trace with hash 170494, now seen corresponding path program 1 times [2020-06-22 09:28:11,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1070869302, now seen corresponding path program 2 times [2020-06-22 09:28:11,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:11,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:11,744 INFO L82 PathProgramCache]: Analyzing trace with hash 203891143, now seen corresponding path program 1 times [2020-06-22 09:28:11,744 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:11,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,745 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:11,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:11,963 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:28:11,964 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:28:11,964 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:28:11,964 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:28:11,965 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:28:11,965 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:28:11,965 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:28:11,965 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:28:11,965 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration4_Lasso [2020-06-22 09:28:11,965 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:28:11,966 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:28:11,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,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-06-22 09:28:12,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:12,382 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:28:12,387 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:28:12,389 INFO L122 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-06-22 09:28:12,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:12,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:12,392 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:12,402 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:12,402 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:12,448 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:28:12,483 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-06-22 09:28:12,484 INFO L444 ModelExtractionUtils]: 29 out of 37 variables were initially zero. Simplification set additionally 4 variables to zero. [2020-06-22 09:28:12,486 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:28:12,492 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:28:12,494 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:28:12,494 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_insertionSort_~i~0) = 1*v_rep(select #length ULTIMATE.start_insertionSort_~a.base)_1 - 1*ULTIMATE.start_insertionSort_~a.offset - 4*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2020-06-22 09:28:12,521 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 09:28:12,524 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:12,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:28:12,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:12,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:12,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:12,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:12,611 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:12,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:12,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:12,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:12,709 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:28:12,713 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 3 loop predicates [2020-06-22 09:28:12,714 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-06-22 09:28:12,786 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 16 states and 21 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 42 states and 56 transitions. Complement of second has 6 states. [2020-06-22 09:28:12,787 INFO L142 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-06-22 09:28:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-06-22 09:28:12,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2020-06-22 09:28:12,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 09:28:12,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. [2020-06-22 09:28:12,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:12,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 33 transitions. Stem has 3 letters. Loop has 16 letters. [2020-06-22 09:28:12,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:12,798 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 56 transitions. [2020-06-22 09:28:12,799 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 22 [2020-06-22 09:28:12,799 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 41 states and 55 transitions. [2020-06-22 09:28:12,799 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2020-06-22 09:28:12,800 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2020-06-22 09:28:12,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 41 states and 55 transitions. [2020-06-22 09:28:12,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:28:12,800 INFO L706 BuchiCegarLoop]: Abstraction has 41 states and 55 transitions. [2020-06-22 09:28:12,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states and 55 transitions. [2020-06-22 09:28:12,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2020-06-22 09:28:12,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-06-22 09:28:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 54 transitions. [2020-06-22 09:28:12,803 INFO L729 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2020-06-22 09:28:12,803 INFO L609 BuchiCegarLoop]: Abstraction has 40 states and 54 transitions. [2020-06-22 09:28:12,803 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2020-06-22 09:28:12,803 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 54 transitions. [2020-06-22 09:28:12,804 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 21 [2020-06-22 09:28:12,804 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:12,804 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:12,804 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2020-06-22 09:28:12,804 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:12,805 INFO L794 eck$LassoCheckResult]: Stem: 356#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 351#L20 [102] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 344#L20-2 [117] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (> |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 345#L8-2 [2020-06-22 09:28:12,805 INFO L796 eck$LassoCheckResult]: Loop: 345#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 374#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 373#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 371#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 367#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 368#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 364#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 361#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 345#L8-2 [2020-06-22 09:28:12,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:12,806 INFO L82 PathProgramCache]: Analyzing trace with hash 170493, now seen corresponding path program 1 times [2020-06-22 09:28:12,806 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:12,806 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:12,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:12,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:12,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:12,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:12,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:12,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1070869302, now seen corresponding path program 3 times [2020-06-22 09:28:12,816 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:12,816 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:12,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:12,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:12,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:12,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:12,827 INFO L82 PathProgramCache]: Analyzing trace with hash 2011345606, now seen corresponding path program 1 times [2020-06-22 09:28:12,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:12,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:12,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:12,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:12,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,042 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:28:13,043 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:28:13,043 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:28:13,043 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:28:13,043 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:28:13,043 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:28:13,043 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:28:13,043 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:28:13,043 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration5_Lasso [2020-06-22 09:28:13,043 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:28:13,044 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:28:13,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,049 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,051 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,239 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,241 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:13,474 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:28:13,475 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:28:13,475 INFO L122 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-06-22 09:28:13,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:13,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:13,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:13,477 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:13,478 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:13,478 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:13,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:13,480 INFO L122 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-06-22 09:28:13,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:13,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:13,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:13,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:13,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:13,482 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:13,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:13,484 INFO L122 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-06-22 09:28:13,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:13,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:13,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:13,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:13,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:13,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:13,507 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:28:13,520 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-06-22 09:28:13,520 INFO L444 ModelExtractionUtils]: 33 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:28:13,520 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:28:13,521 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:28:13,522 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:28:13,522 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_~i~0) = 1*ULTIMATE.start_insertionSort_~array_size - 1*ULTIMATE.start_insertionSort_~i~0 Supporting invariants [] [2020-06-22 09:28:13,531 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-06-22 09:28:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:13,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:28:13,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:13,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:13,567 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:13,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:13,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:13,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:13,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:13,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:13,647 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:28:13,647 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 3 loop predicates [2020-06-22 09:28:13,647 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 40 states and 54 transitions. cyclomatic complexity: 17 Second operand 3 states. [2020-06-22 09:28:13,688 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 40 states and 54 transitions. cyclomatic complexity: 17. Second operand 3 states. Result 53 states and 72 transitions. Complement of second has 4 states. [2020-06-22 09:28:13,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-06-22 09:28:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:28:13,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 33 transitions. [2020-06-22 09:28:13,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 8 letters. [2020-06-22 09:28:13,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:13,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 11 letters. Loop has 8 letters. [2020-06-22 09:28:13,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:13,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 33 transitions. Stem has 3 letters. Loop has 16 letters. [2020-06-22 09:28:13,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:13,694 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 72 transitions. [2020-06-22 09:28:13,696 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 17 [2020-06-22 09:28:13,696 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 52 states and 71 transitions. [2020-06-22 09:28:13,696 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2020-06-22 09:28:13,697 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-06-22 09:28:13,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 71 transitions. [2020-06-22 09:28:13,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:28:13,697 INFO L706 BuchiCegarLoop]: Abstraction has 52 states and 71 transitions. [2020-06-22 09:28:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 71 transitions. [2020-06-22 09:28:13,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 27. [2020-06-22 09:28:13,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-06-22 09:28:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2020-06-22 09:28:13,700 INFO L729 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-06-22 09:28:13,700 INFO L609 BuchiCegarLoop]: Abstraction has 27 states and 37 transitions. [2020-06-22 09:28:13,700 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2020-06-22 09:28:13,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 37 transitions. [2020-06-22 09:28:13,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-06-22 09:28:13,701 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:13,701 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:13,701 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-06-22 09:28:13,702 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:13,702 INFO L794 eck$LassoCheckResult]: Stem: 541#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 536#L20 [102] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 530#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 522#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 524#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 539#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 537#L11-1 [2020-06-22 09:28:13,703 INFO L796 eck$LassoCheckResult]: Loop: 537#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 534#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 531#L11-3 [133] L11-3-->L11-5: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_4| (< v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 526#L11-5 [67] L11-5-->L12: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_9| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_9|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_8|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 527#L12 [83] L12-->L12-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7))) (and (= |v_ULTIMATE.start_insertionSort_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_insertionSort_~a.base_9) (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7 (- 4)))) (<= .cse1 (select |v_#length_7| v_ULTIMATE.start_insertionSort_~a.base_9)) (<= 4 .cse1) (= 1 (select |v_#valid_9| v_ULTIMATE.start_insertionSort_~a.base_9))))) InVars {#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem5] 542#L12-1 [150] L12-1-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_19))) (let ((.cse1 (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_insertionSort_~a.base_21)) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0 4) (select |v_#length_16| v_ULTIMATE.start_insertionSort_~a.base_21)) (= (store |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21 (store (select |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21) .cse1 |v_ULTIMATE.start_insertionSort_#t~mem5_8|)) |v_#memory_int_13|) (= v_ULTIMATE.start_insertionSort_~j~0_19 (+ v_ULTIMATE.start_insertionSort_~j~0_18 1)) (<= 0 .cse1)))) InVars {#valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_19, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_8|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_4|, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_18, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_insertionSort_#t~post2, ULTIMATE.start_insertionSort_~j~0, ULTIMATE.start_insertionSort_#t~mem5] 543#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 537#L11-1 [2020-06-22 09:28:13,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 784317294, now seen corresponding path program 1 times [2020-06-22 09:28:13,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:13,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1540310935, now seen corresponding path program 1 times [2020-06-22 09:28:13,717 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:13,717 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:13,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:13,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:13,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1630058614, now seen corresponding path program 1 times [2020-06-22 09:28:13,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:13,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:13,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:13,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:13,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:13,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-06-22 09:28:13,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-06-22 09:28:13,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-06-22 09:28:13,862 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-06-22 09:28:13,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:13,951 INFO L93 Difference]: Finished difference Result 81 states and 104 transitions. [2020-06-22 09:28:13,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-06-22 09:28:13,954 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 81 states and 104 transitions. [2020-06-22 09:28:13,955 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 21 [2020-06-22 09:28:13,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 81 states to 81 states and 104 transitions. [2020-06-22 09:28:13,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2020-06-22 09:28:13,957 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2020-06-22 09:28:13,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 81 states and 104 transitions. [2020-06-22 09:28:13,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:28:13,957 INFO L706 BuchiCegarLoop]: Abstraction has 81 states and 104 transitions. [2020-06-22 09:28:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states and 104 transitions. [2020-06-22 09:28:13,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 46. [2020-06-22 09:28:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-06-22 09:28:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2020-06-22 09:28:13,961 INFO L729 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2020-06-22 09:28:13,961 INFO L609 BuchiCegarLoop]: Abstraction has 46 states and 59 transitions. [2020-06-22 09:28:13,961 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2020-06-22 09:28:13,961 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 59 transitions. [2020-06-22 09:28:13,962 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-06-22 09:28:13,962 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:13,962 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:13,962 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:13,962 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:13,963 INFO L794 eck$LassoCheckResult]: Stem: 665#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 660#L20 [102] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 654#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 644#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 646#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 661#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 663#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 658#L11-2 [2020-06-22 09:28:13,963 INFO L796 eck$LassoCheckResult]: Loop: 658#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 655#L11-3 [133] L11-3-->L11-5: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_4| (< v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 650#L11-5 [67] L11-5-->L12: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_9| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_9|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_8|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 651#L12 [83] L12-->L12-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7))) (and (= |v_ULTIMATE.start_insertionSort_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_insertionSort_~a.base_9) (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7 (- 4)))) (<= .cse1 (select |v_#length_7| v_ULTIMATE.start_insertionSort_~a.base_9)) (<= 4 .cse1) (= 1 (select |v_#valid_9| v_ULTIMATE.start_insertionSort_~a.base_9))))) InVars {#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem5] 666#L12-1 [150] L12-1-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_19))) (let ((.cse1 (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_insertionSort_~a.base_21)) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0 4) (select |v_#length_16| v_ULTIMATE.start_insertionSort_~a.base_21)) (= (store |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21 (store (select |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21) .cse1 |v_ULTIMATE.start_insertionSort_#t~mem5_8|)) |v_#memory_int_13|) (= v_ULTIMATE.start_insertionSort_~j~0_19 (+ v_ULTIMATE.start_insertionSort_~j~0_18 1)) (<= 0 .cse1)))) InVars {#valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_19, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_8|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_4|, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_18, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_insertionSort_#t~post2, ULTIMATE.start_insertionSort_~j~0, ULTIMATE.start_insertionSort_#t~mem5] 667#L11-8 [123] L11-8-->L11-1: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_2|) (>= 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 683#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 658#L11-2 [2020-06-22 09:28:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash -1455967563, now seen corresponding path program 1 times [2020-06-22 09:28:13,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:13,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:13,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:13,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:13,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:13,974 INFO L82 PathProgramCache]: Analyzing trace with hash -979235026, now seen corresponding path program 1 times [2020-06-22 09:28:13,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:13,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:13,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:13,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:13,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:13,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:13,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-06-22 09:28:13,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-06-22 09:28:13,985 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-06-22 09:28:13,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-06-22 09:28:13,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-06-22 09:28:13,985 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. cyclomatic complexity: 16 Second operand 3 states. [2020-06-22 09:28:14,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-06-22 09:28:14,005 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-06-22 09:28:14,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-06-22 09:28:14,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 55 transitions. [2020-06-22 09:28:14,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:28:14,009 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 36 states and 41 transitions. [2020-06-22 09:28:14,009 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-06-22 09:28:14,009 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-06-22 09:28:14,009 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 41 transitions. [2020-06-22 09:28:14,009 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-06-22 09:28:14,010 INFO L706 BuchiCegarLoop]: Abstraction has 36 states and 41 transitions. [2020-06-22 09:28:14,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 41 transitions. [2020-06-22 09:28:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2020-06-22 09:28:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-06-22 09:28:14,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2020-06-22 09:28:14,014 INFO L729 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-06-22 09:28:14,014 INFO L609 BuchiCegarLoop]: Abstraction has 34 states and 39 transitions. [2020-06-22 09:28:14,014 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2020-06-22 09:28:14,014 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 39 transitions. [2020-06-22 09:28:14,014 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-06-22 09:28:14,014 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-06-22 09:28:14,014 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-06-22 09:28:14,015 INFO L867 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:14,015 INFO L868 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2020-06-22 09:28:14,016 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY [143] ULTIMATE.startENTRY-->L20: Formula: (and (= (store |v_#valid_18| 0 0) |v_#valid_17|) (= |v_#NULL.offset_2| 0) (= 0 |v_#NULL.base_2|)) InVars {#valid=|v_#valid_18|} OutVars{ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_5|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_3, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_8, #valid=|v_#valid_17|, #NULL.offset=|v_#NULL.offset_2|, ULTIMATE.start_main_#t~nondet6=|v_ULTIMATE.start_main_#t~nondet6_6|, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_3, #NULL.base=|v_#NULL.base_2|, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_main_~a~0.offset, ULTIMATE.start_main_#res, ULTIMATE.start_main_~array_size~0, #valid, #NULL.offset, ULTIMATE.start_main_#t~nondet6, ULTIMATE.start_main_~a~0.base, #NULL.base, ULTIMATE.start_main_#t~malloc7.offset] 759#L20 [102] L20-->L20-2: Formula: (>= v_ULTIMATE.start_main_~array_size~0_6 1) InVars {ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} OutVars{ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_6} AuxVars[] AssignedVars[] 753#L20-2 [118] L20-2-->L8-2: Formula: (and (= |v_#valid_3| (store |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2| 1)) (= (store |v_#length_2| |v_ULTIMATE.start_main_#t~malloc7.base_2| (* 4 v_ULTIMATE.start_main_~array_size~0_7)) |v_#length_1|) (= v_ULTIMATE.start_main_~a~0.base_2 |v_ULTIMATE.start_main_#t~malloc7.base_2|) (= v_ULTIMATE.start_insertionSort_~a.base_1 |v_ULTIMATE.start_insertionSort_#in~a.base_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.offset_1| v_ULTIMATE.start_main_~a~0.offset_2) (= v_ULTIMATE.start_insertionSort_~array_size_1 |v_ULTIMATE.start_insertionSort_#in~array_size_1|) (= v_ULTIMATE.start_insertionSort_~a.offset_1 |v_ULTIMATE.start_insertionSort_#in~a.offset_1|) (= |v_ULTIMATE.start_insertionSort_#in~array_size_1| v_ULTIMATE.start_main_~array_size~0_7) (= v_ULTIMATE.start_insertionSort_~i~0_1 1) (= v_ULTIMATE.start_main_~a~0.offset_2 |v_ULTIMATE.start_main_#t~malloc7.offset_2|) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| |v_#StackHeapBarrier_1|) (= |v_ULTIMATE.start_insertionSort_#in~a.base_1| v_ULTIMATE.start_main_~a~0.base_2) (< |v_ULTIMATE.start_main_#t~malloc7.base_2| 0) (= |v_ULTIMATE.start_main_#t~malloc7.offset_2| 0) (= (select |v_#valid_4| |v_ULTIMATE.start_main_#t~malloc7.base_2|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_2|, #valid=|v_#valid_4|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_1, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_1|, ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_1, ULTIMATE.start_main_#t~malloc7.base=|v_ULTIMATE.start_main_#t~malloc7.base_2|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_1, ULTIMATE.start_main_~a~0.base=v_ULTIMATE.start_main_~a~0.base_2, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_1, ULTIMATE.start_main_#t~malloc7.offset=|v_ULTIMATE.start_main_#t~malloc7.offset_2|, ULTIMATE.start_insertionSort_#in~array_size=|v_ULTIMATE.start_insertionSort_#in~array_size_1|, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_1|, ULTIMATE.start_insertionSort_#in~a.base=|v_ULTIMATE.start_insertionSort_#in~a.base_1|, ULTIMATE.start_main_~a~0.offset=v_ULTIMATE.start_main_~a~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start_main_~array_size~0=v_ULTIMATE.start_main_~array_size~0_7, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_1|, #length=|v_#length_1|, ULTIMATE.start_insertionSort_#in~a.offset=|v_ULTIMATE.start_insertionSort_#in~a.offset_1|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_1, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_1|, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_1|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_1} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~array_size, ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_main_#t~malloc7.base, ULTIMATE.start_insertionSort_~a.offset, ULTIMATE.start_main_~a~0.base, ULTIMATE.start_insertionSort_~i~0, ULTIMATE.start_main_#t~malloc7.offset, ULTIMATE.start_insertionSort_#in~array_size, ULTIMATE.start_insertionSort_#t~pre0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_#in~a.base, ULTIMATE.start_main_~a~0.offset, #valid, ULTIMATE.start_insertionSort_#t~post2, #length, ULTIMATE.start_insertionSort_#in~a.offset, ULTIMATE.start_insertionSort_~a.base, ULTIMATE.start_insertionSort_#t~mem3, ULTIMATE.start_insertionSort_#t~mem5, ULTIMATE.start_insertionSort_~j~0] 748#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 749#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 777#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 776#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 775#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 774#L11-3 [134] L11-3-->L11-5: Formula: (and (not |v_ULTIMATE.start_insertionSort_#t~short4_4|) (>= v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 756#L11-5 [66] L11-5-->L11-9: Formula: (not |v_ULTIMATE.start_insertionSort_#t~short4_7|) InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_7|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_6|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_4|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 768#L11-9 [148] L11-9-->L8-2: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_16))) (let ((.cse0 (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1))) (and (= (store |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19 (store (select |v_#memory_int_10| v_ULTIMATE.start_insertionSort_~a.base_19) .cse0 v_ULTIMATE.start_insertionSort_~index~0_7)) |v_#memory_int_9|) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_14 .cse1 4) (select |v_#length_14| v_ULTIMATE.start_insertionSort_~a.base_19)) (= v_ULTIMATE.start_insertionSort_~i~0_15 (+ v_ULTIMATE.start_insertionSort_~i~0_16 1)) (<= 0 .cse0) (= 1 (select |v_#valid_26| v_ULTIMATE.start_insertionSort_~a.base_19))))) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_16, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_7, ULTIMATE.start_insertionSort_#t~pre0=|v_ULTIMATE.start_insertionSort_#t~pre0_4|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_14, #length=|v_#length_14|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_19, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_15, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_16} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~pre0, #memory_int, ULTIMATE.start_insertionSort_~i~0] 750#L8-2 [97] L8-2-->L10: Formula: (< v_ULTIMATE.start_insertionSort_~i~0_5 v_ULTIMATE.start_insertionSort_~array_size_4) InVars {ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} OutVars{ULTIMATE.start_insertionSort_~array_size=v_ULTIMATE.start_insertionSort_~array_size_4, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_5} AuxVars[] AssignedVars[] 752#L10 [145] L10-->L11-8: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~i~0_12))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13))) (and (= (select (select |v_#memory_int_8| v_ULTIMATE.start_insertionSort_~a.base_18) .cse0) v_ULTIMATE.start_insertionSort_~index~0_6) (<= (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_13 4) (select |v_#length_13| v_ULTIMATE.start_insertionSort_~a.base_18)) (= v_ULTIMATE.start_insertionSort_~i~0_12 v_ULTIMATE.start_insertionSort_~j~0_15) (= 1 (select |v_#valid_21| v_ULTIMATE.start_insertionSort_~a.base_18)) (<= 0 .cse0)))) InVars {#valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_6, ULTIMATE.start_insertionSort_#t~mem1=|v_ULTIMATE.start_insertionSort_#t~mem1_5|, #valid=|v_#valid_21|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_13, #memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_18, ULTIMATE.start_insertionSort_~i~0=v_ULTIMATE.start_insertionSort_~i~0_12, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_15} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_~index~0, ULTIMATE.start_insertionSort_#t~mem1, ULTIMATE.start_insertionSort_~j~0] 762#L11-8 [2020-06-22 09:28:14,017 INFO L796 eck$LassoCheckResult]: Loop: 762#L11-8 [124] L11-8-->L11-1: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_2| (< 0 v_ULTIMATE.start_insertionSort_~j~0_4)) InVars {ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_4} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 760#L11-1 [99] L11-1-->L11-2: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_3| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_3|} AuxVars[] AssignedVars[] 757#L11-2 [70] L11-2-->L11-3: Formula: (let ((.cse1 (* 4 v_ULTIMATE.start_insertionSort_~j~0_5))) (let ((.cse0 (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5))) (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= .cse0 (select |v_#length_5| v_ULTIMATE.start_insertionSort_~a.base_6)) (<= 4 .cse0) (= |v_ULTIMATE.start_insertionSort_#t~mem3_2| (select (select |v_#memory_int_2| v_ULTIMATE.start_insertionSort_~a.base_6) (+ .cse1 v_ULTIMATE.start_insertionSort_~a.offset_5 (- 4))))))) InVars {#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} OutVars{#valid=|v_#valid_7|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_5, #memory_int=|v_#memory_int_2|, #length=|v_#length_5|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_2|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_6, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_5} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem3] 754#L11-3 [133] L11-3-->L11-5: Formula: (and |v_ULTIMATE.start_insertionSort_#t~short4_4| (< v_ULTIMATE.start_insertionSort_~index~0_4 |v_ULTIMATE.start_insertionSort_#t~mem3_3|)) InVars {ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} OutVars{ULTIMATE.start_insertionSort_~index~0=v_ULTIMATE.start_insertionSort_~index~0_4, ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_4|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_3|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4] 744#L11-5 [67] L11-5-->L12: Formula: |v_ULTIMATE.start_insertionSort_#t~short4_9| InVars {ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_9|} OutVars{ULTIMATE.start_insertionSort_#t~short4=|v_ULTIMATE.start_insertionSort_#t~short4_8|, ULTIMATE.start_insertionSort_#t~mem3=|v_ULTIMATE.start_insertionSort_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~short4, ULTIMATE.start_insertionSort_#t~mem3] 745#L12 [83] L12-->L12-1: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_7))) (let ((.cse1 (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7))) (and (= |v_ULTIMATE.start_insertionSort_#t~mem5_2| (select (select |v_#memory_int_3| v_ULTIMATE.start_insertionSort_~a.base_9) (+ .cse0 v_ULTIMATE.start_insertionSort_~a.offset_7 (- 4)))) (<= .cse1 (select |v_#length_7| v_ULTIMATE.start_insertionSort_~a.base_9)) (<= 4 .cse1) (= 1 (select |v_#valid_9| v_ULTIMATE.start_insertionSort_~a.base_9))))) InVars {#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} OutVars{#valid=|v_#valid_9|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_7, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_9, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_2|, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_7} AuxVars[] AssignedVars[ULTIMATE.start_insertionSort_#t~mem5] 765#L12-1 [150] L12-1-->L11-8: Formula: (let ((.cse0 (* 4 v_ULTIMATE.start_insertionSort_~j~0_19))) (let ((.cse1 (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0))) (and (= 1 (select |v_#valid_28| v_ULTIMATE.start_insertionSort_~a.base_21)) (<= (+ v_ULTIMATE.start_insertionSort_~a.offset_16 .cse0 4) (select |v_#length_16| v_ULTIMATE.start_insertionSort_~a.base_21)) (= (store |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21 (store (select |v_#memory_int_14| v_ULTIMATE.start_insertionSort_~a.base_21) .cse1 |v_ULTIMATE.start_insertionSort_#t~mem5_8|)) |v_#memory_int_13|) (= v_ULTIMATE.start_insertionSort_~j~0_19 (+ v_ULTIMATE.start_insertionSort_~j~0_18 1)) (<= 0 .cse1)))) InVars {#valid=|v_#valid_28|, #memory_int=|v_#memory_int_14|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_19, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_8|} OutVars{#valid=|v_#valid_28|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_insertionSort_~a.offset=v_ULTIMATE.start_insertionSort_~a.offset_16, ULTIMATE.start_insertionSort_#t~post2=|v_ULTIMATE.start_insertionSort_#t~post2_4|, #length=|v_#length_16|, ULTIMATE.start_insertionSort_~a.base=v_ULTIMATE.start_insertionSort_~a.base_21, ULTIMATE.start_insertionSort_~j~0=v_ULTIMATE.start_insertionSort_~j~0_18, ULTIMATE.start_insertionSort_#t~mem5=|v_ULTIMATE.start_insertionSort_#t~mem5_7|} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_insertionSort_#t~post2, ULTIMATE.start_insertionSort_~j~0, ULTIMATE.start_insertionSort_#t~mem5] 762#L11-8 [2020-06-22 09:28:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1629104041, now seen corresponding path program 2 times [2020-06-22 09:28:14,017 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:14,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:14,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:14,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-06-22 09:28:14,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:14,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:14,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:14,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1267888481, now seen corresponding path program 2 times [2020-06-22 09:28:14,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:14,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:14,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:14,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1567213961, now seen corresponding path program 1 times [2020-06-22 09:28:14,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2020-06-22 09:28:14,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2020-06-22 09:28:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:14,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2020-06-22 09:28:14,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2020-06-22 09:28:14,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:14,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-06-22 09:28:14,425 WARN L188 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 83 [2020-06-22 09:28:14,506 INFO L216 LassoAnalysis]: Preferences: [2020-06-22 09:28:14,506 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2020-06-22 09:28:14,506 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-06-22 09:28:14,507 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2020-06-22 09:28:14,507 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2020-06-22 09:28:14,507 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-06-22 09:28:14,507 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2020-06-22 09:28:14,507 INFO L130 ssoRankerPreferences]: Path of dumped script: [2020-06-22 09:28:14,507 INFO L131 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration8_Lasso [2020-06-22 09:28:14,507 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2020-06-22 09:28:14,507 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2020-06-22 09:28:14,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,715 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2020-06-22 09:28:14,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:14,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-06-22 09:28:15,099 INFO L300 LassoAnalysis]: Preprocessing complete. [2020-06-22 09:28:15,099 INFO L497 LassoAnalysis]: Using template 'affine'. [2020-06-22 09:28:15,099 INFO L122 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-06-22 09:28:15,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:15,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-06-22 09:28:15,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:15,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:15,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:15,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-06-22 09:28:15,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-06-22 09:28:15,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:15,104 INFO L122 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-06-22 09:28:15,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:15,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:15,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:15,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:15,106 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:15,106 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:15,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:15,111 INFO L122 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-06-22 09:28:15,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:15,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:15,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:15,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:15,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:15,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:15,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:15,119 INFO L122 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-06-22 09:28:15,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:15,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:15,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:15,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:15,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:15,121 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:15,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:15,122 INFO L122 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-06-22 09:28:15,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:15,123 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:15,123 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:15,123 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:15,124 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:15,124 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:15,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2020-06-22 09:28:15,128 INFO L122 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-06-22 09:28:15,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2020-06-22 09:28:15,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2020-06-22 09:28:15,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2020-06-22 09:28:15,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2020-06-22 09:28:15,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-06-22 09:28:15,132 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-06-22 09:28:15,143 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-06-22 09:28:15,149 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2020-06-22 09:28:15,149 INFO L444 ModelExtractionUtils]: 34 out of 37 variables were initially zero. Simplification set additionally 1 variables to zero. [2020-06-22 09:28:15,150 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-06-22 09:28:15,151 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-06-22 09:28:15,151 INFO L518 LassoAnalysis]: Proved termination. [2020-06-22 09:28:15,151 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2020-06-22 09:28:15,170 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2020-06-22 09:28:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-06-22 09:28:15,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:15,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2020-06-22 09:28:15,200 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:15,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:15,208 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-06-22 09:28:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:15,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:15,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-06-22 09:28:15,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2020-06-22 09:28:15,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2020-06-22 09:28:15,272 INFO L98 LoopCannibalizer]: 2 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-06-22 09:28:15,272 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 3 loop predicates [2020-06-22 09:28:15,273 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 34 states and 39 transitions. cyclomatic complexity: 7 Second operand 3 states. [2020-06-22 09:28:15,312 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 34 states and 39 transitions. cyclomatic complexity: 7. Second operand 3 states. Result 69 states and 79 transitions. Complement of second has 6 states. [2020-06-22 09:28:15,312 INFO L142 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-06-22 09:28:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-06-22 09:28:15,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-06-22 09:28:15,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 13 letters. Loop has 7 letters. [2020-06-22 09:28:15,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:15,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 20 letters. Loop has 7 letters. [2020-06-22 09:28:15,314 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:15,314 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 35 transitions. Stem has 13 letters. Loop has 14 letters. [2020-06-22 09:28:15,315 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-06-22 09:28:15,317 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 79 transitions. [2020-06-22 09:28:15,318 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:28:15,318 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2020-06-22 09:28:15,318 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-06-22 09:28:15,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-06-22 09:28:15,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-06-22 09:28:15,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-06-22 09:28:15,319 INFO L706 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:28:15,319 INFO L729 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:28:15,319 INFO L609 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-06-22 09:28:15,319 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2020-06-22 09:28:15,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-06-22 09:28:15,319 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-06-22 09:28:15,319 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-06-22 09:28:15,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.06 09:28:15 BasicIcfg [2020-06-22 09:28:15,325 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-06-22 09:28:15,326 INFO L168 Benchmark]: Toolchain (without parser) took 6636.64 ms. Allocated memory was 514.9 MB in the beginning and 677.9 MB in the end (delta: 163.1 MB). Free memory was 440.0 MB in the beginning and 555.0 MB in the end (delta: -115.0 MB). Peak memory consumption was 48.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,327 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-06-22 09:28:15,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.50 ms. Allocated memory was 514.9 MB in the beginning and 556.8 MB in the end (delta: 41.9 MB). Free memory was 439.4 MB in the beginning and 524.9 MB in the end (delta: -85.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,328 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 556.8 MB. Free memory was 524.9 MB in the beginning and 523.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,329 INFO L168 Benchmark]: Boogie Preprocessor took 24.45 ms. Allocated memory is still 556.8 MB. Free memory was 523.3 MB in the beginning and 521.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,329 INFO L168 Benchmark]: RCFGBuilder took 320.72 ms. Allocated memory is still 556.8 MB. Free memory was 521.7 MB in the beginning and 502.1 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,330 INFO L168 Benchmark]: BlockEncodingV2 took 124.99 ms. Allocated memory is still 556.8 MB. Free memory was 502.1 MB in the beginning and 493.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,330 INFO L168 Benchmark]: TraceAbstraction took 1623.63 ms. Allocated memory was 556.8 MB in the beginning and 583.5 MB in the end (delta: 26.7 MB). Free memory was 493.0 MB in the beginning and 481.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 38.5 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,331 INFO L168 Benchmark]: BuchiAutomizer took 4191.05 ms. Allocated memory was 583.5 MB in the beginning and 677.9 MB in the end (delta: 94.4 MB). Free memory was 481.2 MB in the beginning and 555.0 MB in the end (delta: -73.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 50.3 GB. [2020-06-22 09:28:15,336 INFO L337 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 32 locations, 37 edges - StatisticsResult: Encoded RCFG 23 locations, 39 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 514.9 MB. Free memory is still 459.7 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 306.50 ms. Allocated memory was 514.9 MB in the beginning and 556.8 MB in the end (delta: 41.9 MB). Free memory was 439.4 MB in the beginning and 524.9 MB in the end (delta: -85.5 MB). Peak memory consumption was 29.0 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.17 ms. Allocated memory is still 556.8 MB. Free memory was 524.9 MB in the beginning and 523.3 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.45 ms. Allocated memory is still 556.8 MB. Free memory was 523.3 MB in the beginning and 521.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.6 MB. Max. memory is 50.3 GB. * RCFGBuilder took 320.72 ms. Allocated memory is still 556.8 MB. Free memory was 521.7 MB in the beginning and 502.1 MB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 124.99 ms. Allocated memory is still 556.8 MB. Free memory was 502.1 MB in the beginning and 493.5 MB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1623.63 ms. Allocated memory was 556.8 MB in the beginning and 583.5 MB in the end (delta: 26.7 MB). Free memory was 493.0 MB in the beginning and 481.2 MB in the end (delta: 11.8 MB). Peak memory consumption was 38.5 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 4191.05 ms. Allocated memory was 583.5 MB in the beginning and 677.9 MB in the end (delta: 94.4 MB). Free memory was 481.2 MB in the beginning and 555.0 MB in the end (delta: -73.8 MB). Peak memory consumption was 20.6 MB. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - 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 #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 8]: Loop Invariant [2020-06-22 09:28:15,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:15,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((0 == a && 4 * array_size <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 1 <= i - InvariantResult [Line: 11]: Loop Invariant [2020-06-22 09:28:15,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:15,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:15,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:15,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:15,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length [2020-06-22 09:28:15,346 WARN L1298 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((0 == a && 4 * array_size <= unknown-#length-unknown[a]) && 0 <= j) && 4 * i + 4 <= unknown-#length-unknown[a]) && 1 == \valid[a]) && 4 * j + 4 <= unknown-#length-unknown[a]) && 1 <= i - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 10 error locations. SAFE Result, 1.5s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 67 SDtfs, 266 SDslu, 74 SDs, 0 SdLazy, 243 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 20 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 59 HoareAnnotationTreeSize, 2 FomulaSimplifications, 635 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 99 NumberOfCodeBlocks, 99 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 89 ConstructedInterpolants, 0 QuantifiedInterpolants, 3721 SizeOfPredicates, 3 NumberOfNonLiveVariables, 73 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 10 InterpolantComputations, 8 PerfectInterpolantSequences, 7/11 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 8 terminating modules (5 trivial, 0 deterministic, 3 nondeterministic). One nondeterministic module has affine ranking function unknown-#length-unknown[a] + -1 * a + -4 * i and consists of 4 locations. One nondeterministic module has affine ranking function array_size + -1 * i and consists of 3 locations. One nondeterministic module has affine ranking function j and consists of 4 locations. 5 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.1s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.2s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 72 StatesRemovedByMinimization, 5 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 46 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 99 SDtfs, 258 SDslu, 152 SDs, 0 SdLazy, 290 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital158 mio100 ax100 hnf100 lsp96 ukn73 mio100 lsp62 div100 bol100 ite100 ukn100 eq181 hnf86 smp100 dnf100 smp100 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 105ms VariablesStem: 10 VariablesLoop: 7 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-06-22 09:28:05.478 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-06-22 09:28:15.573 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check