./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e71cee6f8bfbdef490f31ccfbc80e5cb950e3b6d ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-27 14:35:44,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-27 14:35:44,432 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-27 14:35:44,453 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-27 14:35:44,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-27 14:35:44,455 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-27 14:35:44,456 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-27 14:35:44,457 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-27 14:35:44,458 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-27 14:35:44,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-27 14:35:44,459 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-27 14:35:44,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-27 14:35:44,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-27 14:35:44,471 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-27 14:35:44,472 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-27 14:35:44,474 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-27 14:35:44,475 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-27 14:35:44,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-27 14:35:44,478 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-27 14:35:44,480 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-27 14:35:44,481 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-27 14:35:44,482 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-27 14:35:44,483 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-27 14:35:44,483 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-27 14:35:44,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-27 14:35:44,485 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-27 14:35:44,486 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-27 14:35:44,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-27 14:35:44,490 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-27 14:35:44,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-27 14:35:44,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-27 14:35:44,492 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-27 14:35:44,493 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-27 14:35:44,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-27 14:35:44,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-27 14:35:44,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-27 14:35:44,497 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-27 14:35:44,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-27 14:35:44,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-27 14:35:44,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-27 14:35:44,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-27 14:35:44,500 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-08-27 14:35:44,519 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-27 14:35:44,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-27 14:35:44,523 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-27 14:35:44,523 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-27 14:35:44,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-27 14:35:44,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-27 14:35:44,525 INFO L138 SettingsManager]: * Use SBE=true [2021-08-27 14:35:44,525 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-08-27 14:35:44,525 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-08-27 14:35:44,525 INFO L138 SettingsManager]: * Use old map elimination=false [2021-08-27 14:35:44,526 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-08-27 14:35:44,526 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-08-27 14:35:44,526 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-08-27 14:35:44,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-08-27 14:35:44,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-08-27 14:35:44,528 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-08-27 14:35:44,528 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-27 14:35:44,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-27 14:35:44,528 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-08-27 14:35:44,528 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-27 14:35:44,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-08-27 14:35:44,529 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-27 14:35:44,529 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-27 14:35:44,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-27 14:35:44,529 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-27 14:35:44,529 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-27 14:35:44,530 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-08-27 14:35:44,531 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e71cee6f8bfbdef490f31ccfbc80e5cb950e3b6d [2021-08-27 14:35:44,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-27 14:35:44,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-27 14:35:44,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-27 14:35:44,771 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-27 14:35:44,772 INFO L275 PluginConnector]: CDTParser initialized [2021-08-27 14:35:44,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2021-08-27 14:35:44,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42a36f60/e350b9b3bf9f491d8af3e02a8a78cc39/FLAGe5e1db038 [2021-08-27 14:35:45,177 INFO L306 CDTParser]: Found 1 translation units. [2021-08-27 14:35:45,177 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i [2021-08-27 14:35:45,182 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42a36f60/e350b9b3bf9f491d8af3e02a8a78cc39/FLAGe5e1db038 [2021-08-27 14:35:45,194 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d42a36f60/e350b9b3bf9f491d8af3e02a8a78cc39 [2021-08-27 14:35:45,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-27 14:35:45,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-27 14:35:45,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-27 14:35:45,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-27 14:35:45,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-27 14:35:45,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5909e132 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45, skipping insertion in model container [2021-08-27 14:35:45,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-27 14:35:45,230 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-27 14:35:45,342 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2021-08-27 14:35:45,351 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:35:45,356 INFO L203 MainTranslator]: Completed pre-run [2021-08-27 14:35:45,371 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_assert_loop_dep.i[814,827] [2021-08-27 14:35:45,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-27 14:35:45,388 INFO L208 MainTranslator]: Completed translation [2021-08-27 14:35:45,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45 WrapperNode [2021-08-27 14:35:45,388 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-27 14:35:45,389 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-27 14:35:45,390 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-27 14:35:45,390 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-27 14:35:45,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,418 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,432 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-27 14:35:45,433 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-27 14:35:45,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-27 14:35:45,433 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-27 14:35:45,438 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-27 14:35:45,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-27 14:35:45,467 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-27 14:35:45,467 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-27 14:35:45,468 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (1/1) ... [2021-08-27 14:35:45,473 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:45,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:45,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-08-27 14:35:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-27 14:35:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-27 14:35:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-27 14:35:45,535 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-27 14:35:45,535 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-27 14:35:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-08-27 14:35:45,536 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-27 14:35:45,740 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-27 14:35:45,741 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2021-08-27 14:35:45,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:35:45 BoogieIcfgContainer [2021-08-27 14:35:45,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-27 14:35:45,743 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-08-27 14:35:45,743 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-08-27 14:35:45,774 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-08-27 14:35:45,774 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:35:45,774 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.08 02:35:45" (1/3) ... [2021-08-27 14:35:45,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cf6c20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:35:45, skipping insertion in model container [2021-08-27 14:35:45,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:35:45,775 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.08 02:35:45" (2/3) ... [2021-08-27 14:35:45,775 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5cf6c20c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.08 02:35:45, skipping insertion in model container [2021-08-27 14:35:45,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-08-27 14:35:45,776 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:35:45" (3/3) ... [2021-08-27 14:35:45,776 INFO L389 chiAutomizerObserver]: Analyzing ICFG array_assert_loop_dep.i [2021-08-27 14:35:45,830 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-08-27 14:35:45,831 INFO L360 BuchiCegarLoop]: Hoare is false [2021-08-27 14:35:45,831 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-08-27 14:35:45,831 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-08-27 14:35:45,832 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-08-27 14:35:45,832 INFO L364 BuchiCegarLoop]: Difference is false [2021-08-27 14:35:45,833 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-08-27 14:35:45,833 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-08-27 14:35:45,841 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:45,852 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-27 14:35:45,853 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:45,853 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:45,857 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:35:45,857 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:35:45,857 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-08-27 14:35:45,858 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:45,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2021-08-27 14:35:45,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:45,859 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:45,860 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-08-27 14:35:45,860 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2021-08-27 14:35:45,865 INFO L791 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 8#L-1true havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 13#L18-3true [2021-08-27 14:35:45,865 INFO L793 eck$LassoCheckResult]: Loop: 13#L18-3true assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 12#L18-2true main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 13#L18-3true [2021-08-27 14:35:45,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:45,874 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-08-27 14:35:45,880 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:45,881 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349792426] [2021-08-27 14:35:45,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:45,882 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:45,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:45,953 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:45,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:45,989 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:45,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:45,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2021-08-27 14:35:45,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:45,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873222555] [2021-08-27 14:35:45,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:45,993 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:46,007 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:46,017 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:46,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:46,019 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2021-08-27 14:35:46,019 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:46,019 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711860644] [2021-08-27 14:35:46,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:46,020 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:46,031 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:46,044 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:46,610 INFO L210 LassoAnalysis]: Preferences: [2021-08-27 14:35:46,611 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2021-08-27 14:35:46,611 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2021-08-27 14:35:46,611 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2021-08-27 14:35:46,611 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2021-08-27 14:35:46,611 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:46,612 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2021-08-27 14:35:46,612 INFO L132 ssoRankerPreferences]: Path of dumped script: [2021-08-27 14:35:46,612 INFO L133 ssoRankerPreferences]: Filename of dumped script: array_assert_loop_dep.i_Iteration1_Lasso [2021-08-27 14:35:46,612 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2021-08-27 14:35:46,612 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2021-08-27 14:35:46,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:46,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2021-08-27 14:35:47,027 INFO L294 LassoAnalysis]: Preprocessing complete. [2021-08-27 14:35:47,030 INFO L490 LassoAnalysis]: Using template 'affine'. [2021-08-27 14:35:47,031 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,033 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,037 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2021-08-27 14:35:47,037 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:35:47,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,047 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:35:47,047 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:35:47,058 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,078 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,079 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2021-08-27 14:35:47,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:35:47,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,092 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:35:47,092 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:35:47,108 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,125 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,125 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2021-08-27 14:35:47,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,141 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,141 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,159 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,175 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,175 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,176 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2021-08-27 14:35:47,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,188 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,188 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:35:47,188 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,188 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,188 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,189 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:35:47,189 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:35:47,197 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,217 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,227 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,234 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,234 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:35:47,235 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,235 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,235 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:35:47,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:35:47,238 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2021-08-27 14:35:47,248 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,267 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,268 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2021-08-27 14:35:47,270 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,277 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,279 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,279 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,296 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2021-08-27 14:35:47,313 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,314 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2021-08-27 14:35:47,317 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,323 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,326 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,326 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,333 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,350 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,351 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,352 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2021-08-27 14:35:47,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,363 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,363 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,364 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,364 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,371 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,371 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,391 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,392 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,393 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,393 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2021-08-27 14:35:47,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,403 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,403 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,413 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,429 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,430 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2021-08-27 14:35:47,432 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,439 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2021-08-27 14:35:47,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,440 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2021-08-27 14:35:47,440 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2021-08-27 14:35:47,441 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,456 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2021-08-27 14:35:47,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,470 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,470 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,481 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,497 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,497 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,502 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2021-08-27 14:35:47,504 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,510 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,511 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,511 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,511 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,517 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2021-08-27 14:35:47,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Ended with exit code 0 [2021-08-27 14:35:47,533 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,534 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2021-08-27 14:35:47,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2021-08-27 14:35:47,544 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2021-08-27 14:35:47,545 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2021-08-27 14:35:47,545 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2021-08-27 14:35:47,545 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2021-08-27 14:35:47,550 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2021-08-27 14:35:47,550 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2021-08-27 14:35:47,561 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2021-08-27 14:35:47,603 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2021-08-27 14:35:47,603 INFO L444 ModelExtractionUtils]: 0 out of 13 variables were initially zero. Simplification set additionally 10 variables to zero. [2021-08-27 14:35:47,604 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-08-27 14:35:47,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:47,635 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-08-27 14:35:47,668 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2021-08-27 14:35:47,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2021-08-27 14:35:47,685 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2021-08-27 14:35:47,685 INFO L513 LassoAnalysis]: Proved termination. [2021-08-27 14:35:47,685 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1) = -8*ULTIMATE.start_main_~i~0 + 199999*v_rep(select #length ULTIMATE.start_main_~#a~0.base)_1 Supporting invariants [] [2021-08-27 14:35:47,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2021-08-27 14:35:47,719 INFO L297 tatePredicateManager]: 7 out of 7 supporting invariants were superfluous and have been removed [2021-08-27 14:35:47,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:47,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2021-08-27 14:35:47,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:35:47,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:47,803 WARN L261 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 6 conjunts are in the unsatisfiable core [2021-08-27 14:35:47,803 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:35:47,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:35:47,871 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 [2021-08-27 14:35:47,872 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:47,905 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 15 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0). Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 29 states and 41 transitions. Complement of second has 8 states. [2021-08-27 14:35:47,906 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 [2021-08-27 14:35:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2021-08-27 14:35:47,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 2 letters. [2021-08-27 14:35:47,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:35:47,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 4 letters. Loop has 2 letters. [2021-08-27 14:35:47,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:35:47,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 2 letters. Loop has 4 letters. [2021-08-27 14:35:47,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2021-08-27 14:35:47,910 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 41 transitions. [2021-08-27 14:35:47,914 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:35:47,917 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 12 states and 16 transitions. [2021-08-27 14:35:47,918 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2021-08-27 14:35:47,918 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2021-08-27 14:35:47,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 16 transitions. [2021-08-27 14:35:47,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:35:47,919 INFO L681 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-27 14:35:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states and 16 transitions. [2021-08-27 14:35:47,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2021-08-27 14:35:47,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 11 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:47,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2021-08-27 14:35:47,934 INFO L704 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-27 14:35:47,934 INFO L587 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2021-08-27 14:35:47,934 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-08-27 14:35:47,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2021-08-27 14:35:47,936 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2021-08-27 14:35:47,936 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:47,936 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:47,936 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2021-08-27 14:35:47,936 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:35:47,937 INFO L791 eck$LassoCheckResult]: Stem: 114#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 115#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 121#L18-3 assume !(main_~i~0 < 100000); 119#L18-4 main_~i~0 := 0; 120#L22-3 [2021-08-27 14:35:47,937 INFO L793 eck$LassoCheckResult]: Loop: 120#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 116#L13 assume !(0 == __VERIFIER_assert_~cond); 113#L13-3 havoc main_#t~mem5; 122#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 123#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 120#L22-3 [2021-08-27 14:35:47,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:47,938 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2021-08-27 14:35:47,938 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:47,939 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317854749] [2021-08-27 14:35:47,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:47,939 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:47,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:35:47,989 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:35:47,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317854749] [2021-08-27 14:35:47,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317854749] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:35:47,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-27 14:35:47,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-27 14:35:47,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116494745] [2021-08-27 14:35:47,991 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:35:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 51750045, now seen corresponding path program 1 times [2021-08-27 14:35:47,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:47,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446579335] [2021-08-27 14:35:47,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:47,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:47,999 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:48,019 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:48,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:35:48,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-27 14:35:48,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-27 14:35:48,147 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:35:48,169 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2021-08-27 14:35:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-27 14:35:48,170 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2021-08-27 14:35:48,172 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:48,173 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 17 states and 19 transitions. [2021-08-27 14:35:48,173 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2021-08-27 14:35:48,173 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2021-08-27 14:35:48,174 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 19 transitions. [2021-08-27 14:35:48,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:35:48,174 INFO L681 BuchiCegarLoop]: Abstraction has 17 states and 19 transitions. [2021-08-27 14:35:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 19 transitions. [2021-08-27 14:35:48,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2021-08-27 14:35:48,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:48,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2021-08-27 14:35:48,178 INFO L704 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 14:35:48,178 INFO L587 BuchiCegarLoop]: Abstraction has 15 states and 17 transitions. [2021-08-27 14:35:48,178 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-08-27 14:35:48,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 17 transitions. [2021-08-27 14:35:48,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:48,179 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:48,179 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:48,181 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-27 14:35:48,181 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:35:48,183 INFO L791 eck$LassoCheckResult]: Stem: 149#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 150#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 155#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 153#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 154#L18-3 assume !(main_~i~0 < 100000); 156#L18-4 main_~i~0 := 0; 157#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 163#L13 assume !(0 == __VERIFIER_assert_~cond); 162#L13-3 havoc main_#t~mem5; 158#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 159#L22-2 [2021-08-27 14:35:48,184 INFO L793 eck$LassoCheckResult]: Loop: 159#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 161#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 151#L13 assume !(0 == __VERIFIER_assert_~cond); 152#L13-3 havoc main_#t~mem5; 160#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 159#L22-2 [2021-08-27 14:35:48,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:48,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1436006135, now seen corresponding path program 1 times [2021-08-27 14:35:48,185 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:48,187 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747040676] [2021-08-27 14:35:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:48,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:35:48,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:35:48,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747040676] [2021-08-27 14:35:48,228 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747040676] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:48,228 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585322043] [2021-08-27 14:35:48,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,228 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:35:48,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:48,229 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:35:48,232 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2021-08-27 14:35:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:48,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2021-08-27 14:35:48,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:35:48,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-27 14:35:48,320 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585322043] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:48,320 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:35:48,320 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2021-08-27 14:35:48,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056191510] [2021-08-27 14:35:48,321 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:35:48,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:48,321 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 2 times [2021-08-27 14:35:48,321 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:48,322 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709016475] [2021-08-27 14:35:48,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,322 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:48,339 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:48,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:48,351 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:48,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:35:48,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:35:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-27 14:35:48,460 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:35:48,493 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2021-08-27 14:35:48,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-27 14:35:48,494 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 26 transitions. [2021-08-27 14:35:48,494 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:48,495 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 26 transitions. [2021-08-27 14:35:48,495 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2021-08-27 14:35:48,495 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2021-08-27 14:35:48,495 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 26 transitions. [2021-08-27 14:35:48,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:35:48,495 INFO L681 BuchiCegarLoop]: Abstraction has 24 states and 26 transitions. [2021-08-27 14:35:48,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 26 transitions. [2021-08-27 14:35:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2021-08-27 14:35:48,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:48,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-08-27 14:35:48,497 INFO L704 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 14:35:48,497 INFO L587 BuchiCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-08-27 14:35:48,497 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-08-27 14:35:48,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 24 transitions. [2021-08-27 14:35:48,498 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:48,498 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:48,498 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:48,498 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2021-08-27 14:35:48,498 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:35:48,498 INFO L791 eck$LassoCheckResult]: Stem: 223#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 224#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 229#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 230#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 231#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 227#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 228#L18-3 assume !(main_~i~0 < 100000); 232#L18-4 main_~i~0 := 0; 233#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 244#L13 assume !(0 == __VERIFIER_assert_~cond); 243#L13-3 havoc main_#t~mem5; 242#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 237#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 236#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 225#L13 assume !(0 == __VERIFIER_assert_~cond); 226#L13-3 havoc main_#t~mem5; 234#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 235#L22-2 [2021-08-27 14:35:48,499 INFO L793 eck$LassoCheckResult]: Loop: 235#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 241#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 240#L13 assume !(0 == __VERIFIER_assert_~cond); 239#L13-3 havoc main_#t~mem5; 238#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 235#L22-2 [2021-08-27 14:35:48,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:48,499 INFO L82 PathProgramCache]: Analyzing trace with hash -974790727, now seen corresponding path program 1 times [2021-08-27 14:35:48,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:48,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768233176] [2021-08-27 14:35:48,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,499 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:48,533 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 14:35:48,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:35:48,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768233176] [2021-08-27 14:35:48,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768233176] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:48,534 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229724310] [2021-08-27 14:35:48,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,534 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:35:48,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:48,537 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:35:48,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-08-27 14:35:48,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:48,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 4 conjunts are in the unsatisfiable core [2021-08-27 14:35:48,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:35:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-08-27 14:35:48,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229724310] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:48,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:35:48,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2021-08-27 14:35:48,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733950414] [2021-08-27 14:35:48,630 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:35:48,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:48,630 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 3 times [2021-08-27 14:35:48,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:48,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225006560] [2021-08-27 14:35:48,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,631 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:48,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:48,635 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:48,639 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:48,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:35:48,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-27 14:35:48,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-27 14:35:48,764 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. cyclomatic complexity: 4 Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:35:48,810 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2021-08-27 14:35:48,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:35:48,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 33 transitions. [2021-08-27 14:35:48,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:48,813 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 33 transitions. [2021-08-27 14:35:48,813 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2021-08-27 14:35:48,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2021-08-27 14:35:48,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 33 transitions. [2021-08-27 14:35:48,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:35:48,814 INFO L681 BuchiCegarLoop]: Abstraction has 31 states and 33 transitions. [2021-08-27 14:35:48,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 33 transitions. [2021-08-27 14:35:48,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2021-08-27 14:35:48,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 28 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:48,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2021-08-27 14:35:48,820 INFO L704 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-08-27 14:35:48,820 INFO L587 BuchiCegarLoop]: Abstraction has 29 states and 31 transitions. [2021-08-27 14:35:48,820 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-08-27 14:35:48,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 31 transitions. [2021-08-27 14:35:48,821 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:48,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:48,821 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:48,822 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2021-08-27 14:35:48,823 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:35:48,823 INFO L791 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 336#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 339#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 340#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 341#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 337#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 338#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 350#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 349#L18-3 assume !(main_~i~0 < 100000); 342#L18-4 main_~i~0 := 0; 343#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 361#L13 assume !(0 == __VERIFIER_assert_~cond); 360#L13-3 havoc main_#t~mem5; 359#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 348#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 347#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 333#L13 assume !(0 == __VERIFIER_assert_~cond); 334#L13-3 havoc main_#t~mem5; 346#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 355#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 358#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 357#L13 assume !(0 == __VERIFIER_assert_~cond); 356#L13-3 havoc main_#t~mem5; 344#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 345#L22-2 [2021-08-27 14:35:48,823 INFO L793 eck$LassoCheckResult]: Loop: 345#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 354#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 353#L13 assume !(0 == __VERIFIER_assert_~cond); 352#L13-3 havoc main_#t~mem5; 351#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 345#L22-2 [2021-08-27 14:35:48,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:48,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1970397435, now seen corresponding path program 2 times [2021-08-27 14:35:48,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:48,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85968668] [2021-08-27 14:35:48,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:48,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-27 14:35:48,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:35:48,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85968668] [2021-08-27 14:35:48,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85968668] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:48,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498884425] [2021-08-27 14:35:48,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-08-27 14:35:48,889 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:35:48,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:48,900 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:35:48,916 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2021-08-27 14:35:48,969 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-08-27 14:35:48,969 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:35:48,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2021-08-27 14:35:48,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:35:49,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2021-08-27 14:35:49,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498884425] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:49,035 INFO L186 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-08-27 14:35:49,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2021-08-27 14:35:49,036 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807956047] [2021-08-27 14:35:49,037 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:35:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:49,037 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 4 times [2021-08-27 14:35:49,037 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:49,037 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246227021] [2021-08-27 14:35:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:49,038 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:49,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:49,044 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:49,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:49,055 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:49,176 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:35:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-27 14:35:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-08-27 14:35:49,177 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. cyclomatic complexity: 4 Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:49,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:35:49,215 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2021-08-27 14:35:49,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-27 14:35:49,216 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 38 states and 40 transitions. [2021-08-27 14:35:49,216 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:49,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 38 states to 38 states and 40 transitions. [2021-08-27 14:35:49,217 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2021-08-27 14:35:49,217 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 29 [2021-08-27 14:35:49,217 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 40 transitions. [2021-08-27 14:35:49,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:35:49,217 INFO L681 BuchiCegarLoop]: Abstraction has 38 states and 40 transitions. [2021-08-27 14:35:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 40 transitions. [2021-08-27 14:35:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2021-08-27 14:35:49,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2021-08-27 14:35:49,219 INFO L704 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-27 14:35:49,219 INFO L587 BuchiCegarLoop]: Abstraction has 36 states and 38 transitions. [2021-08-27 14:35:49,219 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-08-27 14:35:49,219 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 36 states and 38 transitions. [2021-08-27 14:35:49,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2021-08-27 14:35:49,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-08-27 14:35:49,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-08-27 14:35:49,220 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1] [2021-08-27 14:35:49,220 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2021-08-27 14:35:49,221 INFO L791 eck$LassoCheckResult]: Stem: 481#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(24); 482#L-1 havoc main_#res;havoc main_#t~post3, main_#t~mem5, main_#t~post4, main_~i~0, main_~#a~0.base, main_~#a~0.offset;havoc main_~i~0;call main_~#a~0.base, main_~#a~0.offset := #Ultimate.allocOnStack(400000);main_~i~0 := 0; 485#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 486#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 487#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 483#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 484#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 497#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 496#L18-3 assume !!(main_~i~0 < 100000);call write~int(10, main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4); 495#L18-2 main_#t~post3 := main_~i~0;main_~i~0 := 1 + main_#t~post3;havoc main_#t~post3; 494#L18-3 assume !(main_~i~0 < 100000); 488#L18-4 main_~i~0 := 0; 489#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 514#L13 assume !(0 == __VERIFIER_assert_~cond); 513#L13-3 havoc main_#t~mem5; 512#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 493#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 492#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 479#L13 assume !(0 == __VERIFIER_assert_~cond); 480#L13-3 havoc main_#t~mem5; 490#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 491#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 511#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 510#L13 assume !(0 == __VERIFIER_assert_~cond); 509#L13-3 havoc main_#t~mem5; 508#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 507#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 506#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 505#L13 assume !(0 == __VERIFIER_assert_~cond); 504#L13-3 havoc main_#t~mem5; 503#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 499#L22-2 [2021-08-27 14:35:49,221 INFO L793 eck$LassoCheckResult]: Loop: 499#L22-2 main_#t~post4 := main_~i~0;main_~i~0 := 1 + main_#t~post4;havoc main_#t~post4; 502#L22-3 assume !!(main_~i~0 < 100000);call main_#t~mem5 := read~int(main_~#a~0.base, main_~#a~0.offset + 4 * main_~i~0, 4);__VERIFIER_assert_#in~cond := (if 10 == main_#t~mem5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 501#L13 assume !(0 == __VERIFIER_assert_~cond); 500#L13-3 havoc main_#t~mem5; 498#L25 assume 15000 != 1 + main_~i~0;call write~int(20, main_~#a~0.base, main_~#a~0.offset + 4 * (1 + main_~i~0), 4); 499#L22-2 [2021-08-27 14:35:49,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:49,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1016089675, now seen corresponding path program 3 times [2021-08-27 14:35:49,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:49,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496281796] [2021-08-27 14:35:49,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:49,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:49,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-27 14:35:49,265 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2021-08-27 14:35:49,265 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-27 14:35:49,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496281796] [2021-08-27 14:35:49,266 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496281796] provided 0 perfect and 1 imperfect interpolant sequences [2021-08-27 14:35:49,266 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727691443] [2021-08-27 14:35:49,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-08-27 14:35:49,266 INFO L170 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-08-27 14:35:49,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-27 14:35:49,267 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-08-27 14:35:49,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2021-08-27 14:35:49,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-08-27 14:35:49,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-08-27 14:35:49,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjunts are in the unsatisfiable core [2021-08-27 14:35:49,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-08-27 14:35:49,411 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2021-08-27 14:35:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2021-08-27 14:35:49,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727691443] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-27 14:35:49,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-08-27 14:35:49,455 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2021-08-27 14:35:49,455 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201058459] [2021-08-27 14:35:49,455 INFO L796 eck$LassoCheckResult]: stem already infeasible [2021-08-27 14:35:49,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-27 14:35:49,455 INFO L82 PathProgramCache]: Analyzing trace with hash 66315825, now seen corresponding path program 5 times [2021-08-27 14:35:49,456 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-27 14:35:49,456 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222341067] [2021-08-27 14:35:49,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-27 14:35:49,457 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-27 14:35:49,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:49,463 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-27 14:35:49,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-27 14:35:49,474 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-27 14:35:49,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-27 14:35:49,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-27 14:35:49,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2021-08-27 14:35:49,585 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. cyclomatic complexity: 4 Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-27 14:35:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-27 14:35:49,613 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2021-08-27 14:35:49,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-27 14:35:49,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 19 transitions. [2021-08-27 14:35:49,613 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:35:49,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2021-08-27 14:35:49,613 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2021-08-27 14:35:49,613 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2021-08-27 14:35:49,613 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2021-08-27 14:35:49,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-08-27 14:35:49,613 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:35:49,613 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:35:49,614 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-27 14:35:49,614 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-08-27 14:35:49,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2021-08-27 14:35:49,614 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2021-08-27 14:35:49,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2021-08-27 14:35:49,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.08 02:35:49 BoogieIcfgContainer [2021-08-27 14:35:49,618 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2021-08-27 14:35:49,618 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-27 14:35:49,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-27 14:35:49,618 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-27 14:35:49,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.08 02:35:45" (3/4) ... [2021-08-27 14:35:49,620 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-08-27 14:35:49,620 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-27 14:35:49,621 INFO L168 Benchmark]: Toolchain (without parser) took 4421.43 ms. Allocated memory was 46.1 MB in the beginning and 100.7 MB in the end (delta: 54.5 MB). Free memory was 22.7 MB in the beginning and 68.8 MB in the end (delta: -46.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-27 14:35:49,621 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 46.1 MB. Free memory was 29.2 MB in the beginning and 29.2 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:35:49,621 INFO L168 Benchmark]: CACSL2BoogieTranslator took 183.73 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 40.4 MB in the end (delta: -17.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. [2021-08-27 14:35:49,622 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.43 ms. Allocated memory is still 56.6 MB. Free memory was 40.4 MB in the beginning and 39.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-27 14:35:49,622 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 37.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:35:49,622 INFO L168 Benchmark]: RCFGBuilder took 275.92 ms. Allocated memory is still 56.6 MB. Free memory was 37.8 MB in the beginning and 25.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:35:49,622 INFO L168 Benchmark]: BuchiAutomizer took 3875.11 ms. Allocated memory was 56.6 MB in the beginning and 100.7 MB in the end (delta: 44.0 MB). Free memory was 25.1 MB in the beginning and 68.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. [2021-08-27 14:35:49,623 INFO L168 Benchmark]: Witness Printer took 2.05 ms. Allocated memory is still 100.7 MB. Free memory is still 68.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-27 14:35:49,624 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 46.1 MB. Free memory was 29.2 MB in the beginning and 29.2 MB in the end (delta: 39.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 183.73 ms. Allocated memory was 46.1 MB in the beginning and 56.6 MB in the end (delta: 10.5 MB). Free memory was 22.5 MB in the beginning and 40.4 MB in the end (delta: -17.9 MB). Peak memory consumption was 5.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 43.43 ms. Allocated memory is still 56.6 MB. Free memory was 40.4 MB in the beginning and 39.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 32.55 ms. Allocated memory is still 56.6 MB. Free memory was 39.1 MB in the beginning and 37.8 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 275.92 ms. Allocated memory is still 56.6 MB. Free memory was 37.8 MB in the beginning and 25.3 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * BuchiAutomizer took 3875.11 ms. Allocated memory was 56.6 MB in the beginning and 100.7 MB in the end (delta: 44.0 MB). Free memory was 25.1 MB in the beginning and 68.8 MB in the end (delta: -43.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 16.1 GB. * Witness Printer took 2.05 ms. Allocated memory is still 100.7 MB. Free memory is still 68.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (5 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 199999 * unknown-#length-unknown[a] + -8 * i and consists of 5 locations. 5 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 3.3s. Construction of modules took 0.1s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 6. Minimization of nondet autom 0. Automata minimization 19.9ms AutomataMinimizationTime, 5 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 36 states and ocurred in iteration 5. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 42 SDtfs, 71 SDslu, 44 SDs, 0 SdLazy, 124 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 110.7ms Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU5 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital153 mio100 ax100 hnf100 lsp94 ukn56 mio100 lsp41 div100 bol100 ite100 ukn100 eq152 hnf92 smp100 dnf100 smp100 tf100 neg100 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 34ms 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: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2021-08-27 14:35:49,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:49,849 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2021-08-27 14:35:50,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:50,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2021-08-27 14:35:50,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...