./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-15/array14_alloca.i --full-output -ea --architecture 64bit -------------------------------------------------------------------------------- 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/termination-15/array14_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-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 64bit --witnessprinter.graph.data.programhash 519b4f74907cdda12f126cdccb2c6422dda5240e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-29 01:38:29,061 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-29 01:38:29,064 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-29 01:38:29,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-29 01:38:29,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-29 01:38:29,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-29 01:38:29,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-29 01:38:29,081 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-29 01:38:29,083 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-29 01:38:29,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-29 01:38:29,086 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-29 01:38:29,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-29 01:38:29,087 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-29 01:38:29,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-29 01:38:29,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-29 01:38:29,091 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-29 01:38:29,092 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-29 01:38:29,093 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-29 01:38:29,095 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-29 01:38:29,097 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-29 01:38:29,100 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-29 01:38:29,104 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-29 01:38:29,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-29 01:38:29,107 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-29 01:38:29,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-29 01:38:29,114 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-29 01:38:29,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-29 01:38:29,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-29 01:38:29,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-29 01:38:29,117 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-29 01:38:29,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-29 01:38:29,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-29 01:38:29,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-29 01:38:29,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-29 01:38:29,124 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-29 01:38:29,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-29 01:38:29,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-29 01:38:29,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-29 01:38:29,128 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-29 01:38:29,129 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-29 01:38:29,130 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-29 01:38:29,131 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-07-29 01:38:29,163 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-29 01:38:29,164 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-29 01:38:29,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-29 01:38:29,171 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-29 01:38:29,173 INFO L138 SettingsManager]: * Use SBE=true [2020-07-29 01:38:29,173 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-29 01:38:29,174 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-07-29 01:38:29,174 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-29 01:38:29,174 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-29 01:38:29,174 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-29 01:38:29,174 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-29 01:38:29,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-29 01:38:29,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-29 01:38:29,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-29 01:38:29,178 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-29 01:38:29,179 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-07-29 01:38:29,179 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-07-29 01:38:29,179 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-07-29 01:38:29,179 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-29 01:38:29,180 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-29 01:38:29,180 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-29 01:38:29,180 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-07-29 01:38:29,181 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-29 01:38:29,181 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-29 01:38:29,181 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-29 01:38:29,181 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-29 01:38:29,182 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-29 01:38:29,182 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-29 01:38:29,182 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-07-29 01:38:29,183 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-07-29 01:38:29,184 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 519b4f74907cdda12f126cdccb2c6422dda5240e [2020-07-29 01:38:29,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-29 01:38:29,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-29 01:38:29,491 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-29 01:38:29,493 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-29 01:38:29,493 INFO L275 PluginConnector]: CDTParser initialized [2020-07-29 01:38:29,494 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-15/array14_alloca.i [2020-07-29 01:38:29,578 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae0a216a/f150be18ad20423a9a4e36324658a15e/FLAG319382298 [2020-07-29 01:38:30,130 INFO L306 CDTParser]: Found 1 translation units. [2020-07-29 01:38:30,131 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/array14_alloca.i [2020-07-29 01:38:30,141 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae0a216a/f150be18ad20423a9a4e36324658a15e/FLAG319382298 [2020-07-29 01:38:30,511 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cae0a216a/f150be18ad20423a9a4e36324658a15e [2020-07-29 01:38:30,515 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-29 01:38:30,518 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-29 01:38:30,519 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:30,520 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-29 01:38:30,523 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-29 01:38:30,525 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:30" (1/1) ... [2020-07-29 01:38:30,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ee44997 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:30, skipping insertion in model container [2020-07-29 01:38:30,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.07 01:38:30" (1/1) ... [2020-07-29 01:38:30,536 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-29 01:38:30,573 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-29 01:38:31,030 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:31,042 INFO L203 MainTranslator]: Completed pre-run [2020-07-29 01:38:31,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-29 01:38:31,189 INFO L208 MainTranslator]: Completed translation [2020-07-29 01:38:31,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31 WrapperNode [2020-07-29 01:38:31,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-29 01:38:31,191 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:31,191 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-29 01:38:31,192 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-29 01:38:31,202 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,218 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-29 01:38:31,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-29 01:38:31,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-29 01:38:31,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-29 01:38:31,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,259 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,267 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (1/1) ... [2020-07-29 01:38:31,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-29 01:38:31,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-29 01:38:31,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-29 01:38:31,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-29 01:38:31,278 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (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 01:38:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-29 01:38:31,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-29 01:38:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-29 01:38:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-29 01:38:31,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-29 01:38:31,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-29 01:38:31,700 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-29 01:38:31,701 INFO L295 CfgBuilder]: Removed 6 assume(true) statements. [2020-07-29 01:38:31,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:31 BoogieIcfgContainer [2020-07-29 01:38:31,704 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-29 01:38:31,705 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-29 01:38:31,705 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-29 01:38:31,712 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-29 01:38:31,714 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:31,716 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.07 01:38:30" (1/3) ... [2020-07-29 01:38:31,718 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20dc1da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:31, skipping insertion in model container [2020-07-29 01:38:31,718 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:31,718 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.07 01:38:31" (2/3) ... [2020-07-29 01:38:31,719 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@20dc1da9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.07 01:38:31, skipping insertion in model container [2020-07-29 01:38:31,721 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-29 01:38:31,721 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:31" (3/3) ... [2020-07-29 01:38:31,724 INFO L371 chiAutomizerObserver]: Analyzing ICFG array14_alloca.i [2020-07-29 01:38:31,796 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-29 01:38:31,796 INFO L357 BuchiCegarLoop]: Hoare is false [2020-07-29 01:38:31,796 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-29 01:38:31,797 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-29 01:38:31,797 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-29 01:38:31,797 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-29 01:38:31,798 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-29 01:38:31,798 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-29 01:38:31,812 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:31,836 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:31,836 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:31,836 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:31,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:31,842 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:31,842 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-29 01:38:31,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:31,846 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:31,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:31,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:31,846 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-29 01:38:31,847 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-07-29 01:38:31,853 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 8#L-1true havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 16#L367true assume !(main_~length~0 < 1); 5#L367-2true call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 12#L369true assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 17#L370-3true [2020-07-29 01:38:31,854 INFO L796 eck$LassoCheckResult]: Loop: 17#L370-3true assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 9#L372true assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 14#L370-2true main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 17#L370-3true [2020-07-29 01:38:31,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:31,859 INFO L82 PathProgramCache]: Analyzing trace with hash 28695753, now seen corresponding path program 1 times [2020-07-29 01:38:31,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:31,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769725349] [2020-07-29 01:38:31,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:31,974 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:31,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:31,987 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:32,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:32,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:32,012 INFO L82 PathProgramCache]: Analyzing trace with hash 51737, now seen corresponding path program 1 times [2020-07-29 01:38:32,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:32,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509975310] [2020-07-29 01:38:32,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:32,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:32,029 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:32,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:32,048 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:32,054 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:32,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:32,062 INFO L82 PathProgramCache]: Analyzing trace with hash 176707665, now seen corresponding path program 1 times [2020-07-29 01:38:32,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:32,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661441711] [2020-07-29 01:38:32,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:32,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:32,148 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:32,154 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:32,451 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:32,452 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:32,453 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:32,453 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:32,453 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:32,454 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:32,454 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:32,454 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:32,454 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration1_Lasso [2020-07-29 01:38:32,455 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:32,455 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:32,500 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 01:38:32,514 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 01:38:32,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-29 01:38:32,525 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 01:38:32,532 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 01:38:32,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 01:38:32,557 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 01:38:32,562 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 01:38:32,570 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 01:38:32,577 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 01:38:32,738 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 01:38:32,749 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 01:38:33,260 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:33,266 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:33,273 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 01:38:33,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,278 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,278 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,278 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,281 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,281 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:33,296 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) [2020-07-29 01:38:33,342 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 01:38:33,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,345 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,345 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,345 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,345 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,346 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,347 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:33,349 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 01:38:33,392 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 01:38:33,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,395 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,395 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,395 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,397 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,397 INFO L402 nArgumentSynthesizer]: A total of 0 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 01:38:33,400 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 01:38:33,442 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 01:38:33,444 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,444 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,446 INFO L402 nArgumentSynthesizer]: A total of 0 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 01:38:33,449 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 01:38:33,490 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 01:38:33,492 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,497 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:33,497 INFO L402 nArgumentSynthesizer]: A total of 2 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 01:38:33,503 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) [2020-07-29 01:38:33,552 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 01:38:33,554 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,555 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,556 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,557 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:33,559 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 01:38:33,608 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 01:38:33,610 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,611 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,611 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,611 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,613 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,613 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:33,615 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 01:38:33,661 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 01:38:33,663 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:33,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,665 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:33,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:33,667 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 01:38:33,706 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 01:38:33,709 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,709 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,709 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:33,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:33,722 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 01:38:33,747 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 01:38:33,749 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:33,749 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:33,749 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:33,749 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:33,760 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:33,760 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:33,775 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:33,904 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-07-29 01:38:33,905 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 11 variables to zero. 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 01:38:33,919 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:33,928 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:33,929 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:33,930 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~length~0) = -1*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~length~0 Supporting invariants [] [2020-07-29 01:38:33,981 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:33,986 INFO L393 LassoCheck]: Loop: "assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);" "main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207;" [2020-07-29 01:38:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:34,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:34,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 26 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:34,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:34,083 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {25#unseeded} is VALID [2020-07-29 01:38:34,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {25#unseeded} is VALID [2020-07-29 01:38:34,085 INFO L280 TraceCheckUtils]: 2: Hoare triple {25#unseeded} assume !(main_~length~0 < 1); {25#unseeded} is VALID [2020-07-29 01:38:34,086 INFO L280 TraceCheckUtils]: 3: Hoare triple {25#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {25#unseeded} is VALID [2020-07-29 01:38:34,087 INFO L280 TraceCheckUtils]: 4: Hoare triple {25#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {25#unseeded} is VALID [2020-07-29 01:38:34,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:34,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:34,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:34,128 INFO L280 TraceCheckUtils]: 0: Hoare triple {28#(>= oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:34,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} assume main_#t~mem209 > 0;havoc main_#t~mem209;call write~int(0, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:34,130 INFO L280 TraceCheckUtils]: 2: Hoare triple {70#(and (<= ULTIMATE.start_main_~length~0 (+ oldRank0 ULTIMATE.start_main_~i~0)) (< ULTIMATE.start_main_~i~0 ULTIMATE.start_main_~length~0))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {53#(or (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ULTIMATE.start_main_~i~0) ULTIMATE.start_main_~length~0))) unseeded)} is VALID [2020-07-29 01:38:34,131 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 01:38:34,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:34,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:34,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,171 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 01:38:34,172 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 15 states. Second operand 3 states. [2020-07-29 01:38:34,301 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 15 states.. Second operand 3 states. Result 35 states and 50 transitions. Complement of second has 7 states. [2020-07-29 01:38:34,302 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 01:38:34,302 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:34,302 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states. [2020-07-29 01:38:34,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:34,305 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,305 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,306 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:34,311 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:34,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,312 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,312 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 50 transitions. [2020-07-29 01:38:34,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:34,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,314 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,317 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 15 states. [2020-07-29 01:38:34,319 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2020-07-29 01:38:34,321 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 5 examples of accepted words. [2020-07-29 01:38:34,321 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:34,324 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2020-07-29 01:38:34,325 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:34,325 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 01:38:34,326 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:34,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:34,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:34,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:34,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:34,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:34,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 35 letters. Loop has 35 letters. [2020-07-29 01:38:34,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:34,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:34,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 15 letters. Loop has 15 letters. [2020-07-29 01:38:34,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:34,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:34,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 5 letters. [2020-07-29 01:38:34,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:34,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:34,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:34,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:34,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:34,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 6 letters. Loop has 3 letters. [2020-07-29 01:38:34,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:34,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:34,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 3 letters. [2020-07-29 01:38:34,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:34,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:34,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 2 letters. Loop has 1 letters. [2020-07-29 01:38:34,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:34,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:34,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:34,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 7 letters. Loop has 2 letters. [2020-07-29 01:38:34,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:34,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:34,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 35 states and 50 transitions. cyclomatic complexity: 19 Stem has 8 letters. Loop has 2 letters. [2020-07-29 01:38:34,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,379 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:34,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-29 01:38:34,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 3 letters. [2020-07-29 01:38:34,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 8 letters. Loop has 3 letters. [2020-07-29 01:38:34,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 33 transitions. Stem has 5 letters. Loop has 6 letters. [2020-07-29 01:38:34,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:34,389 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 50 transitions. cyclomatic complexity: 19 [2020-07-29 01:38:34,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:34,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 12 states and 17 transitions. [2020-07-29 01:38:34,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2020-07-29 01:38:34,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:34,414 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 17 transitions. [2020-07-29 01:38:34,415 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:34,415 INFO L688 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:34,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 17 transitions. [2020-07-29 01:38:34,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-29 01:38:34,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:34,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:34,457 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:34,459 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. Second operand 12 states. [2020-07-29 01:38:34,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:34,464 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:38:34,465 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:34,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:34,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:34,466 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:38:34,466 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states and 17 transitions. [2020-07-29 01:38:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:34,471 INFO L93 Difference]: Finished difference Result 12 states and 17 transitions. [2020-07-29 01:38:34,471 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:34,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:34,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:34,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:34,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:34,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 17 transitions. [2020-07-29 01:38:34,479 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:34,479 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 17 transitions. [2020-07-29 01:38:34,479 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-29 01:38:34,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 17 transitions. [2020-07-29 01:38:34,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:34,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,486 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:34,486 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:34,486 INFO L794 eck$LassoCheckResult]: Stem: 128#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 124#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 125#L367 assume !(main_~length~0 < 1); 130#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 131#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 132#L370-3 assume !(main_~i~0 < main_~length~0); 126#L370-4 main_~j~0 := 0; 127#L378-2 [2020-07-29 01:38:34,487 INFO L796 eck$LassoCheckResult]: Loop: 127#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 129#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 127#L378-2 [2020-07-29 01:38:34,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815510, now seen corresponding path program 1 times [2020-07-29 01:38:34,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,489 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039543715] [2020-07-29 01:38:34,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:34,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {161#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {161#true} is VALID [2020-07-29 01:38:34,589 INFO L280 TraceCheckUtils]: 1: Hoare triple {161#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {161#true} is VALID [2020-07-29 01:38:34,590 INFO L280 TraceCheckUtils]: 2: Hoare triple {161#true} assume !(main_~length~0 < 1); {163#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:34,591 INFO L280 TraceCheckUtils]: 3: Hoare triple {163#(<= 1 ULTIMATE.start_main_~length~0)} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {163#(<= 1 ULTIMATE.start_main_~length~0)} is VALID [2020-07-29 01:38:34,592 INFO L280 TraceCheckUtils]: 4: Hoare triple {163#(<= 1 ULTIMATE.start_main_~length~0)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {164#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} is VALID [2020-07-29 01:38:34,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (= 0 ULTIMATE.start_main_~i~0) (<= 1 ULTIMATE.start_main_~length~0))} assume !(main_~i~0 < main_~length~0); {162#false} is VALID [2020-07-29 01:38:34,593 INFO L280 TraceCheckUtils]: 6: Hoare triple {162#false} main_~j~0 := 0; {162#false} is VALID [2020-07-29 01:38:34,594 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 01:38:34,595 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039543715] [2020-07-29 01:38:34,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-29 01:38:34,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-29 01:38:34,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423667008] [2020-07-29 01:38:34,599 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-29 01:38:34,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 1 times [2020-07-29 01:38:34,600 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,601 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114357382] [2020-07-29 01:38:34,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,607 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,611 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,613 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:34,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-29 01:38:34,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-29 01:38:34,665 INFO L87 Difference]: Start difference. First operand 12 states and 17 transitions. cyclomatic complexity: 7 Second operand 4 states. [2020-07-29 01:38:34,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:34,731 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:34,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-29 01:38:34,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:34,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:34,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 19 transitions. [2020-07-29 01:38:34,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:34,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 19 transitions. [2020-07-29 01:38:34,746 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-07-29 01:38:34,746 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2020-07-29 01:38:34,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2020-07-29 01:38:34,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-29 01:38:34,747 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2020-07-29 01:38:34,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2020-07-29 01:38:34,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2020-07-29 01:38:34,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:34,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:34,749 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:34,749 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. Second operand 12 states. [2020-07-29 01:38:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:34,751 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:34,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:38:34,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:34,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:34,752 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 14 states and 19 transitions. [2020-07-29 01:38:34,752 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 14 states and 19 transitions. [2020-07-29 01:38:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:34,753 INFO L93 Difference]: Finished difference Result 14 states and 19 transitions. [2020-07-29 01:38:34,753 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 19 transitions. [2020-07-29 01:38:34,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:34,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:34,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:34,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-29 01:38:34,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-29 01:38:34,756 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:38:34,756 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-29 01:38:34,756 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2020-07-29 01:38:34,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2020-07-29 01:38:34,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:34,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:34,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:34,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:34,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:34,758 INFO L794 eck$LassoCheckResult]: Stem: 187#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 181#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 182#L367 assume !(main_~length~0 < 1); 189#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 190#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 191#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 183#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 184#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 192#L370-3 assume !(main_~i~0 < main_~length~0); 185#L370-4 main_~j~0 := 0; 186#L378-2 [2020-07-29 01:38:34,758 INFO L796 eck$LassoCheckResult]: Loop: 186#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 188#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 186#L378-2 [2020-07-29 01:38:34,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1982565540, now seen corresponding path program 1 times [2020-07-29 01:38:34,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,759 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685727866] [2020-07-29 01:38:34,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,784 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,788 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:34,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,789 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 2 times [2020-07-29 01:38:34,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877820808] [2020-07-29 01:38:34,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,795 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,801 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:34,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:34,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996831, now seen corresponding path program 1 times [2020-07-29 01:38:34,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:34,803 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211306506] [2020-07-29 01:38:34,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,818 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:34,831 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:34,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:35,044 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2020-07-29 01:38:35,179 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:35,179 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:35,179 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:35,179 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:35,179 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:35,179 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:35,180 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:35,180 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:35,180 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration3_Lasso [2020-07-29 01:38:35,180 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:35,180 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:35,199 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 01:38:35,205 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 01:38:35,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 01:38:35,214 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 01:38:35,374 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:35,375 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:35,379 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 01:38:35,384 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 01:38:35,388 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 01:38:35,393 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 01:38:35,397 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 01:38:35,401 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 01:38:35,406 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 01:38:35,411 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 01:38:35,900 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:35,900 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:38:35,904 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 01:38:35,906 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:35,906 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:35,906 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:35,906 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:35,906 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:35,907 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:35,907 INFO L402 nArgumentSynthesizer]: A total of 0 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 01:38:35,909 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 01:38:35,952 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 01:38:35,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:35,954 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:35,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:35,955 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:35,955 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:35,956 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:35,956 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:35,958 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 01:38:35,995 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 01:38:35,997 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:35,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:35,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:35,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,000 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,000 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:36,004 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:36,052 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 01:38:36,054 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,054 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,054 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,054 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,058 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,058 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,092 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 01:38:36,093 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:36,100 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 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 01:38:36,124 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 01:38:36,125 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:36,125 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:36,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:36,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:36,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:36,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:36,148 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:36,201 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2020-07-29 01:38:36,201 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 variables to zero. 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) [2020-07-29 01:38:36,212 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:36,216 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:36,216 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:36,217 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_#t~malloc206.base)_2 + 8*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-07-29 01:38:36,266 INFO L297 tatePredicateManager]: 2 out of 3 supporting invariants were superfluous and have been removed [2020-07-29 01:38:36,272 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211;" [2020-07-29 01:38:36,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,277 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-29 01:38:36,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:36,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:36,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:36,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {230#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {230#unseeded} is VALID [2020-07-29 01:38:36,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {230#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {230#unseeded} is VALID [2020-07-29 01:38:36,328 INFO L280 TraceCheckUtils]: 2: Hoare triple {230#unseeded} assume !(main_~length~0 < 1); {230#unseeded} is VALID [2020-07-29 01:38:36,330 INFO L280 TraceCheckUtils]: 3: Hoare triple {230#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,331 INFO L280 TraceCheckUtils]: 4: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,332 INFO L280 TraceCheckUtils]: 5: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,334 INFO L280 TraceCheckUtils]: 7: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,336 INFO L280 TraceCheckUtils]: 8: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} assume !(main_~i~0 < main_~length~0); {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,337 INFO L280 TraceCheckUtils]: 9: Hoare triple {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} main_~j~0 := 0; {259#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) unseeded)} is VALID [2020-07-29 01:38:36,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,344 WARN L261 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:38:36,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:36,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {260#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (>= oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0))))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {295#(and (<= 0 ULTIMATE.start_main_~j~0) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= 4 (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0)) oldRank0))} is VALID [2020-07-29 01:38:36,408 INFO L280 TraceCheckUtils]: 1: Hoare triple {295#(and (<= 0 ULTIMATE.start_main_~j~0) (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (<= 4 (select |#length| ULTIMATE.start_main_~arr~0.base)) (<= (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0)) oldRank0))} assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {262#(and (= ULTIMATE.start_main_~arr~0.base |ULTIMATE.start_main_#t~malloc206.base|) (or (and (> oldRank0 (+ (select |#length| |ULTIMATE.start_main_#t~malloc206.base|) (* 8 ULTIMATE.start_main_~j~0))) (>= oldRank0 0)) unseeded))} is VALID [2020-07-29 01:38:36,408 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 01:38:36,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-29 01:38:36,421 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:36,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,422 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 2 loop predicates [2020-07-29 01:38:36,422 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand 4 states. [2020-07-29 01:38:36,489 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 16 transitions. cyclomatic complexity: 6. Second operand 4 states. Result 16 states and 22 transitions. Complement of second has 6 states. [2020-07-29 01:38:36,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 2 stem states 1 non-accepting loop states 1 accepting loop states [2020-07-29 01:38:36,489 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:36,492 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:36,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:36,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:36,493 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4 states. [2020-07-29 01:38:36,493 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:36,494 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:36,494 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:36,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:36,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:36,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:36,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:36,497 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 12 states and 16 transitions. cyclomatic complexity: 6 [2020-07-29 01:38:36,498 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:36,499 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 4 states. [2020-07-29 01:38:36,500 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:36,501 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:36,501 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:36,502 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:36,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:36,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:36,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:36,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:36,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:36,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 16 letters. [2020-07-29 01:38:36,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:36,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 12 letters. [2020-07-29 01:38:36,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 4 letters. Loop has 4 letters. [2020-07-29 01:38:36,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:36,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 11 letters. Loop has 2 letters. [2020-07-29 01:38:36,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:36,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:36,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 2 letters. Loop has 2 letters. [2020-07-29 01:38:36,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 16 transitions. cyclomatic complexity: 6 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:36,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states. Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:36,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 16 states and 22 transitions. cyclomatic complexity: 9 Stem has 13 letters. Loop has 2 letters. [2020-07-29 01:38:36,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,519 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-29 01:38:36,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2020-07-29 01:38:36,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 2 letters. [2020-07-29 01:38:36,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 12 letters. Loop has 2 letters. [2020-07-29 01:38:36,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 10 letters. Loop has 4 letters. [2020-07-29 01:38:36,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:36,521 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 22 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:36,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:36,523 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:38:36,523 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2020-07-29 01:38:36,523 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:36,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 22 transitions. [2020-07-29 01:38:36,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:36,524 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:36,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 22 transitions. [2020-07-29 01:38:36,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-29 01:38:36,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:36,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:36,526 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:36,526 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand 16 states. [2020-07-29 01:38:36,526 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:36,529 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:38:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:36,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:36,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:36,529 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:38:36,530 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states and 22 transitions. [2020-07-29 01:38:36,530 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:36,532 INFO L93 Difference]: Finished difference Result 16 states and 22 transitions. [2020-07-29 01:38:36,532 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:36,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:36,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:36,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:36,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:36,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-29 01:38:36,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2020-07-29 01:38:36,534 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:36,534 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 22 transitions. [2020-07-29 01:38:36,534 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2020-07-29 01:38:36,534 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 22 transitions. [2020-07-29 01:38:36,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:36,535 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:36,535 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:36,535 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:36,535 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:36,536 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 325#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 326#L367 assume !(main_~length~0 < 1); 337#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 338#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 339#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 327#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 328#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 340#L370-3 assume !(main_~i~0 < main_~length~0); 329#L370-4 main_~j~0 := 0; 330#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 336#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 332#L378-2 [2020-07-29 01:38:36,536 INFO L796 eck$LassoCheckResult]: Loop: 332#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 333#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 332#L378-2 [2020-07-29 01:38:36,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:36,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1719996833, now seen corresponding path program 1 times [2020-07-29 01:38:36,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:36,537 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617113836] [2020-07-29 01:38:36,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:36,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:36,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:36,563 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:36,567 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:36,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:36,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 3 times [2020-07-29 01:38:36,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:36,568 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733071036] [2020-07-29 01:38:36,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:36,572 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:36,575 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:36,577 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:36,577 INFO L82 PathProgramCache]: Analyzing trace with hash -645451100, now seen corresponding path program 1 times [2020-07-29 01:38:36,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:36,578 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781341345] [2020-07-29 01:38:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {436#true} is VALID [2020-07-29 01:38:36,733 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {436#true} is VALID [2020-07-29 01:38:36,733 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#true} assume !(main_~length~0 < 1); {436#true} is VALID [2020-07-29 01:38:36,735 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {438#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,736 INFO L280 TraceCheckUtils]: 4: Hoare triple {438#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,737 INFO L280 TraceCheckUtils]: 5: Hoare triple {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,738 INFO L280 TraceCheckUtils]: 6: Hoare triple {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,739 INFO L280 TraceCheckUtils]: 7: Hoare triple {439#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {440#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:36,740 INFO L280 TraceCheckUtils]: 8: Hoare triple {440#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_~i~0 < main_~length~0); {441#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,741 INFO L280 TraceCheckUtils]: 9: Hoare triple {441#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_~j~0 := 0; {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,742 INFO L280 TraceCheckUtils]: 10: Hoare triple {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:36,743 INFO L280 TraceCheckUtils]: 11: Hoare triple {442#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 4) (= 0 ULTIMATE.start_main_~j~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {443#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:36,745 INFO L280 TraceCheckUtils]: 12: Hoare triple {443#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {437#false} is VALID [2020-07-29 01:38:36,745 INFO L280 TraceCheckUtils]: 13: Hoare triple {437#false} assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {437#false} is VALID [2020-07-29 01:38:36,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:36,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781341345] [2020-07-29 01:38:36,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1888282433] [2020-07-29 01:38:36,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-29 01:38:36,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-29 01:38:36,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:36,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:37,037 INFO L280 TraceCheckUtils]: 0: Hoare triple {436#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {436#true} is VALID [2020-07-29 01:38:37,037 INFO L280 TraceCheckUtils]: 1: Hoare triple {436#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {436#true} is VALID [2020-07-29 01:38:37,038 INFO L280 TraceCheckUtils]: 2: Hoare triple {436#true} assume !(main_~length~0 < 1); {436#true} is VALID [2020-07-29 01:38:37,038 INFO L280 TraceCheckUtils]: 3: Hoare triple {436#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {436#true} is VALID [2020-07-29 01:38:37,039 INFO L280 TraceCheckUtils]: 4: Hoare triple {436#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {459#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:37,040 INFO L280 TraceCheckUtils]: 5: Hoare triple {459#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {459#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:37,040 INFO L280 TraceCheckUtils]: 6: Hoare triple {459#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {459#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:37,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {459#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {469#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:37,043 INFO L280 TraceCheckUtils]: 8: Hoare triple {469#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_~i~0 < main_~length~0); {473#(<= ULTIMATE.start_main_~length~0 1)} is VALID [2020-07-29 01:38:37,043 INFO L280 TraceCheckUtils]: 9: Hoare triple {473#(<= ULTIMATE.start_main_~length~0 1)} main_~j~0 := 0; {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:37,045 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:37,049 INFO L280 TraceCheckUtils]: 11: Hoare triple {477#(and (<= ULTIMATE.start_main_~length~0 1) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {484#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:37,050 INFO L280 TraceCheckUtils]: 12: Hoare triple {484#(and (<= ULTIMATE.start_main_~length~0 1) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {437#false} is VALID [2020-07-29 01:38:37,051 INFO L280 TraceCheckUtils]: 13: Hoare triple {437#false} assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {437#false} is VALID [2020-07-29 01:38:37,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:37,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:37,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2020-07-29 01:38:37,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394437575] [2020-07-29 01:38:37,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:37,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-29 01:38:37,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2020-07-29 01:38:37,110 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. cyclomatic complexity: 9 Second operand 13 states. [2020-07-29 01:38:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:37,713 INFO L93 Difference]: Finished difference Result 33 states and 45 transitions. [2020-07-29 01:38:37,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:38:37,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-29 01:38:37,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:37,743 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 45 transitions. [2020-07-29 01:38:37,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,746 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 28 transitions. [2020-07-29 01:38:37,747 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-07-29 01:38:37,747 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2020-07-29 01:38:37,747 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 28 transitions. [2020-07-29 01:38:37,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:37,747 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 28 transitions. [2020-07-29 01:38:37,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 28 transitions. [2020-07-29 01:38:37,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2020-07-29 01:38:37,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:37,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states and 28 transitions. Second operand 19 states. [2020-07-29 01:38:37,749 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states and 28 transitions. Second operand 19 states. [2020-07-29 01:38:37,749 INFO L87 Difference]: Start difference. First operand 21 states and 28 transitions. Second operand 19 states. [2020-07-29 01:38:37,750 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:37,751 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:38:37,752 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:38:37,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:37,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:37,752 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 21 states and 28 transitions. [2020-07-29 01:38:37,752 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 21 states and 28 transitions. [2020-07-29 01:38:37,753 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:37,755 INFO L93 Difference]: Finished difference Result 21 states and 28 transitions. [2020-07-29 01:38:37,755 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 28 transitions. [2020-07-29 01:38:37,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:37,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:37,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:37,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-29 01:38:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-07-29 01:38:37,759 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:38:37,759 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-07-29 01:38:37,760 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2020-07-29 01:38:37,760 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-07-29 01:38:37,761 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:37,761 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:37,761 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:37,763 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:37,764 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:37,764 INFO L794 eck$LassoCheckResult]: Stem: 537#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 531#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 532#L367 assume !(main_~length~0 < 1); 543#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 544#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 545#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 548#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 546#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 547#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 533#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 534#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 549#L370-3 assume !(main_~i~0 < main_~length~0); 535#L370-4 main_~j~0 := 0; 536#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 541#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 538#L378-2 [2020-07-29 01:38:37,764 INFO L796 eck$LassoCheckResult]: Loop: 538#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 539#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 538#L378-2 [2020-07-29 01:38:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1238701285, now seen corresponding path program 2 times [2020-07-29 01:38:37,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,769 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366437861] [2020-07-29 01:38:37,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,808 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,835 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,840 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:37,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,841 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 4 times [2020-07-29 01:38:37,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,841 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090678311] [2020-07-29 01:38:37,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,846 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,849 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,851 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:37,852 INFO L82 PathProgramCache]: Analyzing trace with hash -685992546, now seen corresponding path program 2 times [2020-07-29 01:38:37,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:37,852 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004472835] [2020-07-29 01:38:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:37,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,868 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:37,885 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:37,889 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:38,189 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2020-07-29 01:38:38,331 INFO L210 LassoAnalysis]: Preferences: [2020-07-29 01:38:38,332 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-29 01:38:38,332 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-29 01:38:38,332 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-29 01:38:38,332 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-29 01:38:38,332 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:38,332 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-29 01:38:38,332 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-29 01:38:38,332 INFO L133 ssoRankerPreferences]: Filename of dumped script: array14_alloca.i_Iteration5_Lasso [2020-07-29 01:38:38,332 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-29 01:38:38,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-29 01:38:38,350 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 01:38:38,359 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 01:38:38,363 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 01:38:38,366 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 01:38:38,369 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 01:38:38,373 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 01:38:38,377 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 01:38:38,380 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 01:38:38,552 WARN L257 bleTransFormulaUtils]: 2 quantified variables [2020-07-29 01:38:38,553 WARN L257 bleTransFormulaUtils]: 1 quantified variables [2020-07-29 01:38:38,559 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 01:38:38,562 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 01:38:38,567 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 01:38:38,576 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 01:38:39,058 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-29 01:38:39,059 INFO L489 LassoAnalysis]: Using template 'affine'. 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 01:38:39,068 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 01:38:39,069 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,069 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:39,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,070 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,070 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:39,070 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:39,071 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 01:38:39,095 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 01:38:39,096 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,096 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,096 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,096 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,097 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:39,097 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:39,101 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:39,125 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 01:38:39,126 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,126 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:39,126 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,126 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,126 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,132 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:39,132 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:39,134 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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-07-29 01:38:39,170 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 01:38:39,172 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,172 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:39,172 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,172 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,172 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,173 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:39,173 INFO L402 nArgumentSynthesizer]: A total of 0 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 01:38:39,175 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 01:38:39,204 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 01:38:39,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,205 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:39,205 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,205 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,205 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,206 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:39,206 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:39,213 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 01:38:39,234 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 Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:39,235 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,237 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:39,237 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:39,241 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 01:38:39,272 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 01:38:39,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-29 01:38:39,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-29 01:38:39,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-29 01:38:39,278 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 01:38:39,301 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 01:38:39,303 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,303 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,303 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,303 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,304 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:39,304 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:39,307 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) [2020-07-29 01:38:39,329 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 Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:39,330 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,332 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:39,332 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:39,334 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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-29 01:38:39,356 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 01:38:39,358 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-29 01:38:39,358 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-29 01:38:39,358 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-29 01:38:39,358 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-29 01:38:39,361 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-29 01:38:39,362 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-29 01:38:39,377 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-29 01:38:39,431 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2020-07-29 01:38:39,431 INFO L444 ModelExtractionUtils]: 3 out of 22 variables were initially zero. Simplification set additionally 16 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 01:38:39,434 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-29 01:38:39,435 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-29 01:38:39,436 INFO L510 LassoAnalysis]: Proved termination. [2020-07-29 01:38:39,436 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~j~0 + 1 Supporting invariants [] [2020-07-29 01:38:39,471 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2020-07-29 01:38:39,473 INFO L393 LassoCheck]: Loop: "assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4);" "assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211;" [2020-07-29 01:38:39,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-29 01:38:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,515 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:39,525 INFO L280 TraceCheckUtils]: 0: Hoare triple {675#unseeded} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {675#unseeded} is VALID [2020-07-29 01:38:39,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {675#unseeded} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {675#unseeded} is VALID [2020-07-29 01:38:39,527 INFO L280 TraceCheckUtils]: 2: Hoare triple {675#unseeded} assume !(main_~length~0 < 1); {675#unseeded} is VALID [2020-07-29 01:38:39,527 INFO L280 TraceCheckUtils]: 3: Hoare triple {675#unseeded} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {675#unseeded} is VALID [2020-07-29 01:38:39,528 INFO L280 TraceCheckUtils]: 4: Hoare triple {675#unseeded} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {675#unseeded} is VALID [2020-07-29 01:38:39,528 INFO L280 TraceCheckUtils]: 5: Hoare triple {675#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {675#unseeded} is VALID [2020-07-29 01:38:39,531 INFO L280 TraceCheckUtils]: 6: Hoare triple {675#unseeded} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {675#unseeded} is VALID [2020-07-29 01:38:39,531 INFO L280 TraceCheckUtils]: 7: Hoare triple {675#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {675#unseeded} is VALID [2020-07-29 01:38:39,532 INFO L280 TraceCheckUtils]: 8: Hoare triple {675#unseeded} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {675#unseeded} is VALID [2020-07-29 01:38:39,532 INFO L280 TraceCheckUtils]: 9: Hoare triple {675#unseeded} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {675#unseeded} is VALID [2020-07-29 01:38:39,533 INFO L280 TraceCheckUtils]: 10: Hoare triple {675#unseeded} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {675#unseeded} is VALID [2020-07-29 01:38:39,533 INFO L280 TraceCheckUtils]: 11: Hoare triple {675#unseeded} assume !(main_~i~0 < main_~length~0); {675#unseeded} is VALID [2020-07-29 01:38:39,534 INFO L280 TraceCheckUtils]: 12: Hoare triple {675#unseeded} main_~j~0 := 0; {675#unseeded} is VALID [2020-07-29 01:38:39,534 INFO L280 TraceCheckUtils]: 13: Hoare triple {675#unseeded} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {675#unseeded} is VALID [2020-07-29 01:38:39,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {675#unseeded} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {675#unseeded} is VALID [2020-07-29 01:38:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-29 01:38:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:39,560 INFO L280 TraceCheckUtils]: 0: Hoare triple {678#(>= oldRank0 (+ (* 2 ULTIMATE.start_main_~j~0) 1))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {755#(and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ (* 2 ULTIMATE.start_main_~j~0) 1) oldRank0))} is VALID [2020-07-29 01:38:39,561 INFO L280 TraceCheckUtils]: 1: Hoare triple {755#(and (<= 0 ULTIMATE.start_main_~j~0) (<= (+ (* 2 ULTIMATE.start_main_~j~0) 1) oldRank0))} assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {708#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* 2 ULTIMATE.start_main_~j~0) 1))))} is VALID [2020-07-29 01:38:39,562 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 01:38:39,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-29 01:38:39,575 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 01:38:39,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,576 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 01:38:39,576 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 3 states. [2020-07-29 01:38:39,614 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 25 transitions. cyclomatic complexity: 9. Second operand 3 states. Result 23 states and 31 transitions. Complement of second has 5 states. [2020-07-29 01:38:39,614 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 01:38:39,615 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:39,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:39,615 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,615 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,615 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 3 states. [2020-07-29 01:38:39,616 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,616 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,616 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:39,617 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,617 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,618 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 19 states and 25 transitions. cyclomatic complexity: 9 [2020-07-29 01:38:39,619 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:39,619 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 3 states. [2020-07-29 01:38:39,620 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,620 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2020-07-29 01:38:39,620 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 23 states and 31 transitions. cyclomatic complexity: 12 [2020-07-29 01:38:39,621 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2020-07-29 01:38:39,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:39,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:39,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:39,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:39,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:39,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 23 letters. Loop has 23 letters. [2020-07-29 01:38:39,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:39,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:39,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 19 letters. Loop has 19 letters. [2020-07-29 01:38:39,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:39,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:39,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 3 letters. Loop has 3 letters. [2020-07-29 01:38:39,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:38:39,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:38:39,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 16 letters. Loop has 2 letters. [2020-07-29 01:38:39,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:39,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:39,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 1 letters. Loop has 2 letters. [2020-07-29 01:38:39,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 19 states and 25 transitions. cyclomatic complexity: 9 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:39,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states. Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:39,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 23 states and 31 transitions. cyclomatic complexity: 12 Stem has 18 letters. Loop has 2 letters. [2020-07-29 01:38:39,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,631 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2020-07-29 01:38:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-29 01:38:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 16 transitions. [2020-07-29 01:38:39,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 2 letters. [2020-07-29 01:38:39,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 17 letters. Loop has 2 letters. [2020-07-29 01:38:39,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 16 transitions. Stem has 15 letters. Loop has 4 letters. [2020-07-29 01:38:39,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-29 01:38:39,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 23 states and 31 transitions. cyclomatic complexity: 12 [2020-07-29 01:38:39,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 23 states to 23 states and 31 transitions. [2020-07-29 01:38:39,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2020-07-29 01:38:39,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-07-29 01:38:39,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 31 transitions. [2020-07-29 01:38:39,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:39,637 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 01:38:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 31 transitions. [2020-07-29 01:38:39,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-29 01:38:39,639 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:39,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states and 31 transitions. Second operand 23 states. [2020-07-29 01:38:39,639 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states and 31 transitions. Second operand 23 states. [2020-07-29 01:38:39,639 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand 23 states. [2020-07-29 01:38:39,640 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:39,642 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:38:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:39,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:39,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:39,643 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states and 31 transitions. [2020-07-29 01:38:39,643 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states and 31 transitions. [2020-07-29 01:38:39,644 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:39,645 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2020-07-29 01:38:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:39,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:39,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:39,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:39,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:39,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-29 01:38:39,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2020-07-29 01:38:39,648 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 01:38:39,648 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 31 transitions. [2020-07-29 01:38:39,648 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2020-07-29 01:38:39,648 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 31 transitions. [2020-07-29 01:38:39,649 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-29 01:38:39,649 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:39,649 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:39,649 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:39,649 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-29 01:38:39,650 INFO L794 eck$LassoCheckResult]: Stem: 795#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 789#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 790#L367 assume !(main_~length~0 < 1); 801#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 802#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 803#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 807#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 804#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 805#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 791#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 792#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 808#L370-3 assume !(main_~i~0 < main_~length~0); 793#L370-4 main_~j~0 := 0; 794#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 799#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 806#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 809#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 796#L378-2 [2020-07-29 01:38:39,650 INFO L796 eck$LassoCheckResult]: Loop: 796#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 797#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 796#L378-2 [2020-07-29 01:38:39,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,650 INFO L82 PathProgramCache]: Analyzing trace with hash -685992544, now seen corresponding path program 3 times [2020-07-29 01:38:39,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:39,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508768281] [2020-07-29 01:38:39,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,667 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,682 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,692 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:39,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash 2308, now seen corresponding path program 5 times [2020-07-29 01:38:39,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:39,693 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592467022] [2020-07-29 01:38:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:39,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,697 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:39,706 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:39,711 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash -2108837149, now seen corresponding path program 3 times [2020-07-29 01:38:39,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:39,713 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066391728] [2020-07-29 01:38:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:39,930 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {939#true} is VALID [2020-07-29 01:38:39,931 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {939#true} is VALID [2020-07-29 01:38:39,931 INFO L280 TraceCheckUtils]: 2: Hoare triple {939#true} assume !(main_~length~0 < 1); {939#true} is VALID [2020-07-29 01:38:39,932 INFO L280 TraceCheckUtils]: 3: Hoare triple {939#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {941#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {941#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,935 INFO L280 TraceCheckUtils]: 7: Hoare triple {942#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~i~0) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:39,936 INFO L280 TraceCheckUtils]: 8: Hoare triple {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:39,937 INFO L280 TraceCheckUtils]: 9: Hoare triple {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} is VALID [2020-07-29 01:38:39,938 INFO L280 TraceCheckUtils]: 10: Hoare triple {943#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 1))} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {944#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 2))} is VALID [2020-07-29 01:38:39,939 INFO L280 TraceCheckUtils]: 11: Hoare triple {944#(and (= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~length~0)) (= 0 ULTIMATE.start_main_~arr~0.offset) (<= ULTIMATE.start_main_~i~0 2))} assume !(main_~i~0 < main_~length~0); {945#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,941 INFO L280 TraceCheckUtils]: 12: Hoare triple {945#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} main_~j~0 := 0; {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,941 INFO L280 TraceCheckUtils]: 13: Hoare triple {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {946#(and (= 0 ULTIMATE.start_main_~j~0) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) 8) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,944 INFO L280 TraceCheckUtils]: 15: Hoare triple {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} is VALID [2020-07-29 01:38:39,945 INFO L280 TraceCheckUtils]: 16: Hoare triple {947#(and (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (+ (* 4 ULTIMATE.start_main_~j~0) 4)) (= 0 ULTIMATE.start_main_~arr~0.offset))} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {948#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} is VALID [2020-07-29 01:38:39,947 INFO L280 TraceCheckUtils]: 17: Hoare triple {948#(and (= 0 ULTIMATE.start_main_~arr~0.offset) (<= (select |#length| ULTIMATE.start_main_~arr~0.base) (* 4 ULTIMATE.start_main_~j~0)))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {940#false} is VALID [2020-07-29 01:38:39,947 INFO L280 TraceCheckUtils]: 18: Hoare triple {940#false} assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {940#false} is VALID [2020-07-29 01:38:39,948 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:39,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066391728] [2020-07-29 01:38:39,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176775216] [2020-07-29 01:38:39,949 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 01:38:39,990 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-29 01:38:39,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-29 01:38:39,991 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-29 01:38:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-29 01:38:40,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-29 01:38:40,324 INFO L280 TraceCheckUtils]: 0: Hoare triple {939#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {939#true} is VALID [2020-07-29 01:38:40,325 INFO L280 TraceCheckUtils]: 1: Hoare triple {939#true} havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; {939#true} is VALID [2020-07-29 01:38:40,325 INFO L280 TraceCheckUtils]: 2: Hoare triple {939#true} assume !(main_~length~0 < 1); {939#true} is VALID [2020-07-29 01:38:40,325 INFO L280 TraceCheckUtils]: 3: Hoare triple {939#true} call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; {939#true} is VALID [2020-07-29 01:38:40,326 INFO L280 TraceCheckUtils]: 4: Hoare triple {939#true} assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; {964#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:40,326 INFO L280 TraceCheckUtils]: 5: Hoare triple {964#(<= ULTIMATE.start_main_~i~0 0)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {964#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:40,327 INFO L280 TraceCheckUtils]: 6: Hoare triple {964#(<= ULTIMATE.start_main_~i~0 0)} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {964#(<= ULTIMATE.start_main_~i~0 0)} is VALID [2020-07-29 01:38:40,327 INFO L280 TraceCheckUtils]: 7: Hoare triple {964#(<= ULTIMATE.start_main_~i~0 0)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {974#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:40,328 INFO L280 TraceCheckUtils]: 8: Hoare triple {974#(<= ULTIMATE.start_main_~i~0 1)} assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); {974#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:40,328 INFO L280 TraceCheckUtils]: 9: Hoare triple {974#(<= ULTIMATE.start_main_~i~0 1)} assume !(main_#t~mem209 > 0);havoc main_#t~mem209; {974#(<= ULTIMATE.start_main_~i~0 1)} is VALID [2020-07-29 01:38:40,329 INFO L280 TraceCheckUtils]: 10: Hoare triple {974#(<= ULTIMATE.start_main_~i~0 1)} main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; {984#(<= ULTIMATE.start_main_~i~0 2)} is VALID [2020-07-29 01:38:40,329 INFO L280 TraceCheckUtils]: 11: Hoare triple {984#(<= ULTIMATE.start_main_~i~0 2)} assume !(main_~i~0 < main_~length~0); {988#(<= ULTIMATE.start_main_~length~0 2)} is VALID [2020-07-29 01:38:40,330 INFO L280 TraceCheckUtils]: 12: Hoare triple {988#(<= ULTIMATE.start_main_~length~0 2)} main_~j~0 := 0; {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:40,331 INFO L280 TraceCheckUtils]: 13: Hoare triple {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:40,331 INFO L280 TraceCheckUtils]: 14: Hoare triple {992#(and (<= ULTIMATE.start_main_~length~0 2) (<= 0 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:40,333 INFO L280 TraceCheckUtils]: 15: Hoare triple {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:40,337 INFO L280 TraceCheckUtils]: 16: Hoare triple {999#(and (<= ULTIMATE.start_main_~length~0 2) (<= 1 ULTIMATE.start_main_~j~0))} assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; {1006#(and (<= ULTIMATE.start_main_~length~0 2) (<= 2 ULTIMATE.start_main_~j~0))} is VALID [2020-07-29 01:38:40,338 INFO L280 TraceCheckUtils]: 17: Hoare triple {1006#(and (<= ULTIMATE.start_main_~length~0 2) (<= 2 ULTIMATE.start_main_~j~0))} assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); {940#false} is VALID [2020-07-29 01:38:40,338 INFO L280 TraceCheckUtils]: 18: Hoare triple {940#false} assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; {940#false} is VALID [2020-07-29 01:38:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-29 01:38:40,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-29 01:38:40,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2020-07-29 01:38:40,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298826072] [2020-07-29 01:38:40,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-29 01:38:40,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-29 01:38:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2020-07-29 01:38:40,382 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. cyclomatic complexity: 12 Second operand 17 states. [2020-07-29 01:38:40,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-29 01:38:40,990 INFO L93 Difference]: Finished difference Result 48 states and 65 transitions. [2020-07-29 01:38:40,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-29 01:38:40,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-29 01:38:41,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-29 01:38:41,050 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 65 transitions. [2020-07-29 01:38:41,052 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2020-07-29 01:38:41,054 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 46 states and 62 transitions. [2020-07-29 01:38:41,054 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2020-07-29 01:38:41,054 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2020-07-29 01:38:41,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 62 transitions. [2020-07-29 01:38:41,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-07-29 01:38:41,055 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 62 transitions. [2020-07-29 01:38:41,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 62 transitions. [2020-07-29 01:38:41,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-07-29 01:38:41,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-29 01:38:41,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states and 62 transitions. Second operand 39 states. [2020-07-29 01:38:41,059 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states and 62 transitions. Second operand 39 states. [2020-07-29 01:38:41,059 INFO L87 Difference]: Start difference. First operand 46 states and 62 transitions. Second operand 39 states. [2020-07-29 01:38:41,059 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:41,062 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2020-07-29 01:38:41,062 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2020-07-29 01:38:41,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:41,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:41,063 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 46 states and 62 transitions. [2020-07-29 01:38:41,063 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 46 states and 62 transitions. [2020-07-29 01:38:41,064 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2020-07-29 01:38:41,066 INFO L93 Difference]: Finished difference Result 46 states and 62 transitions. [2020-07-29 01:38:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 62 transitions. [2020-07-29 01:38:41,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-29 01:38:41,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-29 01:38:41,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-29 01:38:41,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-29 01:38:41,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-29 01:38:41,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 53 transitions. [2020-07-29 01:38:41,069 INFO L711 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-07-29 01:38:41,069 INFO L591 BuchiCegarLoop]: Abstraction has 39 states and 53 transitions. [2020-07-29 01:38:41,069 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2020-07-29 01:38:41,069 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 53 transitions. [2020-07-29 01:38:41,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2020-07-29 01:38:41,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-29 01:38:41,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-29 01:38:41,070 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-29 01:38:41,070 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1] [2020-07-29 01:38:41,071 INFO L794 eck$LassoCheckResult]: Stem: 1074#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1070#L-1 havoc main_#res;havoc main_#t~nondet205, main_#t~malloc206.base, main_#t~malloc206.offset, main_#t~nondet208, main_#t~mem209, main_#t~post207, main_#t~mem210, main_#t~post211, main_#t~post212, main_~i~0, main_~j~0, main_~length~0, main_~arr~0.base, main_~arr~0.offset;havoc main_~i~0;havoc main_~j~0;main_~length~0 := main_#t~nondet205;havoc main_#t~nondet205; 1071#L367 assume !(main_~length~0 < 1); 1080#L367-2 call main_#t~malloc206.base, main_#t~malloc206.offset := #Ultimate.allocOnStack(4 * main_~length~0);main_~arr~0.base, main_~arr~0.offset := main_#t~malloc206.base, main_#t~malloc206.offset; 1081#L369 assume !(main_~arr~0.base == 0 && main_~arr~0.offset == 0);main_~i~0 := 0; 1082#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1087#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 1090#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1088#L370-3 assume !!(main_~i~0 < main_~length~0);call write~int(main_#t~nondet208, main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4);havoc main_#t~nondet208;call main_#t~mem209 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~i~0, 4); 1089#L372 assume !(main_#t~mem209 > 0);havoc main_#t~mem209; 1106#L370-2 main_#t~post207 := main_~i~0;main_~i~0 := 1 + main_#t~post207;havoc main_#t~post207; 1105#L370-3 assume !(main_~i~0 < main_~length~0); 1104#L370-4 main_~j~0 := 0; 1093#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1092#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 1091#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1085#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 1086#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1101#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 1099#L378-2 [2020-07-29 01:38:41,071 INFO L796 eck$LassoCheckResult]: Loop: 1099#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1096#L378 assume main_#t~mem210 < 0;havoc main_#t~mem210;main_#t~post211 := main_~j~0;main_~j~0 := main_#t~post211 - 1;havoc main_#t~post211; 1075#L378-2 assume !!(0 <= main_~j~0 && main_~j~0 < main_~length~0);call main_#t~mem210 := read~int(main_~arr~0.base, main_~arr~0.offset + 4 * main_~j~0, 4); 1076#L378 assume !(main_#t~mem210 < 0);havoc main_#t~mem210;main_#t~post212 := main_~j~0;main_~j~0 := 1 + main_#t~post212;havoc main_#t~post212; 1099#L378-2 [2020-07-29 01:38:41,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:41,071 INFO L82 PathProgramCache]: Analyzing trace with hash -2108839069, now seen corresponding path program 4 times [2020-07-29 01:38:41,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:41,071 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424671120] [2020-07-29 01:38:41,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,102 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:41,107 INFO L82 PathProgramCache]: Analyzing trace with hash 2219337, now seen corresponding path program 1 times [2020-07-29 01:38:41,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:41,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361964532] [2020-07-29 01:38:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,114 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,116 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-29 01:38:41,116 INFO L82 PathProgramCache]: Analyzing trace with hash 50792363, now seen corresponding path program 5 times [2020-07-29 01:38:41,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-29 01:38:41,117 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344160057] [2020-07-29 01:38:41,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-29 01:38:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,132 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-29 01:38:41,147 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-29 01:38:41,152 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-29 01:38:41,610 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 104 [2020-07-29 01:38:41,785 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.07 01:38:41 BoogieIcfgContainer [2020-07-29 01:38:41,785 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-29 01:38:41,785 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-29 01:38:41,785 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-29 01:38:41,785 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-29 01:38:41,786 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.07 01:38:31" (3/4) ... [2020-07-29 01:38:41,789 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2020-07-29 01:38:41,839 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-29 01:38:41,839 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-29 01:38:41,841 INFO L168 Benchmark]: Toolchain (without parser) took 11324.81 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 950.8 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 237.0 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:41,841 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-29 01:38:41,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:41,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.08 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 01:38:41,843 INFO L168 Benchmark]: Boogie Preprocessor took 30.31 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:41,843 INFO L168 Benchmark]: RCFGBuilder took 428.40 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:41,844 INFO L168 Benchmark]: BuchiAutomizer took 10079.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:41,844 INFO L168 Benchmark]: Witness Printer took 54.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 11.5 GB. [2020-07-29 01:38:41,851 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 981.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 670.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.08 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. * Boogie Preprocessor took 30.31 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 428.40 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: 24.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 10079.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 182.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.0 MB). Peak memory consumption was 221.4 MB. Max. memory is 11.5 GB. * Witness Printer took 54.19 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 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.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 3 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * i + length and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[__builtin_alloca(length*sizeof(int))] + 8 * j and consists of 4 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. The remainder module has 39 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.9s and 7 iterations. TraceHistogramMax:3. Analysis of lassos took 7.5s. Construction of modules took 0.4s. Büchi inclusion checks took 1.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 4. Automata minimization 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 39 states and ocurred in iteration 6. Nontrivial modules had stage [3, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 60 SDtfs, 176 SDslu, 91 SDs, 0 SdLazy, 238 SolverSat, 61 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital132 mio100 ax100 hnf97 lsp92 ukn80 mio100 lsp62 div100 bol100 ite100 ukn100 eq157 hnf91 smp94 dnf100 smp100 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 377]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {NULL=1} State at position 1 is {NULL=0, \result=0, NULL=1, arr=2, arr=0, i=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2be0f81=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@631c5e6=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50ae34bd=0, length=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@20c13cdf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@50ae34bd=2, j=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@33dd217c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTArraySubscriptExpression@45946af9=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@5f04d377=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@54a7b489=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 377]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L365] int i, j; [L366] int length = __VERIFIER_nondet_int(); [L367] COND FALSE !(length < 1) [L368] int *arr = __builtin_alloca(length*sizeof(int)); [L369] COND FALSE !(!arr) [L370] i=0 [L370] COND TRUE i 0) [L370] i++ [L370] COND TRUE i 0) [L370] i++ [L370] COND FALSE !(i