./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/termination.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 17:01:01,399 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 17:01:01,483 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2024-10-13 17:01:01,490 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 17:01:01,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 17:01:01,527 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 17:01:01,527 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 17:01:01,528 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 17:01:01,528 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 17:01:01,529 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 17:01:01,530 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 17:01:01,531 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 17:01:01,531 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 17:01:01,532 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-10-13 17:01:01,532 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-10-13 17:01:01,535 INFO L153 SettingsManager]: * Use old map elimination=false [2024-10-13 17:01:01,535 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-10-13 17:01:01,535 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-10-13 17:01:01,536 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-10-13 17:01:01,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 17:01:01,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-10-13 17:01:01,540 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 17:01:01,541 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 17:01:01,541 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-10-13 17:01:01,541 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-10-13 17:01:01,541 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-10-13 17:01:01,541 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 17:01:01,542 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 17:01:01,542 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 17:01:01,542 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-10-13 17:01:01,542 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 17:01:01,542 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 17:01:01,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 17:01:01,543 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 17:01:01,543 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 17:01:01,543 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-10-13 17:01:01,544 INFO L153 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 041376d57652038a5d4ee57a004231861ab6efac51c30f8b6c72783e60a27529 [2024-10-13 17:01:01,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 17:01:01,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 17:01:01,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 17:01:01,858 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 17:01:01,859 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 17:01:01,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-10-13 17:01:03,296 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 17:01:03,313 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2024-10-13 17:01:03,585 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 17:01:03,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-memory-alloca/Urban-2013WST-Fig2-alloca-2.i [2024-10-13 17:01:03,598 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd67e7f2/330380cf4e29482eb7f83be38dee1863/FLAG99f63c2b6 [2024-10-13 17:01:03,910 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd67e7f2/330380cf4e29482eb7f83be38dee1863 [2024-10-13 17:01:03,912 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 17:01:03,913 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 17:01:03,915 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:03,915 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 17:01:03,920 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 17:01:03,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:03" (1/1) ... [2024-10-13 17:01:03,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20bb2abe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:03, skipping insertion in model container [2024-10-13 17:01:03,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:01:03" (1/1) ... [2024-10-13 17:01:03,966 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 17:01:04,250 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:04,262 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 17:01:04,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 17:01:04,324 INFO L204 MainTranslator]: Completed translation [2024-10-13 17:01:04,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04 WrapperNode [2024-10-13 17:01:04,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 17:01:04,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:04,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 17:01:04,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 17:01:04,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,351 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,367 INFO L138 Inliner]: procedures = 110, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2024-10-13 17:01:04,367 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 17:01:04,368 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 17:01:04,368 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 17:01:04,368 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 17:01:04,377 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,378 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,380 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,391 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [5, 4]. 56 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 5 writes are split as follows [3, 2]. [2024-10-13 17:01:04,391 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,395 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,398 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,399 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,400 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,402 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 17:01:04,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 17:01:04,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 17:01:04,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 17:01:04,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (1/1) ... [2024-10-13 17:01:04,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:04,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:04,441 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) [2024-10-13 17:01:04,443 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 [2024-10-13 17:01:04,498 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 17:01:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 17:01:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 17:01:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 17:01:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 17:01:04,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 17:01:04,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 17:01:04,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 17:01:04,634 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 17:01:04,636 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 17:01:04,755 INFO L? ?]: Removed 4 outVars from TransFormulas that were not future-live. [2024-10-13 17:01:04,756 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 17:01:04,767 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 17:01:04,767 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-13 17:01:04,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:04 BoogieIcfgContainer [2024-10-13 17:01:04,768 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 17:01:04,769 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-10-13 17:01:04,769 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-10-13 17:01:04,773 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-10-13 17:01:04,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:04,774 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.10 05:01:03" (1/3) ... [2024-10-13 17:01:04,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62dc4106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:04, skipping insertion in model container [2024-10-13 17:01:04,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:04,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:01:04" (2/3) ... [2024-10-13 17:01:04,775 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@62dc4106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.10 05:01:04, skipping insertion in model container [2024-10-13 17:01:04,775 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-10-13 17:01:04,775 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:04" (3/3) ... [2024-10-13 17:01:04,777 INFO L332 chiAutomizerObserver]: Analyzing ICFG Urban-2013WST-Fig2-alloca-2.i [2024-10-13 17:01:04,827 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-10-13 17:01:04,827 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-10-13 17:01:04,827 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-10-13 17:01:04,827 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-10-13 17:01:04,827 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-10-13 17:01:04,828 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-10-13 17:01:04,828 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-10-13 17:01:04,828 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-10-13 17:01:04,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2024-10-13 17:01:04,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:04,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:04,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:04,853 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:04,853 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:01:04,854 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-10-13 17:01:04,854 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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) [2024-10-13 17:01:04,855 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:04,855 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:04,855 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:04,855 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:04,855 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2024-10-13 17:01:04,861 INFO L745 eck$LassoCheckResult]: Stem: 6#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 3#L552-3true [2024-10-13 17:01:04,861 INFO L747 eck$LassoCheckResult]: Loop: 3#L552-3true call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 11#L552-1true assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 7#L554-3true assume !true; 10#L554-4true call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 3#L552-3true [2024-10-13 17:01:04,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:04,866 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-10-13 17:01:04,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:04,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696738360] [2024-10-13 17:01:04,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:04,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:04,992 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:05,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:05,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:05,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1144360, now seen corresponding path program 1 times [2024-10-13 17:01:05,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:05,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068976845] [2024-10-13 17:01:05,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:05,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:05,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:05,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068976845] [2024-10-13 17:01:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068976845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:05,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 17:01:05,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207721963] [2024-10-13 17:01:05,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:05,106 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:05,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:05,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 17:01:05,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 17:01:05,136 INFO L87 Difference]: Start difference. First operand has 11 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2024-10-13 17:01:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:05,142 INFO L93 Difference]: Finished difference Result 11 states and 12 transitions. [2024-10-13 17:01:05,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 11 states and 12 transitions. [2024-10-13 17:01:05,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:05,147 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 11 states to 7 states and 8 transitions. [2024-10-13 17:01:05,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-13 17:01:05,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-13 17:01:05,149 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 8 transitions. [2024-10-13 17:01:05,149 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:05,149 INFO L218 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-13 17:01:05,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states and 8 transitions. [2024-10-13 17:01:05,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2024-10-13 17:01:05,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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) [2024-10-13 17:01:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2024-10-13 17:01:05,172 INFO L240 hiAutomatonCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-13 17:01:05,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 17:01:05,178 INFO L425 stractBuchiCegarLoop]: Abstraction has 7 states and 8 transitions. [2024-10-13 17:01:05,178 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-10-13 17:01:05,179 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 7 states and 8 transitions. [2024-10-13 17:01:05,179 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2024-10-13 17:01:05,180 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:05,180 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:05,194 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:05,194 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2024-10-13 17:01:05,195 INFO L745 eck$LassoCheckResult]: Stem: 32#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 33#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 30#L552-3 [2024-10-13 17:01:05,195 INFO L747 eck$LassoCheckResult]: Loop: 30#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 31#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 34#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 35#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 36#L554-4 call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 30#L552-3 [2024-10-13 17:01:05,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:05,196 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2024-10-13 17:01:05,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:05,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711367511] [2024-10-13 17:01:05,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:05,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:05,225 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:05,243 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:05,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:05,244 INFO L85 PathProgramCache]: Analyzing trace with hash 35468273, now seen corresponding path program 1 times [2024-10-13 17:01:05,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:05,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657066716] [2024-10-13 17:01:05,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:05,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:05,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:05,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:05,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657066716] [2024-10-13 17:01:05,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657066716] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 17:01:05,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 17:01:05,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 17:01:05,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726308265] [2024-10-13 17:01:05,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 17:01:05,412 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:05,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:05,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 17:01:05,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 17:01:05,413 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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) [2024-10-13 17:01:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:05,456 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2024-10-13 17:01:05,456 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 9 states and 10 transitions. [2024-10-13 17:01:05,457 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:01:05,457 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 9 states to 9 states and 10 transitions. [2024-10-13 17:01:05,457 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2024-10-13 17:01:05,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2024-10-13 17:01:05,458 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 10 transitions. [2024-10-13 17:01:05,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:05,458 INFO L218 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-13 17:01:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 10 transitions. [2024-10-13 17:01:05,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-10-13 17:01:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 8 states have internal predecessors, (10), 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) [2024-10-13 17:01:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2024-10-13 17:01:05,459 INFO L240 hiAutomatonCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-13 17:01:05,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 17:01:05,461 INFO L425 stractBuchiCegarLoop]: Abstraction has 9 states and 10 transitions. [2024-10-13 17:01:05,461 INFO L332 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2024-10-13 17:01:05,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 10 transitions. [2024-10-13 17:01:05,461 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2024-10-13 17:01:05,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:05,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:05,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:05,462 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1] [2024-10-13 17:01:05,464 INFO L745 eck$LassoCheckResult]: Stem: 59#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 60#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 55#L552-3 [2024-10-13 17:01:05,464 INFO L747 eck$LassoCheckResult]: Loop: 55#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 56#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 57#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 58#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 61#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 63#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 62#L554-4 call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 55#L552-3 [2024-10-13 17:01:05,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:05,465 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2024-10-13 17:01:05,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:05,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701066059] [2024-10-13 17:01:05,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:05,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:05,494 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:05,504 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash -274676436, now seen corresponding path program 1 times [2024-10-13 17:01:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:05,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667198840] [2024-10-13 17:01:05,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:05,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:05,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:05,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667198840] [2024-10-13 17:01:05,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667198840] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:01:05,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2058726279] [2024-10-13 17:01:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:05,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:01:05,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:05,733 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:01:05,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 17:01:05,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:05,798 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:05,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:05,845 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-10-13 17:01:05,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 17:01:05,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 17:01:05,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:05,891 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:01:05,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:05,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2058726279] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:01:05,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:01:05,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 9 [2024-10-13 17:01:05,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994091052] [2024-10-13 17:01:05,948 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:01:05,948 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:05,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:05,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 17:01:05,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-10-13 17:01:05,951 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. cyclomatic complexity: 2 Second operand has 9 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 9 states have internal predecessors, (14), 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) [2024-10-13 17:01:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:06,019 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2024-10-13 17:01:06,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 16 transitions. [2024-10-13 17:01:06,021 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-13 17:01:06,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 16 transitions. [2024-10-13 17:01:06,022 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2024-10-13 17:01:06,022 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2024-10-13 17:01:06,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 16 transitions. [2024-10-13 17:01:06,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:06,023 INFO L218 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-13 17:01:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 16 transitions. [2024-10-13 17:01:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-10-13 17:01:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 14 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) [2024-10-13 17:01:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2024-10-13 17:01:06,026 INFO L240 hiAutomatonCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-13 17:01:06,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 17:01:06,027 INFO L425 stractBuchiCegarLoop]: Abstraction has 15 states and 16 transitions. [2024-10-13 17:01:06,027 INFO L332 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2024-10-13 17:01:06,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 15 states and 16 transitions. [2024-10-13 17:01:06,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2024-10-13 17:01:06,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:06,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:06,028 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:06,028 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [5, 4, 1, 1, 1, 1] [2024-10-13 17:01:06,029 INFO L745 eck$LassoCheckResult]: Stem: 137#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 138#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 133#L552-3 [2024-10-13 17:01:06,029 INFO L747 eck$LassoCheckResult]: Loop: 133#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 134#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 141#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 139#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 135#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 136#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 147#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 146#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 145#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 144#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 143#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 142#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 140#L554-4 call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 133#L552-3 [2024-10-13 17:01:06,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2024-10-13 17:01:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961031516] [2024-10-13 17:01:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,050 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,057 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,057 INFO L85 PathProgramCache]: Analyzing trace with hash 351922269, now seen corresponding path program 2 times [2024-10-13 17:01:06,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605311688] [2024-10-13 17:01:06,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:06,506 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:06,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 17:01:06,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605311688] [2024-10-13 17:01:06,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605311688] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 17:01:06,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541041521] [2024-10-13 17:01:06,507 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 17:01:06,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 17:01:06,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:06,510 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 17:01:06,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 17:01:06,580 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-13 17:01:06,581 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 17:01:06,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-13 17:01:06,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:06,591 INFO L378 Elim1Store]: Elim1 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 11 treesize of output 7 [2024-10-13 17:01:06,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 3 [2024-10-13 17:01:06,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-13 17:01:06,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-13 17:01:06,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 13 [2024-10-13 17:01:06,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-13 17:01:06,676 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:06,676 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 17:01:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541041521] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 17:01:06,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 17:01:06,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 8] total 17 [2024-10-13 17:01:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151982173] [2024-10-13 17:01:06,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 17:01:06,782 INFO L762 eck$LassoCheckResult]: loop already infeasible [2024-10-13 17:01:06,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 17:01:06,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-13 17:01:06,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=160, Unknown=0, NotChecked=0, Total=272 [2024-10-13 17:01:06,784 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. cyclomatic complexity: 2 Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 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) [2024-10-13 17:01:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 17:01:06,905 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2024-10-13 17:01:06,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 26 transitions. [2024-10-13 17:01:06,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-13 17:01:06,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 25 states and 26 transitions. [2024-10-13 17:01:06,906 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2024-10-13 17:01:06,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2024-10-13 17:01:06,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 26 transitions. [2024-10-13 17:01:06,907 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:06,907 INFO L218 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-13 17:01:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states and 26 transitions. [2024-10-13 17:01:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2024-10-13 17:01:06,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 1.04) internal successors, (26), 24 states have internal predecessors, (26), 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) [2024-10-13 17:01:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2024-10-13 17:01:06,913 INFO L240 hiAutomatonCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-13 17:01:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-13 17:01:06,915 INFO L425 stractBuchiCegarLoop]: Abstraction has 25 states and 26 transitions. [2024-10-13 17:01:06,915 INFO L332 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2024-10-13 17:01:06,915 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 26 transitions. [2024-10-13 17:01:06,916 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 23 [2024-10-13 17:01:06,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:06,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:06,918 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-10-13 17:01:06,919 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [10, 9, 1, 1, 1, 1] [2024-10-13 17:01:06,919 INFO L745 eck$LassoCheckResult]: Stem: 279#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 280#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 275#L552-3 [2024-10-13 17:01:06,919 INFO L747 eck$LassoCheckResult]: Loop: 275#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 276#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 283#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 281#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 277#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 278#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 299#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 298#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 297#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 296#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 295#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 294#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 293#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 292#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 291#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 290#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 289#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 288#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 287#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 286#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 285#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 284#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 282#L554-4 call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 275#L552-3 [2024-10-13 17:01:06,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,919 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2024-10-13 17:01:06,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709295996] [2024-10-13 17:01:06,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,939 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1943458812, now seen corresponding path program 3 times [2024-10-13 17:01:06,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5746137] [2024-10-13 17:01:06,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:06,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,962 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:06,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:06,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:06,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:06,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1979445758, now seen corresponding path program 1 times [2024-10-13 17:01:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168582693] [2024-10-13 17:01:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:06,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:07,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:07,001 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:07,029 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:09,166 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:09,167 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:09,167 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:09,167 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:09,167 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:09,167 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,167 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:09,167 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:09,167 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration5_Lasso [2024-10-13 17:01:09,168 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:09,168 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:09,185 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,192 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,195 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,199 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,201 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,204 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,205 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,207 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,448 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,451 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,453 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:09,706 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:09,710 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:09,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,713 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) [2024-10-13 17:01:09,714 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 [2024-10-13 17:01:09,715 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 [2024-10-13 17:01:09,729 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,729 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,730 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,730 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,730 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,736 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,752 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 [2024-10-13 17:01:09,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,755 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) [2024-10-13 17:01:09,756 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 [2024-10-13 17:01:09,757 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 [2024-10-13 17:01:09,769 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,769 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,771 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,771 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,772 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,787 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 [2024-10-13 17:01:09,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,787 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,789 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) [2024-10-13 17:01:09,794 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 [2024-10-13 17:01:09,794 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 [2024-10-13 17:01:09,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,806 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,809 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:09,809 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:09,817 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,832 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2024-10-13 17:01:09,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,834 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) [2024-10-13 17:01:09,857 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 [2024-10-13 17:01:09,858 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 [2024-10-13 17:01:09,875 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,875 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,875 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,875 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,875 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,876 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,876 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,877 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:09,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,890 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) [2024-10-13 17:01:09,892 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 [2024-10-13 17:01:09,894 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 [2024-10-13 17:01:09,903 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,904 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,904 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:09,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:09,910 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,924 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2024-10-13 17:01:09,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,926 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) [2024-10-13 17:01:09,928 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 [2024-10-13 17:01:09,929 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 [2024-10-13 17:01:09,939 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,940 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,940 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,940 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,940 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,942 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,952 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 [2024-10-13 17:01:09,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,954 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) [2024-10-13 17:01:09,955 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 [2024-10-13 17:01:09,956 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 [2024-10-13 17:01:09,965 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:09,966 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:09,966 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:09,966 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:09,966 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:09,966 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:09,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:09,968 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:09,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Ended with exit code 0 [2024-10-13 17:01:09,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:09,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:09,985 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) [2024-10-13 17:01:09,986 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 [2024-10-13 17:01:09,987 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 [2024-10-13 17:01:10,000 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,000 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,000 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,000 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,004 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:10,004 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:10,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:10,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2024-10-13 17:01:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,027 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) [2024-10-13 17:01:10,029 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 [2024-10-13 17:01:10,031 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 [2024-10-13 17:01:10,043 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,050 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:10,050 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:10,057 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:10,071 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2024-10-13 17:01:10,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,074 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) [2024-10-13 17:01:10,075 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 [2024-10-13 17:01:10,076 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 [2024-10-13 17:01:10,089 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,089 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,089 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,089 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,096 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:10,096 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:10,105 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:10,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:10,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,121 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) [2024-10-13 17:01:10,122 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 [2024-10-13 17:01:10,123 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 [2024-10-13 17:01:10,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:10,136 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:10,139 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:10,153 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:10,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,156 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) [2024-10-13 17:01:10,157 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 [2024-10-13 17:01:10,158 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 [2024-10-13 17:01:10,167 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,168 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,168 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,168 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,170 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:10,170 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:10,176 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:10,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2024-10-13 17:01:10,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,193 INFO L229 MonitoredProcess]: Starting monitored process 16 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) [2024-10-13 17:01:10,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2024-10-13 17:01:10,196 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 [2024-10-13 17:01:10,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:10,209 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:10,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:10,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:10,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:10,210 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:10,210 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:10,213 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:10,218 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2024-10-13 17:01:10,219 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2024-10-13 17:01:10,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:10,226 INFO L229 MonitoredProcess]: Starting monitored process 17 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) [2024-10-13 17:01:10,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2024-10-13 17:01:10,235 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:10,235 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2024-10-13 17:01:10,235 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:10,236 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1) = -2*v_rep(select (select #memory_int#1 ULTIMATE.start_main_~x1~0#1.base) ULTIMATE.start_main_~x1~0#1.offset)_1 + 21 Supporting invariants [] [2024-10-13 17:01:10,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:10,297 INFO L156 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2024-10-13 17:01:10,313 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#1 [2024-10-13 17:01:10,314 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] [2024-10-13 17:01:10,314 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x1~0!base,]]] [2024-10-13 17:01:10,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:10,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:10,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:10,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:10,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:10,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:10,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:10,530 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-10-13 17:01:10,533 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2024-10-13 17:01:10,535 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2 Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-13 17:01:10,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 26 transitions. cyclomatic complexity: 2. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 48 states and 51 transitions. Complement of second has 6 states. [2024-10-13 17:01:10,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:10,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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) [2024-10-13 17:01:10,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 8 transitions. [2024-10-13 17:01:10,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 23 letters. [2024-10-13 17:01:10,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:10,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 25 letters. Loop has 23 letters. [2024-10-13 17:01:10,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:10,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 8 transitions. Stem has 2 letters. Loop has 46 letters. [2024-10-13 17:01:10,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:10,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 51 transitions. [2024-10-13 17:01:10,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:01:10,593 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 47 states and 50 transitions. [2024-10-13 17:01:10,595 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2024-10-13 17:01:10,595 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2024-10-13 17:01:10,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 50 transitions. [2024-10-13 17:01:10,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:10,596 INFO L218 hiAutomatonCegarLoop]: Abstraction has 47 states and 50 transitions. [2024-10-13 17:01:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 50 transitions. [2024-10-13 17:01:10,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2024-10-13 17:01:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 1.103448275862069) internal successors, (32), 28 states have internal predecessors, (32), 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) [2024-10-13 17:01:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2024-10-13 17:01:10,599 INFO L240 hiAutomatonCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-13 17:01:10,599 INFO L425 stractBuchiCegarLoop]: Abstraction has 29 states and 32 transitions. [2024-10-13 17:01:10,599 INFO L332 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2024-10-13 17:01:10,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 32 transitions. [2024-10-13 17:01:10,600 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:01:10,600 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:10,600 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:10,601 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2024-10-13 17:01:10,601 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:01:10,601 INFO L745 eck$LassoCheckResult]: Stem: 498#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 499#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 490#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 492#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 494#L554-3 [2024-10-13 17:01:10,601 INFO L747 eck$LassoCheckResult]: Loop: 494#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 495#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 494#L554-3 [2024-10-13 17:01:10,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:10,602 INFO L85 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2024-10-13 17:01:10,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:10,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137679157] [2024-10-13 17:01:10,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:10,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,621 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:10,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,631 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:10,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:10,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 1 times [2024-10-13 17:01:10,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:10,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410929104] [2024-10-13 17:01:10,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:10,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,636 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:10,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,638 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:10,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:10,639 INFO L85 PathProgramCache]: Analyzing trace with hash 889571341, now seen corresponding path program 1 times [2024-10-13 17:01:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:10,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592996113] [2024-10-13 17:01:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:10,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,651 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:10,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:10,949 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:10,950 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:10,950 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:10,950 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:10,950 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:10,950 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:10,950 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:10,950 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:10,950 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration6_Lasso [2024-10-13 17:01:10,950 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:10,950 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:10,952 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,067 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,070 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,072 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,074 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,076 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,078 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,080 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,082 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,084 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,087 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,091 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:11,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2024-10-13 17:01:11,297 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:11,298 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:11,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,300 INFO L229 MonitoredProcess]: Starting monitored process 18 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) [2024-10-13 17:01:11,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2024-10-13 17:01:11,304 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 [2024-10-13 17:01:11,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,318 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,318 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,321 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:11,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,337 INFO L229 MonitoredProcess]: Starting monitored process 19 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) [2024-10-13 17:01:11,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2024-10-13 17:01:11,342 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 [2024-10-13 17:01:11,355 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,355 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,355 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,355 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,360 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,361 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,365 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2024-10-13 17:01:11,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,382 INFO L229 MonitoredProcess]: Starting monitored process 20 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) [2024-10-13 17:01:11,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2024-10-13 17:01:11,384 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 [2024-10-13 17:01:11,396 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,396 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,396 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,396 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,398 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,398 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,401 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:11,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2024-10-13 17:01:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,417 INFO L229 MonitoredProcess]: Starting monitored process 21 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) [2024-10-13 17:01:11,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2024-10-13 17:01:11,420 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 [2024-10-13 17:01:11,430 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:11,430 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:11,430 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:11,430 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:11,432 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:11,432 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:11,436 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:11,441 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2024-10-13 17:01:11,442 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2024-10-13 17:01:11,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:11,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:11,443 INFO L229 MonitoredProcess]: Starting monitored process 22 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) [2024-10-13 17:01:11,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2024-10-13 17:01:11,445 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:11,455 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:01:11,455 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:11,455 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_2 Supporting invariants [] [2024-10-13 17:01:11,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2024-10-13 17:01:11,480 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:01:11,481 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:01:11,481 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:01:11,481 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-10-13 17:01:11,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:11,512 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:11,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:11,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:11,523 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:11,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:11,537 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:01:11,538 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5 Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-13 17:01:11,558 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 32 transitions. cyclomatic complexity: 5. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 73 states and 79 transitions. Complement of second has 7 states. [2024-10-13 17:01:11,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:11,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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) [2024-10-13 17:01:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 17:01:11,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 2 letters. [2024-10-13 17:01:11,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:11,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 6 letters. Loop has 2 letters. [2024-10-13 17:01:11,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:11,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 4 letters. Loop has 4 letters. [2024-10-13 17:01:11,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:11,560 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 79 transitions. [2024-10-13 17:01:11,561 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:01:11,561 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 55 states and 59 transitions. [2024-10-13 17:01:11,561 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2024-10-13 17:01:11,562 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2024-10-13 17:01:11,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 59 transitions. [2024-10-13 17:01:11,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2024-10-13 17:01:11,562 INFO L218 hiAutomatonCegarLoop]: Abstraction has 55 states and 59 transitions. [2024-10-13 17:01:11,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 59 transitions. [2024-10-13 17:01:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 50. [2024-10-13 17:01:11,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.06) internal successors, (53), 49 states have internal predecessors, (53), 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) [2024-10-13 17:01:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2024-10-13 17:01:11,565 INFO L240 hiAutomatonCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-13 17:01:11,565 INFO L425 stractBuchiCegarLoop]: Abstraction has 50 states and 53 transitions. [2024-10-13 17:01:11,566 INFO L332 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2024-10-13 17:01:11,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 50 states and 53 transitions. [2024-10-13 17:01:11,566 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2024-10-13 17:01:11,566 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-10-13 17:01:11,566 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-10-13 17:01:11,567 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [10, 9, 2, 2, 1, 1, 1, 1] [2024-10-13 17:01:11,567 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1] [2024-10-13 17:01:11,567 INFO L745 eck$LassoCheckResult]: Stem: 666#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier; 667#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc2#1.base, main_#t~malloc2#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet4#1, main_#t~nondet5#1, main_#t~mem6#1, main_#t~mem7#1, main_#t~mem8#1, main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, main_~x2~0#1.base, main_~x2~0#1.offset;call main_#t~malloc2#1.base, main_#t~malloc2#1.offset := #Ultimate.allocOnStack(4);main_~x1~0#1.base, main_~x1~0#1.offset := main_#t~malloc2#1.base, main_#t~malloc2#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnStack(4);main_~x2~0#1.base, main_~x2~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~nondet4#1;call write~int#1(main_#t~nondet4#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;call write~int#0(main_#t~nondet5#1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~nondet5#1; 657#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 658#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 706#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 705#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 704#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 702#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 700#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 698#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 696#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 694#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 692#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 690#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 688#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 686#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 684#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 682#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 680#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 678#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 676#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 675#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 674#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 670#L554-1 assume !(main_#t~mem7#1 > 1);havoc main_#t~mem7#1; 669#L554-4 call main_#t~mem9#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4);call write~int#1(1 + main_#t~mem9#1, main_~x1~0#1.base, main_~x1~0#1.offset, 4);havoc main_#t~mem9#1; 659#L552-3 call main_#t~mem6#1 := read~int#1(main_~x1~0#1.base, main_~x1~0#1.offset, 4); 661#L552-1 assume !!(main_#t~mem6#1 <= 10);havoc main_#t~mem6#1;call write~int#0(10, main_~x2~0#1.base, main_~x2~0#1.offset, 4); 662#L554-3 [2024-10-13 17:01:11,568 INFO L747 eck$LassoCheckResult]: Loop: 662#L554-3 call main_#t~mem7#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4); 663#L554-1 assume !!(main_#t~mem7#1 > 1);havoc main_#t~mem7#1;call main_#t~mem8#1 := read~int#0(main_~x2~0#1.base, main_~x2~0#1.offset, 4);call write~int#0(main_#t~mem8#1 - 1, main_~x2~0#1.base, main_~x2~0#1.offset, 4);havoc main_#t~mem8#1; 662#L554-3 [2024-10-13 17:01:11,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,568 INFO L85 PathProgramCache]: Analyzing trace with hash 423138919, now seen corresponding path program 2 times [2024-10-13 17:01:11,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:11,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453355645] [2024-10-13 17:01:11,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,588 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,603 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:11,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1510, now seen corresponding path program 2 times [2024-10-13 17:01:11,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:11,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395030062] [2024-10-13 17:01:11,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:11,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:11,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,607 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:11,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,610 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:11,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash -1385391412, now seen corresponding path program 3 times [2024-10-13 17:01:11,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 17:01:11,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653725577] [2024-10-13 17:01:11,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 17:01:11,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 17:01:11,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,630 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 17:01:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 17:01:11,646 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 17:01:18,562 WARN L286 SmtUtils]: Spent 6.88s on a formula simplification. DAG size of input: 189 DAG size of output: 165 (called from [L 275] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2024-10-13 17:01:18,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2024-10-13 17:01:18,713 INFO L204 LassoAnalysis]: Preferences: [2024-10-13 17:01:18,713 INFO L125 ssoRankerPreferences]: Compute integeral hull: false [2024-10-13 17:01:18,713 INFO L126 ssoRankerPreferences]: Enable LassoPartitioneer: true [2024-10-13 17:01:18,713 INFO L127 ssoRankerPreferences]: Term annotations enabled: false [2024-10-13 17:01:18,713 INFO L128 ssoRankerPreferences]: Use exernal solver: false [2024-10-13 17:01:18,713 INFO L129 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:18,713 INFO L130 ssoRankerPreferences]: Dump SMT script to file: false [2024-10-13 17:01:18,713 INFO L131 ssoRankerPreferences]: Path of dumped script: [2024-10-13 17:01:18,713 INFO L132 ssoRankerPreferences]: Filename of dumped script: Urban-2013WST-Fig2-alloca-2.i_Iteration7_Lasso [2024-10-13 17:01:18,713 INFO L133 ssoRankerPreferences]: MapElimAlgo: Frank [2024-10-13 17:01:18,713 INFO L241 LassoAnalysis]: Starting lasso preprocessing... [2024-10-13 17:01:18,716 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,721 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,829 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,831 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,832 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,834 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,837 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,839 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,841 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,842 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,844 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,846 INFO L118 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2024-10-13 17:01:18,992 INFO L259 LassoAnalysis]: Preprocessing complete. [2024-10-13 17:01:18,992 INFO L451 LassoAnalysis]: Using template 'affine'. [2024-10-13 17:01:18,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:18,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:18,994 INFO L229 MonitoredProcess]: Starting monitored process 23 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) [2024-10-13 17:01:18,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2024-10-13 17:01:18,996 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 [2024-10-13 17:01:19,006 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:19,006 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2024-10-13 17:01:19,006 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:19,006 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:19,006 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:19,006 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2024-10-13 17:01:19,007 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2024-10-13 17:01:19,010 INFO L488 LassoAnalysis]: Proving termination failed for this template and these settings. [2024-10-13 17:01:19,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2024-10-13 17:01:19,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:19,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:19,024 INFO L229 MonitoredProcess]: Starting monitored process 24 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) [2024-10-13 17:01:19,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2024-10-13 17:01:19,026 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 [2024-10-13 17:01:19,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2024-10-13 17:01:19,036 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2024-10-13 17:01:19,036 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2024-10-13 17:01:19,036 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2024-10-13 17:01:19,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2024-10-13 17:01:19,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2024-10-13 17:01:19,042 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2024-10-13 17:01:19,048 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2024-10-13 17:01:19,048 INFO L444 ModelExtractionUtils]: 0 out of 7 variables were initially zero. Simplification set additionally 5 variables to zero. [2024-10-13 17:01:19,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-10-13 17:01:19,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 17:01:19,051 INFO L229 MonitoredProcess]: Starting monitored process 25 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) [2024-10-13 17:01:19,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2024-10-13 17:01:19,053 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2024-10-13 17:01:19,071 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2024-10-13 17:01:19,071 INFO L474 LassoAnalysis]: Proved termination. [2024-10-13 17:01:19,071 INFO L476 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3) = 1*v_rep(select (select #memory_int#0 ULTIMATE.start_main_~x2~0#1.base) ULTIMATE.start_main_~x2~0#1.offset)_3 Supporting invariants [] [2024-10-13 17:01:19,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:19,098 INFO L156 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2024-10-13 17:01:19,099 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Unknown variable: #memory_int#0 [2024-10-13 17:01:19,099 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] [2024-10-13 17:01:19,099 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] [2024-10-13 17:01:19,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:19,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:19,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:19,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:19,189 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:19,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:19,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:19,203 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:01:19,203 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 17:01:19,222 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 68 states and 73 transitions. Complement of second has 7 states. [2024-10-13 17:01:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:19,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 17:01:19,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 17:01:19,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-13 17:01:19,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:19,224 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:19,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:19,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:19,277 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:19,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:19,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:19,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:19,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:19,327 INFO L141 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:01:19,327 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 17:01:19,344 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 68 states and 73 transitions. Complement of second has 7 states. [2024-10-13 17:01:19,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:19,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 17:01:19,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2024-10-13 17:01:19,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 9 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-13 17:01:19,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:19,345 INFO L682 stractBuchiCegarLoop]: Bad chosen interpolant automaton: word not accepted [2024-10-13 17:01:19,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 17:01:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:19,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-13 17:01:19,394 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 17:01:19,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-13 17:01:19,428 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 17:01:19,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 17:01:19,441 INFO L141 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2024-10-13 17:01:19,441 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6 Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 17:01:19,460 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 50 states and 53 transitions. cyclomatic complexity: 6. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 76 states and 82 transitions. Complement of second has 6 states. [2024-10-13 17:01:19,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2024-10-13 17:01:19,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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) [2024-10-13 17:01:19,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2024-10-13 17:01:19,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 2 letters. [2024-10-13 17:01:19,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:19,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 29 letters. Loop has 2 letters. [2024-10-13 17:01:19,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:19,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 27 letters. Loop has 4 letters. [2024-10-13 17:01:19,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2024-10-13 17:01:19,462 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 82 transitions. [2024-10-13 17:01:19,464 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:01:19,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2024-10-13 17:01:19,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2024-10-13 17:01:19,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2024-10-13 17:01:19,464 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2024-10-13 17:01:19,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-10-13 17:01:19,464 INFO L218 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:19,464 INFO L240 hiAutomatonCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:19,464 INFO L425 stractBuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-13 17:01:19,465 INFO L332 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2024-10-13 17:01:19,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2024-10-13 17:01:19,465 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2024-10-13 17:01:19,465 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2024-10-13 17:01:19,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.10 05:01:19 BoogieIcfgContainer [2024-10-13 17:01:19,474 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-10-13 17:01:19,475 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 17:01:19,475 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 17:01:19,475 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 17:01:19,476 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:01:04" (3/4) ... [2024-10-13 17:01:19,477 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 17:01:19,478 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 17:01:19,479 INFO L158 Benchmark]: Toolchain (without parser) took 15565.48ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 137.0MB in the beginning and 87.7MB in the end (delta: 49.3MB). Peak memory consumption was 87.6MB. Max. memory is 16.1GB. [2024-10-13 17:01:19,479 INFO L158 Benchmark]: CDTParser took 0.44ms. Allocated memory is still 115.3MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:19,479 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.66ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 119.2MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-13 17:01:19,480 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.25ms. Allocated memory is still 169.9MB. Free memory was 119.2MB in the beginning and 117.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:19,480 INFO L158 Benchmark]: Boogie Preprocessor took 34.16ms. Allocated memory is still 169.9MB. Free memory was 117.2MB in the beginning and 115.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:19,480 INFO L158 Benchmark]: RCFGBuilder took 365.55ms. Allocated memory is still 169.9MB. Free memory was 115.6MB in the beginning and 104.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 17:01:19,480 INFO L158 Benchmark]: BuchiAutomizer took 14704.57ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 104.1MB in the beginning and 87.7MB in the end (delta: 16.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. [2024-10-13 17:01:19,480 INFO L158 Benchmark]: Witness Printer took 3.70ms. Allocated memory is still 205.5MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 17:01:19,482 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44ms. Allocated memory is still 115.3MB. Free memory is still 89.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.66ms. Allocated memory is still 169.9MB. Free memory was 136.5MB in the beginning and 119.2MB in the end (delta: 17.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.25ms. Allocated memory is still 169.9MB. Free memory was 119.2MB in the beginning and 117.2MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.16ms. Allocated memory is still 169.9MB. Free memory was 117.2MB in the beginning and 115.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 365.55ms. Allocated memory is still 169.9MB. Free memory was 115.6MB in the beginning and 104.1MB in the end (delta: 11.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 14704.57ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 104.1MB in the beginning and 87.7MB in the end (delta: 16.4MB). Peak memory consumption was 54.1MB. Max. memory is 16.1GB. * Witness Printer took 3.70ms. Allocated memory is still 205.5MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#1 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#1,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#1,GLOBAL],[IdentifierExpression[~x1~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Unknown variable: #memory_int#0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array IdentifierExpression[#memory_int#0,GLOBAL] - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Cannot backtranslate array access to array ArrayAccessExpression[IdentifierExpression[#memory_int#0,GLOBAL],[IdentifierExpression[~x2~0!base,]]] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (4 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function null and consists of 4 locations. One deterministic module has affine ranking function null and consists of 4 locations. One nondeterministic module has affine ranking function null and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 14.6s and 8 iterations. TraceHistogramMax:10. Analysis of lassos took 13.5s. Construction of modules took 0.1s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 90/90 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 61 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 56 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 60 mSDsCounter, 18 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 102 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18 mSolverCounterUnsat, 63 mSDtfsCounter, 102 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital149 mio100 ax112 hnf100 lsp87 ukn62 mio100 lsp26 div100 bol100 ite100 ukn100 eq163 hnf89 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 30ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2024-10-13 17:01:19,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:19,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:19,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-13 17:01:20,107 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE