./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c42e17875debafbb946353bbf5dda6a0b0ba9b37 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 03:25:43,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 03:25:43,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 03:25:43,882 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 03:25:43,882 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 03:25:43,883 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 03:25:43,885 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 03:25:43,886 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 03:25:43,888 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 03:25:43,889 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 03:25:43,890 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 03:25:43,891 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 03:25:43,891 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 03:25:43,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 03:25:43,893 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 03:25:43,894 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 03:25:43,895 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 03:25:43,896 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 03:25:43,898 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 03:25:43,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 03:25:43,901 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 03:25:43,903 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 03:25:43,904 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 03:25:43,905 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 03:25:43,907 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 03:25:43,908 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 03:25:43,908 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 03:25:43,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 03:25:43,909 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 03:25:43,910 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 03:25:43,910 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 03:25:43,911 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 03:25:43,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 03:25:43,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 03:25:43,914 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 03:25:43,914 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 03:25:43,914 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 03:25:43,915 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 03:25:43,915 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 03:25:43,916 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 03:25:43,916 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 03:25:43,917 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-07-29 03:25:43,933 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 03:25:43,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 03:25:43,934 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 03:25:43,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 03:25:43,935 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 03:25:43,935 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 03:25:43,935 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 03:25:43,935 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 03:25:43,936 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 03:25:43,936 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 03:25:43,936 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 03:25:43,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 03:25:43,936 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-29 03:25:43,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 03:25:43,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 03:25:43,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-29 03:25:43,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 03:25:43,937 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 03:25:43,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 03:25:43,938 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 03:25:43,938 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-29 03:25:43,938 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 03:25:43,939 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 03:25:43,939 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 03:25:43,939 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 03:25:43,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 03:25:43,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 03:25:43,940 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 03:25:43,940 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 03:25:43,940 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 03:25:43,940 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 03:25:43,940 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 03:25:43,941 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 03:25:43,942 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c42e17875debafbb946353bbf5dda6a0b0ba9b37 [2020-07-29 03:25:44,249 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 03:25:44,262 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 03:25:44,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 03:25:44,266 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 03:25:44,266 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 03:25:44,267 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2020-07-29 03:25:44,320 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429dca431/433f4bef2a1f43c8ba569b58cf06832f/FLAGd43c2f0ae [2020-07-29 03:25:44,751 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 03:25:44,752 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/insertionsort-alloca-1.i [2020-07-29 03:25:44,765 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429dca431/433f4bef2a1f43c8ba569b58cf06832f/FLAGd43c2f0ae [2020-07-29 03:25:45,148 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/429dca431/433f4bef2a1f43c8ba569b58cf06832f [2020-07-29 03:25:45,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 03:25:45,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 03:25:45,156 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:45,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 03:25:45,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 03:25:45,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,164 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ade0a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45, skipping insertion in model container [2020-07-29 03:25:45,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 03:25:45,210 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 03:25:45,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:45,721 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 03:25:45,793 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 03:25:45,846 INFO L208 MainTranslator]: Completed translation [2020-07-29 03:25:45,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45 WrapperNode [2020-07-29 03:25:45,847 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 03:25:45,848 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:45,848 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 03:25:45,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 03:25:45,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,873 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,900 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 03:25:45,901 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 03:25:45,901 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 03:25:45,901 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 03:25:45,911 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,914 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,915 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,927 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... [2020-07-29 03:25:45,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 03:25:45,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 03:25:45,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 03:25:45,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 03:25:45,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 03:25:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 03:25:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 03:25:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 03:25:46,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 03:25:46,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 03:25:46,373 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 03:25:46,374 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-29 03:25:46,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:46 BoogieIcfgContainer [2020-07-29 03:25:46,378 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 03:25:46,378 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 03:25:46,379 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 03:25:46,383 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 03:25:46,388 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:46,388 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 03:25:45" (1/3) ... [2020-07-29 03:25:46,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27d2c22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:46, skipping insertion in model container [2020-07-29 03:25:46,393 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:46,393 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 03:25:45" (2/3) ... [2020-07-29 03:25:46,393 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@27d2c22c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 03:25:46, skipping insertion in model container [2020-07-29 03:25:46,394 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 03:25:46,394 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 03:25:46" (3/3) ... [2020-07-29 03:25:46,396 INFO L371 chiAutomizerObserver]: Analyzing ICFG insertionsort-alloca-1.i [2020-07-29 03:25:46,481 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 03:25:46,481 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 03:25:46,483 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 03:25:46,483 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 03:25:46,483 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 03:25:46,483 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 03:25:46,483 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 03:25:46,484 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 03:25:46,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:25:46,539 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:25:46,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:46,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:46,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:46,546 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:46,546 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 03:25:46,547 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:25:46,555 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:25:46,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:46,556 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:46,556 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-29 03:25:46,556 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 03:25:46,565 INFO L794 eck$LassoCheckResult]: Stem: 15#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 14#L-1true havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 6#L525true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 9#L525-2true call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 20#L530-3true [2020-07-29 03:25:46,566 INFO L796 eck$LassoCheckResult]: Loop: 20#L530-3true assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 17#L530-2true main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 20#L530-3true [2020-07-29 03:25:46,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:46,572 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2020-07-29 03:25:46,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:46,585 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267336571] [2020-07-29 03:25:46,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:46,686 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:46,698 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:46,721 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:46,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:46,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2020-07-29 03:25:46,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:46,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658941772] [2020-07-29 03:25:46,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:46,749 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:46,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:46,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:46,769 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:46,773 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2020-07-29 03:25:46,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:46,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034592969] [2020-07-29 03:25:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:46,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:46,814 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:46,819 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:47,035 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-07-29 03:25:47,143 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:47,144 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:47,144 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:47,145 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:47,145 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:47,146 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,146 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:47,146 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:47,147 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration1_Lasso [2020-07-29 03:25:47,147 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:47,147 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:47,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,227 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,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-07-29 03:25:47,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:47,914 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:47,920 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:47,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:47,931 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,932 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,932 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,932 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,933 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,934 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,935 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:47,937 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:47,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:47,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:47,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:47,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:47,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:47,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:47,974 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:47,974 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:47,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,011 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,013 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,013 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,013 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,014 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,017 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,018 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,022 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,055 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,057 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,057 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,057 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,057 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,060 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,061 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,065 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,100 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,100 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,100 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,100 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,101 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,101 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,102 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,148 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,155 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,155 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,190 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,192 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,192 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,226 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,226 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,226 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,229 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,229 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,233 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,271 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,273 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,273 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,273 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,274 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,274 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,274 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,309 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,312 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,312 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,312 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,313 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,315 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,315 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,359 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,359 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,367 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,409 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,415 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,415 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,422 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,449 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:48,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,450 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:48,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:48,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,478 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:48,480 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:48,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:48,481 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:48,481 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:48,489 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:48,489 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:48,507 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:48,557 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-07-29 03:25:48,557 INFO L444 ModelExtractionUtils]: 1 out of 22 variables were initially zero. Simplification set additionally 17 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:48,573 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:48,581 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-07-29 03:25:48,581 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:48,583 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1, ULTIMATE.start_main_~i~1) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc9.base)_1 - 4*ULTIMATE.start_main_~i~1 Supporting invariants [1*ULTIMATE.start_main_~a~0.offset >= 0] [2020-07-29 03:25:48,639 INFO L297 tatePredicateManager]: 2 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 03:25:48,650 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11;" "main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10;" [2020-07-29 03:25:48,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 03:25:48,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 03:25:48,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,787 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:48,808 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {28#unseeded} is VALID [2020-07-29 03:25:48,809 INFO L280 TraceCheckUtils]: 1: Hoare triple {28#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {28#unseeded} is VALID [2020-07-29 03:25:48,810 INFO L280 TraceCheckUtils]: 2: Hoare triple {28#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {28#unseeded} is VALID [2020-07-29 03:25:48,812 INFO L280 TraceCheckUtils]: 3: Hoare triple {28#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {63#(and (>= ULTIMATE.start_main_~a~0.offset 0) unseeded (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_main_~a~0.base))} is VALID [2020-07-29 03:25:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,822 WARN L261 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:48,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:48,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {64#(and (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 4) ULTIMATE.start_main_~i~1))) (>= ULTIMATE.start_main_~a~0.offset 0) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_main_~a~0.base))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {81#(and (<= (+ ULTIMATE.start_main_~a~0.offset (* 4 ULTIMATE.start_main_~i~1) 4) (select |#length| ULTIMATE.start_main_~a~0.base)) (<= 0 ULTIMATE.start_main_~a~0.offset) (<= (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (+ oldRank0 (* 4 ULTIMATE.start_main_~i~1))) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_main_~a~0.base))} is VALID [2020-07-29 03:25:48,870 INFO L280 TraceCheckUtils]: 1: Hoare triple {81#(and (<= (+ ULTIMATE.start_main_~a~0.offset (* 4 ULTIMATE.start_main_~i~1) 4) (select |#length| ULTIMATE.start_main_~a~0.base)) (<= 0 ULTIMATE.start_main_~a~0.offset) (<= (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (+ oldRank0 (* 4 ULTIMATE.start_main_~i~1))) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_main_~a~0.base))} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {66#(and (>= ULTIMATE.start_main_~a~0.offset 0) (or (and (>= oldRank0 0) (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc9.base|) (* (- 4) ULTIMATE.start_main_~i~1)))) unseeded) (= |ULTIMATE.start_main_#t~malloc9.base| ULTIMATE.start_main_~a~0.base))} is VALID [2020-07-29 03:25:48,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:48,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:48,903 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:48,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:48,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:48,915 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:48,917 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states. Second operand 3 states. [2020-07-29 03:25:49,144 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states.. Second operand 3 states. Result 41 states and 59 transitions. Complement of second has 8 states. [2020-07-29 03:25:49,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:49,145 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:49,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2020-07-29 03:25:49,148 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:25:49,148 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,148 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,149 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:49,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:49,154 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,155 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 59 transitions. [2020-07-29 03:25:49,157 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:49,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,157 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,160 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 18 states. [2020-07-29 03:25:49,162 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2020-07-29 03:25:49,165 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2020-07-29 03:25:49,165 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:49,167 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 03:25:49,168 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 03:25:49,168 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 41 states and 59 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:49,170 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:25:49,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:49,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:49,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:49,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:49,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:49,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 41 letters. Loop has 41 letters. [2020-07-29 03:25:49,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:25:49,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:25:49,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 18 letters. Loop has 18 letters. [2020-07-29 03:25:49,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:49,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:49,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:49,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:49,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:49,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:49,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,186 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:49,186 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:49,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,187 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 4 letters. [2020-07-29 03:25:49,187 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,190 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,190 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:49,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,191 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:49,191 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 5 letters. Loop has 2 letters. [2020-07-29 03:25:49,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,192 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,192 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,193 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,193 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:49,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:49,194 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,194 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 2 letters. Loop has 1 letters. [2020-07-29 03:25:49,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,195 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,195 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:49,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,196 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,196 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,197 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,197 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 9 letters. Loop has 4 letters. [2020-07-29 03:25:49,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,198 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,198 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 7 letters. Loop has 4 letters. [2020-07-29 03:25:49,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,199 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:49,199 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:49,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,200 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:49,200 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:49,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,201 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:49,201 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 10 letters. Loop has 4 letters. [2020-07-29 03:25:49,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:49,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:49,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 11 letters. Loop has 6 letters. [2020-07-29 03:25:49,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 8 letters. Loop has 4 letters. [2020-07-29 03:25:49,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 18 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:49,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:49,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 41 states and 59 transitions. cyclomatic complexity: 22 Stem has 6 letters. Loop has 6 letters. [2020-07-29 03:25:49,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,206 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:49,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:49,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2020-07-29 03:25:49,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-29 03:25:49,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-29 03:25:49,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 38 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-29 03:25:49,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:49,212 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 59 transitions. cyclomatic complexity: 22 [2020-07-29 03:25:49,217 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:49,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 15 states and 20 transitions. [2020-07-29 03:25:49,223 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 03:25:49,223 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:49,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2020-07-29 03:25:49,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:49,224 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:25:49,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2020-07-29 03:25:49,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-29 03:25:49,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:49,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:25:49,254 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:25:49,257 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. Second operand 15 states. [2020-07-29 03:25:49,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,262 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:25:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:25:49,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:49,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:49,264 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 03:25:49,264 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states and 20 transitions. [2020-07-29 03:25:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,266 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2020-07-29 03:25:49,266 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:25:49,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:49,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:49,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:49,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:25:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 20 transitions. [2020-07-29 03:25:49,270 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:25:49,270 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2020-07-29 03:25:49,270 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 03:25:49,270 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 20 transitions. [2020-07-29 03:25:49,271 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:49,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,271 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,272 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:49,272 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:49,273 INFO L794 eck$LassoCheckResult]: Stem: 150#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 149#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 143#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 144#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 147#L530-3 assume !(main_~i~1 < main_~array_size~0); 138#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 139#L515-3 [2020-07-29 03:25:49,273 INFO L796 eck$LassoCheckResult]: Loop: 139#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 145#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 148#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 140#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 141#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 146#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 139#L515-3 [2020-07-29 03:25:49,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,274 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2020-07-29 03:25:49,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,274 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027121483] [2020-07-29 03:25:49,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,345 INFO L280 TraceCheckUtils]: 0: Hoare triple {186#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {186#true} is VALID [2020-07-29 03:25:49,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {186#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {186#true} is VALID [2020-07-29 03:25:49,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {186#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {188#(<= 1 ULTIMATE.start_main_~array_size~0)} is VALID [2020-07-29 03:25:49,347 INFO L280 TraceCheckUtils]: 3: Hoare triple {188#(<= 1 ULTIMATE.start_main_~array_size~0)} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {189#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} is VALID [2020-07-29 03:25:49,348 INFO L280 TraceCheckUtils]: 4: Hoare triple {189#(and (<= 1 ULTIMATE.start_main_~array_size~0) (= 0 ULTIMATE.start_main_~i~1))} assume !(main_~i~1 < main_~array_size~0); {187#false} is VALID [2020-07-29 03:25:49,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {187#false} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {187#false} is VALID [2020-07-29 03:25:49,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:49,350 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027121483] [2020-07-29 03:25:49,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:49,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 03:25:49,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544278803] [2020-07-29 03:25:49,354 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:49,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 1 times [2020-07-29 03:25:49,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683044548] [2020-07-29 03:25:49,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,371 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,395 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,399 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:49,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:49,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 03:25:49,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 03:25:49,554 INFO L87 Difference]: Start difference. First operand 15 states and 20 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 03:25:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,612 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 03:25:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 03:25:49,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:49,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:49,627 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2020-07-29 03:25:49,629 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:49,630 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2020-07-29 03:25:49,630 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:25:49,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:49,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2020-07-29 03:25:49,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:49,631 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-07-29 03:25:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2020-07-29 03:25:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2020-07-29 03:25:49,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:49,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 20 transitions. Second operand 15 states. [2020-07-29 03:25:49,633 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 20 transitions. Second operand 15 states. [2020-07-29 03:25:49,633 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand 15 states. [2020-07-29 03:25:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,634 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 03:25:49,634 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 03:25:49,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:49,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:49,635 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states and 20 transitions. [2020-07-29 03:25:49,635 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states and 20 transitions. [2020-07-29 03:25:49,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:49,637 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2020-07-29 03:25:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2020-07-29 03:25:49,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:49,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:49,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:49,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:49,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-29 03:25:49,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2020-07-29 03:25:49,638 INFO L711 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 03:25:49,638 INFO L591 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2020-07-29 03:25:49,638 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 03:25:49,638 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 19 transitions. [2020-07-29 03:25:49,639 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:49,639 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:49,639 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:49,639 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:49,640 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:49,640 INFO L794 eck$LassoCheckResult]: Stem: 220#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 219#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 213#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 214#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 217#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 221#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 222#L530-3 assume !(main_~i~1 < main_~array_size~0); 208#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 209#L515-3 [2020-07-29 03:25:49,640 INFO L796 eck$LassoCheckResult]: Loop: 209#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 215#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 218#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 210#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 211#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 216#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 209#L515-3 [2020-07-29 03:25:49,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,640 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2020-07-29 03:25:49,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,642 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297426837] [2020-07-29 03:25:49,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,680 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,703 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,709 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:49,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 2 times [2020-07-29 03:25:49,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,714 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728639549] [2020-07-29 03:25:49,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:49,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:49,755 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:49,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash -259891877, now seen corresponding path program 1 times [2020-07-29 03:25:49,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:49,757 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330154720] [2020-07-29 03:25:49,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,885 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {262#true} is VALID [2020-07-29 03:25:49,885 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {262#true} is VALID [2020-07-29 03:25:49,886 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {262#true} is VALID [2020-07-29 03:25:49,887 INFO L280 TraceCheckUtils]: 3: Hoare triple {262#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {264#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:49,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {264#(= 0 ULTIMATE.start_main_~i~1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {264#(= 0 ULTIMATE.start_main_~i~1)} is VALID [2020-07-29 03:25:49,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {264#(= 0 ULTIMATE.start_main_~i~1)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {265#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:49,889 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {266#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:49,890 INFO L280 TraceCheckUtils]: 7: Hoare triple {266#(<= ULTIMATE.start_main_~array_size~0 1)} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {267#(and (<= ULTIMATE.start_insertionSort_~array_size 1) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:49,891 INFO L280 TraceCheckUtils]: 8: Hoare triple {267#(and (<= ULTIMATE.start_insertionSort_~array_size 1) (= 1 ULTIMATE.start_insertionSort_~i~0))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {263#false} is VALID [2020-07-29 03:25:49,892 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#false} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {263#false} is VALID [2020-07-29 03:25:49,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#false} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {263#false} is VALID [2020-07-29 03:25:49,892 INFO L280 TraceCheckUtils]: 11: Hoare triple {263#false} assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; {263#false} is VALID [2020-07-29 03:25:49,893 INFO L280 TraceCheckUtils]: 12: Hoare triple {263#false} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {263#false} is VALID [2020-07-29 03:25:49,893 INFO L280 TraceCheckUtils]: 13: Hoare triple {263#false} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {263#false} is VALID [2020-07-29 03:25:49,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:49,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330154720] [2020-07-29 03:25:49,894 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655805512] [2020-07-29 03:25:49,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-29 03:25:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:49,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:50,107 INFO L280 TraceCheckUtils]: 0: Hoare triple {262#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {262#true} is VALID [2020-07-29 03:25:50,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {262#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {262#true} is VALID [2020-07-29 03:25:50,108 INFO L280 TraceCheckUtils]: 2: Hoare triple {262#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {262#true} is VALID [2020-07-29 03:25:50,110 INFO L280 TraceCheckUtils]: 3: Hoare triple {262#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {280#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:50,111 INFO L280 TraceCheckUtils]: 4: Hoare triple {280#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {280#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:50,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {280#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {265#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:50,113 INFO L280 TraceCheckUtils]: 6: Hoare triple {265#(<= ULTIMATE.start_main_~i~1 1)} assume !(main_~i~1 < main_~array_size~0); {266#(<= ULTIMATE.start_main_~array_size~0 1)} is VALID [2020-07-29 03:25:50,114 INFO L280 TraceCheckUtils]: 7: Hoare triple {266#(<= ULTIMATE.start_main_~array_size~0 1)} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {293#(and (<= ULTIMATE.start_insertionSort_~array_size 1) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:50,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {293#(and (<= ULTIMATE.start_insertionSort_~array_size 1) (<= 1 ULTIMATE.start_insertionSort_~i~0))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {263#false} is VALID [2020-07-29 03:25:50,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {263#false} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {263#false} is VALID [2020-07-29 03:25:50,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {263#false} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {263#false} is VALID [2020-07-29 03:25:50,116 INFO L280 TraceCheckUtils]: 11: Hoare triple {263#false} assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; {263#false} is VALID [2020-07-29 03:25:50,116 INFO L280 TraceCheckUtils]: 12: Hoare triple {263#false} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {263#false} is VALID [2020-07-29 03:25:50,116 INFO L280 TraceCheckUtils]: 13: Hoare triple {263#false} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {263#false} is VALID [2020-07-29 03:25:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:50,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:50,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2020-07-29 03:25:50,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848236039] [2020-07-29 03:25:50,239 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2020-07-29 03:25:50,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:50,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-29 03:25:50,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-29 03:25:50,284 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. cyclomatic complexity: 6 Second operand 8 states. [2020-07-29 03:25:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:50,486 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2020-07-29 03:25:50,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-29 03:25:50,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-29 03:25:50,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:50,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 30 transitions. [2020-07-29 03:25:50,513 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:50,515 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 18 states and 21 transitions. [2020-07-29 03:25:50,515 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-07-29 03:25:50,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 03:25:50,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2020-07-29 03:25:50,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 03:25:50,515 INFO L688 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2020-07-29 03:25:50,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2020-07-29 03:25:50,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2020-07-29 03:25:50,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:50,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 03:25:50,517 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 03:25:50,518 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 17 states. [2020-07-29 03:25:50,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:50,519 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 03:25:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 03:25:50,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:50,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:50,520 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 03:25:50,520 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 18 states and 21 transitions. [2020-07-29 03:25:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:50,521 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2020-07-29 03:25:50,521 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2020-07-29 03:25:50,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:50,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:50,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:50,522 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:50,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-29 03:25:50,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2020-07-29 03:25:50,523 INFO L711 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:25:50,523 INFO L591 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2020-07-29 03:25:50,523 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 03:25:50,524 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2020-07-29 03:25:50,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-07-29 03:25:50,524 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:50,524 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:50,525 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:50,525 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-07-29 03:25:50,525 INFO L794 eck$LassoCheckResult]: Stem: 354#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 353#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 347#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 348#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 351#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 355#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 356#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 357#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 358#L530-3 assume !(main_~i~1 < main_~array_size~0); 342#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 343#L515-3 [2020-07-29 03:25:50,525 INFO L796 eck$LassoCheckResult]: Loop: 343#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 349#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 352#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 344#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 345#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 350#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 343#L515-3 [2020-07-29 03:25:50,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:50,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1899756335, now seen corresponding path program 2 times [2020-07-29 03:25:50,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:50,526 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145861474] [2020-07-29 03:25:50,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:50,539 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:50,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:50,549 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:50,553 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:50,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:50,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1808506605, now seen corresponding path program 3 times [2020-07-29 03:25:50,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:50,555 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020177024] [2020-07-29 03:25:50,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:50,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:50,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:50,570 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:50,573 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:50,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1804388285, now seen corresponding path program 2 times [2020-07-29 03:25:50,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:50,574 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301682884] [2020-07-29 03:25:50,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:50,598 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:50,618 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:50,623 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:50,992 WARN L193 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2020-07-29 03:25:51,122 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:51,122 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:51,122 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:51,122 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:51,122 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:51,123 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:51,123 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:51,123 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:51,123 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration4_Lasso [2020-07-29 03:25:51,123 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:51,123 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:51,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,345 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2020-07-29 03:25:51,463 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:51,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,482 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,492 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:51,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:52,223 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:52,224 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:52,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:52,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:52,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:52,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:52,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:52,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:52,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:52,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:52,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:52,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:52,271 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:52,271 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:52,272 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:52,272 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:52,272 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:52,273 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:52,273 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:52,274 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:52,299 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:52,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:52,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:52,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:52,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:52,306 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:52,306 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:52,317 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:52,354 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:52,356 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:52,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:52,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:52,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:52,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:52,360 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:52,370 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:52,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:52,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:52,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:52,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:52,399 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:52,412 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:52,412 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:52,434 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:52,502 INFO L443 ModelExtractionUtils]: Simplification made 13 calls to the SMT solver. [2020-07-29 03:25:52,502 INFO L444 ModelExtractionUtils]: 11 out of 43 variables were initially zero. Simplification set additionally 29 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:52,506 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:52,509 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:52,509 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:52,509 INFO L512 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-07-29 03:25:52,565 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:52,569 INFO L393 LassoCheck]: Loop: "assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0;" "insertionSort_#t~short6 := insertionSort_~j~0 > 0;" "assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0;" "assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;" "call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);" "insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2;" [2020-07-29 03:25:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:52,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {404#unseeded} is VALID [2020-07-29 03:25:52,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {404#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {404#unseeded} is VALID [2020-07-29 03:25:52,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {404#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {404#unseeded} is VALID [2020-07-29 03:25:52,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {404#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {404#unseeded} is VALID [2020-07-29 03:25:52,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {404#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {404#unseeded} is VALID [2020-07-29 03:25:52,622 INFO L280 TraceCheckUtils]: 5: Hoare triple {404#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {404#unseeded} is VALID [2020-07-29 03:25:52,623 INFO L280 TraceCheckUtils]: 6: Hoare triple {404#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {404#unseeded} is VALID [2020-07-29 03:25:52,623 INFO L280 TraceCheckUtils]: 7: Hoare triple {404#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {404#unseeded} is VALID [2020-07-29 03:25:52,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {404#unseeded} assume !(main_~i~1 < main_~array_size~0); {404#unseeded} is VALID [2020-07-29 03:25:52,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {404#unseeded} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {404#unseeded} is VALID [2020-07-29 03:25:52,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 03:25:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:52,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:52,662 INFO L280 TraceCheckUtils]: 0: Hoare triple {407#(>= oldRank0 (+ ULTIMATE.start_insertionSort_~array_size (* (- 1) ULTIMATE.start_insertionSort_~i~0)))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:25:52,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:25:52,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:25:52,665 INFO L280 TraceCheckUtils]: 3: Hoare triple {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:25:52,666 INFO L280 TraceCheckUtils]: 4: Hoare triple {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} is VALID [2020-07-29 03:25:52,667 INFO L280 TraceCheckUtils]: 5: Hoare triple {479#(and (< ULTIMATE.start_insertionSort_~i~0 ULTIMATE.start_insertionSort_~array_size) (<= ULTIMATE.start_insertionSort_~array_size (+ ULTIMATE.start_insertionSort_~i~0 oldRank0)))} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {447#(or (and (> oldRank0 (+ ULTIMATE.start_insertionSort_~array_size (* (- 1) ULTIMATE.start_insertionSort_~i~0))) (>= oldRank0 0)) unseeded)} is VALID [2020-07-29 03:25:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:52,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 03:25:52,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:52,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-07-29 03:25:52,679 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 3 states. [2020-07-29 03:25:52,716 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states and 20 transitions. cyclomatic complexity: 5. Second operand 3 states. Result 25 states and 31 transitions. Complement of second has 4 states. [2020-07-29 03:25:52,716 INFO L141 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-07-29 03:25:52,717 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:52,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:52,717 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:52,717 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:52,717 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 03:25:52,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:52,718 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:52,718 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:52,718 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 31 transitions. [2020-07-29 03:25:52,719 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:52,720 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:52,720 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:52,720 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 17 states and 20 transitions. cyclomatic complexity: 5 [2020-07-29 03:25:52,722 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 7 examples of accepted words. [2020-07-29 03:25:52,722 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 03:25:52,723 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 03:25:52,724 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:52,724 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 25 states and 31 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:52,725 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:52,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:52,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:52,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:52,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:52,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:52,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 25 letters. Loop has 25 letters. [2020-07-29 03:25:52,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:52,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:52,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 17 letters. [2020-07-29 03:25:52,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:52,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:52,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 03:25:52,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:52,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:52,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:52,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:52,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:52,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 6 letters. [2020-07-29 03:25:52,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:52,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:52,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:52,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:52,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:52,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:52,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:52,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:52,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 6 letters. [2020-07-29 03:25:52,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:52,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:52,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 03:25:52,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:52,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:52,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:52,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:52,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:52,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:52,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:52,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 17 states and 20 transitions. cyclomatic complexity: 5 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:25:52,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:25:52,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 25 states and 31 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:25:52,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,748 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:52,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 03:25:52,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2020-07-29 03:25:52,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 6 letters. [2020-07-29 03:25:52,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 16 letters. Loop has 6 letters. [2020-07-29 03:25:52,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 10 letters. Loop has 12 letters. [2020-07-29 03:25:52,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:52,750 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 31 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:52,752 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:52,753 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 23 states and 29 transitions. [2020-07-29 03:25:52,753 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:52,753 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-07-29 03:25:52,754 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 29 transitions. [2020-07-29 03:25:52,754 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:52,754 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2020-07-29 03:25:52,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 29 transitions. [2020-07-29 03:25:52,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-29 03:25:52,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:52,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 29 transitions. Second operand 22 states. [2020-07-29 03:25:52,756 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 29 transitions. Second operand 22 states. [2020-07-29 03:25:52,757 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand 22 states. [2020-07-29 03:25:52,757 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:52,760 INFO L93 Difference]: Finished difference Result 23 states and 29 transitions. [2020-07-29 03:25:52,761 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions. [2020-07-29 03:25:52,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:52,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:52,762 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states and 29 transitions. [2020-07-29 03:25:52,762 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states and 29 transitions. [2020-07-29 03:25:52,763 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:52,764 INFO L93 Difference]: Finished difference Result 24 states and 30 transitions. [2020-07-29 03:25:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2020-07-29 03:25:52,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:52,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:52,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:52,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-29 03:25:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2020-07-29 03:25:52,767 INFO L711 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 03:25:52,767 INFO L591 BuchiCegarLoop]: Abstraction has 22 states and 28 transitions. [2020-07-29 03:25:52,767 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 03:25:52,767 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. [2020-07-29 03:25:52,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:52,768 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:52,768 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:52,769 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:52,769 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:52,769 INFO L794 eck$LassoCheckResult]: Stem: 543#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 542#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 533#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 534#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 539#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 544#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 545#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 546#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 547#L530-3 assume !(main_~i~1 < main_~array_size~0); 526#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 527#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 535#L518-6 [2020-07-29 03:25:52,769 INFO L796 eck$LassoCheckResult]: Loop: 535#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 540#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 528#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 529#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 535#L518-6 [2020-07-29 03:25:52,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,770 INFO L82 PathProgramCache]: Analyzing trace with hash 1237095790, now seen corresponding path program 1 times [2020-07-29 03:25:52,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,771 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396312430] [2020-07-29 03:25:52,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,783 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,798 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 1 times [2020-07-29 03:25:52,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,799 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041491241] [2020-07-29 03:25:52,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,805 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,810 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:52,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:52,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1166584787, now seen corresponding path program 1 times [2020-07-29 03:25:52,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:52,813 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320930026] [2020-07-29 03:25:52,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:52,867 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:52,879 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:53,249 WARN L193 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 90 [2020-07-29 03:25:53,378 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:53,379 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:53,379 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:53,379 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:53,379 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:53,379 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:53,380 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:53,380 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:53,380 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration5_Lasso [2020-07-29 03:25:53,380 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:53,380 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:53,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,615 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2020-07-29 03:25:53,691 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 03:25:53,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,707 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,743 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:53,746 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:54,083 WARN L193 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-07-29 03:25:54,520 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 03:25:54,520 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:54,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,534 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,534 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,534 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,534 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,535 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:54,536 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,566 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:54,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,567 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,567 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:54,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:54,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:54,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,594 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,594 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:54,594 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,594 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,594 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,595 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:54,595 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,597 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,622 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:54,623 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:54,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,658 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,658 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 03:25:54,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,659 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 03:25:54,659 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 03:25:54,660 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,684 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,684 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,684 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,685 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,687 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:54,687 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 03:25:54,694 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 03:25:54,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-29 03:25:54,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 03:25:54,740 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 03:25:54,740 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 03:25:54,740 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 03:25:54,748 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 03:25:54,748 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,769 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 03:25:54,810 INFO L443 ModelExtractionUtils]: Simplification made 12 calls to the SMT solver. [2020-07-29 03:25:54,810 INFO L444 ModelExtractionUtils]: 7 out of 40 variables were initially zero. Simplification set additionally 31 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:54,813 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 03:25:54,815 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 03:25:54,815 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 03:25:54,816 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_insertionSort_~j~0) = 1*ULTIMATE.start_insertionSort_~j~0 Supporting invariants [] [2020-07-29 03:25:54,856 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2020-07-29 03:25:54,860 INFO L393 LassoCheck]: Loop: "insertionSort_#t~short6 := insertionSort_~j~0 > 0;" "assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0;" "assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7;" "insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4;" [2020-07-29 03:25:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 03:25:54,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:54,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {667#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {667#unseeded} is VALID [2020-07-29 03:25:54,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {667#unseeded} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {667#unseeded} is VALID [2020-07-29 03:25:54,915 INFO L280 TraceCheckUtils]: 2: Hoare triple {667#unseeded} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {667#unseeded} is VALID [2020-07-29 03:25:54,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {667#unseeded} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {667#unseeded} is VALID [2020-07-29 03:25:54,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {667#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {667#unseeded} is VALID [2020-07-29 03:25:54,918 INFO L280 TraceCheckUtils]: 5: Hoare triple {667#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {667#unseeded} is VALID [2020-07-29 03:25:54,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {667#unseeded} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {667#unseeded} is VALID [2020-07-29 03:25:54,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {667#unseeded} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {667#unseeded} is VALID [2020-07-29 03:25:54,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {667#unseeded} assume !(main_~i~1 < main_~array_size~0); {667#unseeded} is VALID [2020-07-29 03:25:54,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {667#unseeded} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {667#unseeded} is VALID [2020-07-29 03:25:54,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {667#unseeded} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {667#unseeded} is VALID [2020-07-29 03:25:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,926 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-29 03:25:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:54,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:54,971 INFO L280 TraceCheckUtils]: 0: Hoare triple {670#(>= oldRank0 ULTIMATE.start_insertionSort_~j~0)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {745#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= ULTIMATE.start_insertionSort_~j~0 oldRank0))} is VALID [2020-07-29 03:25:54,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {745#(and (or (and (<= ULTIMATE.start_insertionSort_~j~0 0) (not |ULTIMATE.start_insertionSort_#t~short6|)) (and |ULTIMATE.start_insertionSort_#t~short6| (< 0 ULTIMATE.start_insertionSort_~j~0))) (<= ULTIMATE.start_insertionSort_~j~0 oldRank0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {749#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} is VALID [2020-07-29 03:25:54,973 INFO L280 TraceCheckUtils]: 2: Hoare triple {749#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; {749#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} is VALID [2020-07-29 03:25:54,973 INFO L280 TraceCheckUtils]: 3: Hoare triple {749#(and (<= ULTIMATE.start_insertionSort_~j~0 oldRank0) (< 0 ULTIMATE.start_insertionSort_~j~0))} insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; {710#(or (and (>= oldRank0 0) (> oldRank0 ULTIMATE.start_insertionSort_~j~0)) unseeded)} is VALID [2020-07-29 03:25:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:54,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 03:25:54,984 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:54,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:54,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:54,985 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2020-07-29 03:25:54,985 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-07-29 03:25:55,096 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 28 transitions. cyclomatic complexity: 9. Second operand 4 states. Result 53 states and 68 transitions. Complement of second has 9 states. [2020-07-29 03:25:55,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-07-29 03:25:55,097 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:55,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:55,097 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:55,097 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:55,097 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 03:25:55,098 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:55,098 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:55,098 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:55,098 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 68 transitions. [2020-07-29 03:25:55,099 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:55,100 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:55,100 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:55,101 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 22 states and 28 transitions. cyclomatic complexity: 9 [2020-07-29 03:25:55,101 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:55,102 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 03:25:55,102 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2020-07-29 03:25:55,103 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 03:25:55,103 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 68 transitions. cyclomatic complexity: 20 [2020-07-29 03:25:55,104 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 4 examples of accepted words. [2020-07-29 03:25:55,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:25:55,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:25:55,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:25:55,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:55,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:55,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:55,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 53 letters. Loop has 53 letters. [2020-07-29 03:25:55,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 53 letters. Loop has 53 letters. [2020-07-29 03:25:55,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 53 letters. Loop has 53 letters. [2020-07-29 03:25:55,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:25:55,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:25:55,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 22 letters. Loop has 22 letters. [2020-07-29 03:25:55,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:55,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:55,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 5 letters. Loop has 5 letters. [2020-07-29 03:25:55,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:55,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 13 letters. Loop has 4 letters. [2020-07-29 03:25:55,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:55,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 14 letters. Loop has 4 letters. [2020-07-29 03:25:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:55,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 12 letters. Loop has 4 letters. [2020-07-29 03:25:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:25:55,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:25:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 1 letters. Loop has 3 letters. [2020-07-29 03:25:55,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:25:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:25:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 20 letters. Loop has 4 letters. [2020-07-29 03:25:55,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:55,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 17 letters. Loop has 4 letters. [2020-07-29 03:25:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:25:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:25:55,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 18 letters. Loop has 4 letters. [2020-07-29 03:25:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 22 states and 28 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:25:55,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:25:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 68 transitions. cyclomatic complexity: 20 Stem has 19 letters. Loop has 4 letters. [2020-07-29 03:25:55,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,122 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 03:25:55,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 03:25:55,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2020-07-29 03:25:55,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 4 letters. [2020-07-29 03:25:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 03:25:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 11 letters. Loop has 8 letters. [2020-07-29 03:25:55,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 03:25:55,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 68 transitions. cyclomatic complexity: 20 [2020-07-29 03:25:55,127 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:55,128 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 36 states and 46 transitions. [2020-07-29 03:25:55,129 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:55,129 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:55,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 46 transitions. [2020-07-29 03:25:55,129 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:55,129 INFO L688 BuchiCegarLoop]: Abstraction has 36 states and 46 transitions. [2020-07-29 03:25:55,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states and 46 transitions. [2020-07-29 03:25:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-07-29 03:25:55,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:55,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states and 46 transitions. Second operand 28 states. [2020-07-29 03:25:55,133 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states and 46 transitions. Second operand 28 states. [2020-07-29 03:25:55,133 INFO L87 Difference]: Start difference. First operand 36 states and 46 transitions. Second operand 28 states. [2020-07-29 03:25:55,134 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:55,136 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-29 03:25:55,136 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-29 03:25:55,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:55,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:55,137 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 36 states and 46 transitions. [2020-07-29 03:25:55,137 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 36 states and 46 transitions. [2020-07-29 03:25:55,138 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:55,140 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2020-07-29 03:25:55,141 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 46 transitions. [2020-07-29 03:25:55,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:55,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:55,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:55,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-29 03:25:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2020-07-29 03:25:55,143 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 03:25:55,143 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2020-07-29 03:25:55,143 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 03:25:55,143 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2020-07-29 03:25:55,144 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:55,144 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:55,144 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:55,145 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:55,145 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:55,145 INFO L794 eck$LassoCheckResult]: Stem: 840#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 839#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 828#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 829#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 835#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 844#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 845#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 841#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 842#L530-3 assume !(main_~i~1 < main_~array_size~0); 822#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 823#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 832#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 843#L518-1 assume !insertionSort_#t~short6; 826#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 827#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 833#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 834#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 830#L518-6 [2020-07-29 03:25:55,145 INFO L796 eck$LassoCheckResult]: Loop: 830#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 836#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 824#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 825#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 830#L518-6 [2020-07-29 03:25:55,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,146 INFO L82 PathProgramCache]: Analyzing trace with hash 103309060, now seen corresponding path program 1 times [2020-07-29 03:25:55,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,146 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162072693] [2020-07-29 03:25:55,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:55,187 INFO L280 TraceCheckUtils]: 0: Hoare triple {1004#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1004#true} is VALID [2020-07-29 03:25:55,188 INFO L280 TraceCheckUtils]: 1: Hoare triple {1004#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1004#true} is VALID [2020-07-29 03:25:55,188 INFO L280 TraceCheckUtils]: 2: Hoare triple {1004#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1004#true} is VALID [2020-07-29 03:25:55,188 INFO L280 TraceCheckUtils]: 3: Hoare triple {1004#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {1004#true} is VALID [2020-07-29 03:25:55,189 INFO L280 TraceCheckUtils]: 4: Hoare triple {1004#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1004#true} is VALID [2020-07-29 03:25:55,189 INFO L280 TraceCheckUtils]: 5: Hoare triple {1004#true} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1004#true} is VALID [2020-07-29 03:25:55,189 INFO L280 TraceCheckUtils]: 6: Hoare triple {1004#true} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1004#true} is VALID [2020-07-29 03:25:55,189 INFO L280 TraceCheckUtils]: 7: Hoare triple {1004#true} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1004#true} is VALID [2020-07-29 03:25:55,190 INFO L280 TraceCheckUtils]: 8: Hoare triple {1004#true} assume !(main_~i~1 < main_~array_size~0); {1004#true} is VALID [2020-07-29 03:25:55,191 INFO L280 TraceCheckUtils]: 9: Hoare triple {1004#true} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {1006#(= 1 ULTIMATE.start_insertionSort_~i~0)} is VALID [2020-07-29 03:25:55,192 INFO L280 TraceCheckUtils]: 10: Hoare triple {1006#(= 1 ULTIMATE.start_insertionSort_~i~0)} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {1007#(= ULTIMATE.start_insertionSort_~j~0 1)} is VALID [2020-07-29 03:25:55,192 INFO L280 TraceCheckUtils]: 11: Hoare triple {1007#(= ULTIMATE.start_insertionSort_~j~0 1)} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {1008#|ULTIMATE.start_insertionSort_#t~short6|} is VALID [2020-07-29 03:25:55,193 INFO L280 TraceCheckUtils]: 12: Hoare triple {1008#|ULTIMATE.start_insertionSort_#t~short6|} assume !insertionSort_#t~short6; {1005#false} is VALID [2020-07-29 03:25:55,193 INFO L280 TraceCheckUtils]: 13: Hoare triple {1005#false} assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; {1005#false} is VALID [2020-07-29 03:25:55,193 INFO L280 TraceCheckUtils]: 14: Hoare triple {1005#false} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {1005#false} is VALID [2020-07-29 03:25:55,194 INFO L280 TraceCheckUtils]: 15: Hoare triple {1005#false} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {1005#false} is VALID [2020-07-29 03:25:55,194 INFO L280 TraceCheckUtils]: 16: Hoare triple {1005#false} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {1005#false} is VALID [2020-07-29 03:25:55,195 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-29 03:25:55,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162072693] [2020-07-29 03:25:55,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 03:25:55,195 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-29 03:25:55,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769141978] [2020-07-29 03:25:55,196 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:55,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,196 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 2 times [2020-07-29 03:25:55,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,197 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695890275] [2020-07-29 03:25:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,202 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,205 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,207 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:55,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:55,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-29 03:25:55,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-29 03:25:55,302 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 5 states. [2020-07-29 03:25:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:55,453 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-29 03:25:55,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-29 03:25:55,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-29 03:25:55,480 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:55,481 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 39 states and 49 transitions. [2020-07-29 03:25:55,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:55,484 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 39 states to 39 states and 49 transitions. [2020-07-29 03:25:55,484 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:55,484 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:55,484 INFO L73 IsDeterministic]: Start isDeterministic. Operand 39 states and 49 transitions. [2020-07-29 03:25:55,485 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:55,485 INFO L688 BuchiCegarLoop]: Abstraction has 39 states and 49 transitions. [2020-07-29 03:25:55,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states and 49 transitions. [2020-07-29 03:25:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2020-07-29 03:25:55,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:55,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states and 49 transitions. Second operand 31 states. [2020-07-29 03:25:55,488 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states and 49 transitions. Second operand 31 states. [2020-07-29 03:25:55,488 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 31 states. [2020-07-29 03:25:55,488 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:55,490 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-29 03:25:55,490 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-29 03:25:55,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:55,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:55,491 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 39 states and 49 transitions. [2020-07-29 03:25:55,491 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 39 states and 49 transitions. [2020-07-29 03:25:55,492 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:55,494 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2020-07-29 03:25:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2020-07-29 03:25:55,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:55,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:55,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:55,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-29 03:25:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2020-07-29 03:25:55,497 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-29 03:25:55,497 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2020-07-29 03:25:55,497 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 03:25:55,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 40 transitions. [2020-07-29 03:25:55,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:55,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:55,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:55,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:55,499 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:55,499 INFO L794 eck$LassoCheckResult]: Stem: 1074#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1073#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1060#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1061#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 1067#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1075#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1076#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1077#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1078#L530-3 assume !(main_~i~1 < main_~array_size~0); 1054#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 1055#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 1069#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 1070#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 1079#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 1072#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 1065#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 1066#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 1062#L518-6 [2020-07-29 03:25:55,499 INFO L796 eck$LassoCheckResult]: Loop: 1062#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 1068#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 1056#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 1057#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 1062#L518-6 [2020-07-29 03:25:55,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,499 INFO L82 PathProgramCache]: Analyzing trace with hash 101462018, now seen corresponding path program 3 times [2020-07-29 03:25:55,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,500 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143675570] [2020-07-29 03:25:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:55,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {1249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1249#true} is VALID [2020-07-29 03:25:55,628 INFO L280 TraceCheckUtils]: 1: Hoare triple {1249#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1249#true} is VALID [2020-07-29 03:25:55,628 INFO L280 TraceCheckUtils]: 2: Hoare triple {1249#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1249#true} is VALID [2020-07-29 03:25:55,630 INFO L280 TraceCheckUtils]: 3: Hoare triple {1249#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {1251#(and (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-29 03:25:55,631 INFO L280 TraceCheckUtils]: 4: Hoare triple {1251#(and (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1251#(and (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-29 03:25:55,631 INFO L280 TraceCheckUtils]: 5: Hoare triple {1251#(and (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~i~1) (= 0 ULTIMATE.start_main_~a~0.offset))} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1252#(and (<= ULTIMATE.start_main_~i~1 1) (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-29 03:25:55,632 INFO L280 TraceCheckUtils]: 6: Hoare triple {1252#(and (<= ULTIMATE.start_main_~i~1 1) (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1252#(and (<= ULTIMATE.start_main_~i~1 1) (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-29 03:25:55,633 INFO L280 TraceCheckUtils]: 7: Hoare triple {1252#(and (<= ULTIMATE.start_main_~i~1 1) (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (= 0 ULTIMATE.start_main_~a~0.offset))} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1253#(and (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~i~1 2) (= 0 ULTIMATE.start_main_~a~0.offset))} is VALID [2020-07-29 03:25:55,633 INFO L280 TraceCheckUtils]: 8: Hoare triple {1253#(and (= (select |#length| ULTIMATE.start_main_~a~0.base) (* 4 ULTIMATE.start_main_~array_size~0)) (<= ULTIMATE.start_main_~i~1 2) (= 0 ULTIMATE.start_main_~a~0.offset))} assume !(main_~i~1 < main_~array_size~0); {1254#(and (= 0 ULTIMATE.start_main_~a~0.offset) (<= (select |#length| ULTIMATE.start_main_~a~0.base) 8))} is VALID [2020-07-29 03:25:55,634 INFO L280 TraceCheckUtils]: 9: Hoare triple {1254#(and (= 0 ULTIMATE.start_main_~a~0.offset) (<= (select |#length| ULTIMATE.start_main_~a~0.base) 8))} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,635 INFO L280 TraceCheckUtils]: 10: Hoare triple {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,635 INFO L280 TraceCheckUtils]: 11: Hoare triple {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,636 INFO L280 TraceCheckUtils]: 12: Hoare triple {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,637 INFO L280 TraceCheckUtils]: 13: Hoare triple {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,637 INFO L280 TraceCheckUtils]: 14: Hoare triple {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,638 INFO L280 TraceCheckUtils]: 15: Hoare triple {1255#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) 8) (= 0 ULTIMATE.start_insertionSort_~a.offset) (= 1 ULTIMATE.start_insertionSort_~i~0))} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {1256#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) (* 4 ULTIMATE.start_insertionSort_~i~0)) (= 0 ULTIMATE.start_insertionSort_~a.offset))} is VALID [2020-07-29 03:25:55,639 INFO L280 TraceCheckUtils]: 16: Hoare triple {1256#(and (<= (select |#length| ULTIMATE.start_insertionSort_~a.base) (* 4 ULTIMATE.start_insertionSort_~i~0)) (= 0 ULTIMATE.start_insertionSort_~a.offset))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {1250#false} is VALID [2020-07-29 03:25:55,640 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:55,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143675570] [2020-07-29 03:25:55,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076502809] [2020-07-29 03:25:55,640 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 03:25:55,684 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 03:25:55,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 03:25:55,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-29 03:25:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 03:25:55,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 03:25:55,926 INFO L280 TraceCheckUtils]: 0: Hoare triple {1249#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1249#true} is VALID [2020-07-29 03:25:55,926 INFO L280 TraceCheckUtils]: 1: Hoare triple {1249#true} havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; {1249#true} is VALID [2020-07-29 03:25:55,926 INFO L280 TraceCheckUtils]: 2: Hoare triple {1249#true} assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); {1249#true} is VALID [2020-07-29 03:25:55,931 INFO L280 TraceCheckUtils]: 3: Hoare triple {1249#true} call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; {1269#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:55,932 INFO L280 TraceCheckUtils]: 4: Hoare triple {1269#(<= ULTIMATE.start_main_~i~1 0)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1269#(<= ULTIMATE.start_main_~i~1 0)} is VALID [2020-07-29 03:25:55,932 INFO L280 TraceCheckUtils]: 5: Hoare triple {1269#(<= ULTIMATE.start_main_~i~1 0)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1276#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:55,933 INFO L280 TraceCheckUtils]: 6: Hoare triple {1276#(<= ULTIMATE.start_main_~i~1 1)} assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; {1276#(<= ULTIMATE.start_main_~i~1 1)} is VALID [2020-07-29 03:25:55,933 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#(<= ULTIMATE.start_main_~i~1 1)} main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; {1283#(<= ULTIMATE.start_main_~i~1 2)} is VALID [2020-07-29 03:25:55,934 INFO L280 TraceCheckUtils]: 8: Hoare triple {1283#(<= ULTIMATE.start_main_~i~1 2)} assume !(main_~i~1 < main_~array_size~0); {1287#(<= ULTIMATE.start_main_~array_size~0 2)} is VALID [2020-07-29 03:25:55,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {1287#(<= ULTIMATE.start_main_~array_size~0 2)} insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,936 INFO L280 TraceCheckUtils]: 10: Hoare triple {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} insertionSort_#t~short6 := insertionSort_~j~0 > 0; {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,943 INFO L280 TraceCheckUtils]: 12: Hoare triple {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,944 INFO L280 TraceCheckUtils]: 13: Hoare triple {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,945 INFO L280 TraceCheckUtils]: 14: Hoare triple {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {1291#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 1 ULTIMATE.start_insertionSort_~i~0))} insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; {1310#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 2 ULTIMATE.start_insertionSort_~i~0))} is VALID [2020-07-29 03:25:55,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {1310#(and (<= ULTIMATE.start_insertionSort_~array_size 2) (<= 2 ULTIMATE.start_insertionSort_~i~0))} assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; {1250#false} is VALID [2020-07-29 03:25:55,949 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 03:25:55,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 03:25:55,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-07-29 03:25:55,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594208723] [2020-07-29 03:25:55,950 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 03:25:55,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:55,950 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 3 times [2020-07-29 03:25:55,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:55,951 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862039508] [2020-07-29 03:25:55,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,963 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:55,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:55,969 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:56,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 03:25:56,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-29 03:25:56,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-29 03:25:56,073 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. cyclomatic complexity: 13 Second operand 14 states. [2020-07-29 03:25:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 03:25:56,619 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2020-07-29 03:25:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-29 03:25:56,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-29 03:25:56,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 03:25:56,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 61 transitions. [2020-07-29 03:25:56,679 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:56,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 34 states and 43 transitions. [2020-07-29 03:25:56,681 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 03:25:56,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 03:25:56,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 43 transitions. [2020-07-29 03:25:56,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 03:25:56,681 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 43 transitions. [2020-07-29 03:25:56,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 43 transitions. [2020-07-29 03:25:56,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-29 03:25:56,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 03:25:56,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states and 43 transitions. Second operand 33 states. [2020-07-29 03:25:56,684 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states and 43 transitions. Second operand 33 states. [2020-07-29 03:25:56,684 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 33 states. [2020-07-29 03:25:56,684 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:56,686 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-29 03:25:56,686 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-29 03:25:56,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:56,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:56,687 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states and 43 transitions. [2020-07-29 03:25:56,687 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states and 43 transitions. [2020-07-29 03:25:56,688 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 03:25:56,689 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2020-07-29 03:25:56,689 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2020-07-29 03:25:56,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 03:25:56,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 03:25:56,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 03:25:56,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 03:25:56,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-29 03:25:56,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2020-07-29 03:25:56,692 INFO L711 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-29 03:25:56,692 INFO L591 BuchiCegarLoop]: Abstraction has 33 states and 42 transitions. [2020-07-29 03:25:56,692 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2020-07-29 03:25:56,692 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33 states and 42 transitions. [2020-07-29 03:25:56,693 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2020-07-29 03:25:56,693 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 03:25:56,693 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 03:25:56,693 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 03:25:56,694 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-07-29 03:25:56,694 INFO L794 eck$LassoCheckResult]: Stem: 1386#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1385#L-1 havoc main_#res;havoc main_#t~nondet8, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet11, main_#t~post10, main_~i~1, main_~array_size~0, main_~a~0.base, main_~a~0.offset;main_~array_size~0 := main_#t~nondet8;havoc main_#t~nondet8; 1373#L525 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1374#L525-2 call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~a~0.base, main_~a~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;main_~i~1 := 0; 1380#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1391#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1399#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1387#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1388#L530-3 assume !!(main_~i~1 < main_~array_size~0);call write~int(main_#t~nondet11, main_~a~0.base, main_~a~0.offset + 4 * main_~i~1, 4);havoc main_#t~nondet11; 1392#L530-2 main_#t~post10 := main_~i~1;main_~i~1 := 1 + main_#t~post10;havoc main_#t~post10; 1393#L530-3 assume !(main_~i~1 < main_~array_size~0); 1367#L530-4 insertionSort_#in~a.base, insertionSort_#in~a.offset, insertionSort_#in~array_size := main_~a~0.base, main_~a~0.offset, main_~array_size~0;havoc insertionSort_#t~mem3, insertionSort_#t~mem7, insertionSort_#t~post4, insertionSort_#t~mem5, insertionSort_#t~short6, insertionSort_#t~pre2, insertionSort_~a.base, insertionSort_~a.offset, insertionSort_~array_size, insertionSort_~i~0, insertionSort_~j~0, insertionSort_~index~0;insertionSort_~a.base, insertionSort_~a.offset := insertionSort_#in~a.base, insertionSort_#in~a.offset;insertionSort_~array_size := insertionSort_#in~array_size;havoc insertionSort_~i~0;havoc insertionSort_~j~0;havoc insertionSort_~index~0;insertionSort_~i~0 := 1; 1368#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 1383#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 1389#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 1390#L518-3 assume !insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6; 1384#L518-7 call write~int(insertionSort_~index~0, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4); 1378#L515-2 insertionSort_#t~pre2 := 1 + insertionSort_~i~0;insertionSort_~i~0 := 1 + insertionSort_~i~0;havoc insertionSort_#t~pre2; 1379#L515-3 assume !!(insertionSort_~i~0 < insertionSort_~array_size);call insertionSort_#t~mem3 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~i~0, 4);insertionSort_~index~0 := insertionSort_#t~mem3;havoc insertionSort_#t~mem3;insertionSort_~j~0 := insertionSort_~i~0; 1375#L518-6 [2020-07-29 03:25:56,694 INFO L796 eck$LassoCheckResult]: Loop: 1375#L518-6 insertionSort_#t~short6 := insertionSort_~j~0 > 0; 1381#L518-1 assume insertionSort_#t~short6;call insertionSort_#t~mem5 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);insertionSort_#t~short6 := insertionSort_#t~mem5 > insertionSort_~index~0; 1369#L518-3 assume !!insertionSort_#t~short6;havoc insertionSort_#t~mem5;havoc insertionSort_#t~short6;call insertionSort_#t~mem7 := read~int(insertionSort_~a.base, insertionSort_~a.offset + 4 * (insertionSort_~j~0 - 1), 4);call write~int(insertionSort_#t~mem7, insertionSort_~a.base, insertionSort_~a.offset + 4 * insertionSort_~j~0, 4);havoc insertionSort_#t~mem7; 1370#L518-5 insertionSort_#t~post4 := insertionSort_~j~0;insertionSort_~j~0 := insertionSort_#t~post4 - 1;havoc insertionSort_#t~post4; 1375#L518-6 [2020-07-29 03:25:56,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:56,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1730024032, now seen corresponding path program 4 times [2020-07-29 03:25:56,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:56,695 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352659912] [2020-07-29 03:25:56,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:56,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:56,720 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:56,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:56,734 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:56,739 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:56,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:56,739 INFO L82 PathProgramCache]: Analyzing trace with hash 2004198, now seen corresponding path program 4 times [2020-07-29 03:25:56,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:56,740 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732111698] [2020-07-29 03:25:56,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:56,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:56,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:56,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:56,748 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 03:25:56,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1424072763, now seen corresponding path program 1 times [2020-07-29 03:25:56,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 03:25:56,749 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350966306] [2020-07-29 03:25:56,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 03:25:56,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:56,770 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 03:25:56,796 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 03:25:56,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 03:25:57,703 WARN L193 SmtUtils]: Spent 768.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 128 [2020-07-29 03:25:57,945 WARN L193 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-07-29 03:25:57,947 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 03:25:57,948 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 03:25:57,948 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 03:25:57,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 03:25:57,948 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 03:25:57,948 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 03:25:57,948 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 03:25:57,949 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 03:25:57,949 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertionsort-alloca-1.i_Iteration8_Lasso [2020-07-29 03:25:57,949 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 03:25:57,949 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 03:25:57,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:57,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 03:25:58,066 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: MapEliminator tries to combine Int and (Array Int Int) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceSelectStoreTerm(MapEliminator.java:592) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.replaceStoreTerms(MapEliminator.java:542) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.getRewrittenTransFormula(MapEliminator.java:330) at de.uni_freiburg.informatik.ultimate.lassoranker.preprocessors.MapEliminationLassoPreprocessor.process(MapEliminationLassoPreprocessor.java:109) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.applyPreprocessor(LassoBuilder.java:154) at de.uni_freiburg.informatik.ultimate.lassoranker.variables.LassoBuilder.preprocess(LassoBuilder.java:262) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.preprocess(LassoAnalysis.java:278) at de.uni_freiburg.informatik.ultimate.lassoranker.LassoAnalysis.(LassoAnalysis.java:229) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:612) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.access$16(LassoCheck.java:539) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLassoTermination(LassoCheck.java:957) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:865) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:458) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-29 03:25:58,072 INFO L168 Benchmark]: Toolchain (without parser) took 12918.51 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 389.5 MB). Free memory was 961.6 MB in the beginning and 1.3 GB in the end (delta: -309.3 MB). Peak memory consumption was 453.3 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:58,072 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:58,073 INFO L168 Benchmark]: CACSL2BoogieTranslator took 690.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:58,073 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:58,074 INFO L168 Benchmark]: Boogie Preprocessor took 32.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 03:25:58,074 INFO L168 Benchmark]: RCFGBuilder took 443.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:58,075 INFO L168 Benchmark]: BuchiAutomizer took 11691.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.6 MB). Peak memory consumption was 427.9 MB. Max. memory is 11.5 GB. [2020-07-29 03:25:58,078 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 690.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 956.2 MB in the beginning and 1.1 GB in the end (delta: -172.4 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 53.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 443.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 11691.08 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 236.5 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -181.6 MB). Peak memory consumption was 427.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: MapEliminator tries to combine Int and (Array Int Int) de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: MapEliminator tries to combine Int and (Array Int Int): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.mapelimination.MapEliminator.indexEqualityInequalityImpliesValueEquality(MapEliminator.java:850) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...