./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/psyco/psyco_abp_1-3.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/psyco/psyco_abp_1-3.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 15:44:36,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 15:44:36,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2024-11-09 15:44:36,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 15:44:36,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 15:44:36,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 15:44:36,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 15:44:36,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 15:44:36,915 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 15:44:36,916 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 15:44:36,917 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 15:44:36,918 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 15:44:36,918 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 15:44:36,918 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2024-11-09 15:44:36,919 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2024-11-09 15:44:36,920 INFO L153 SettingsManager]: * Use old map elimination=false [2024-11-09 15:44:36,920 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2024-11-09 15:44:36,920 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2024-11-09 15:44:36,920 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2024-11-09 15:44:36,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 15:44:36,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2024-11-09 15:44:36,923 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 15:44:36,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 15:44:36,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 15:44:36,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 15:44:36,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2024-11-09 15:44:36,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2024-11-09 15:44:36,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2024-11-09 15:44:36,925 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 15:44:36,925 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 15:44:36,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 15:44:36,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 15:44:36,926 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2024-11-09 15:44:36,926 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 15:44:36,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 15:44:36,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 15:44:36,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 15:44:36,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 15:44:36,927 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2024-11-09 15:44:36,927 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 041b6fdf6940cdc60d0f8513696cf56c45d5af72c3bd8ce1d60d3ac14fc6f3dc [2024-11-09 15:44:37,118 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 15:44:37,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 15:44:37,143 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 15:44:37,144 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 15:44:37,146 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 15:44:37,147 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_abp_1-3.c [2024-11-09 15:44:38,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 15:44:38,556 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 15:44:38,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_abp_1-3.c [2024-11-09 15:44:38,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41df49a48/d3d582c159e84a2a8bd93d3f5ee84964/FLAGfb8cf9614 [2024-11-09 15:44:38,583 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41df49a48/d3d582c159e84a2a8bd93d3f5ee84964 [2024-11-09 15:44:38,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 15:44:38,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 15:44:38,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 15:44:38,589 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 15:44:38,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 15:44:38,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b7c92b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38, skipping insertion in model container [2024-11-09 15:44:38,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 15:44:38,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:44:38,859 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 15:44:38,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 15:44:38,910 INFO L204 MainTranslator]: Completed translation [2024-11-09 15:44:38,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38 WrapperNode [2024-11-09 15:44:38,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 15:44:38,911 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 15:44:38,912 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 15:44:38,912 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 15:44:38,916 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,957 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 416 [2024-11-09 15:44:38,958 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 15:44:38,958 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 15:44:38,959 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 15:44:38,959 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 15:44:38,969 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,969 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,972 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,982 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-09 15:44:38,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,983 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,993 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,997 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:38,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:39,001 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:39,008 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 15:44:39,008 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 15:44:39,012 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 15:44:39,012 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 15:44:39,013 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (1/1) ... [2024-11-09 15:44:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2024-11-09 15:44:39,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 15:44:39,041 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-11-09 15:44:39,042 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-11-09 15:44:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 15:44:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 15:44:39,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 15:44:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 15:44:39,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 15:44:39,193 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 15:44:39,658 INFO L? ?]: Removed 271 outVars from TransFormulas that were not future-live. [2024-11-09 15:44:39,659 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 15:44:39,670 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 15:44:39,671 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 15:44:39,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:44:39 BoogieIcfgContainer [2024-11-09 15:44:39,672 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 15:44:39,673 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2024-11-09 15:44:39,673 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2024-11-09 15:44:39,675 INFO L274 PluginConnector]: BuchiAutomizer initialized [2024-11-09 15:44:39,676 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:44:39,676 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.11 03:44:38" (1/3) ... [2024-11-09 15:44:39,677 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a36b7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:44:39, skipping insertion in model container [2024-11-09 15:44:39,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:44:39,677 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 03:44:38" (2/3) ... [2024-11-09 15:44:39,677 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2a36b7e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.11 03:44:39, skipping insertion in model container [2024-11-09 15:44:39,677 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2024-11-09 15:44:39,678 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:44:39" (3/3) ... [2024-11-09 15:44:39,678 INFO L332 chiAutomizerObserver]: Analyzing ICFG psyco_abp_1-3.c [2024-11-09 15:44:39,723 INFO L300 stractBuchiCegarLoop]: Interprodecural is true [2024-11-09 15:44:39,723 INFO L301 stractBuchiCegarLoop]: Hoare is None [2024-11-09 15:44:39,724 INFO L302 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2024-11-09 15:44:39,724 INFO L303 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2024-11-09 15:44:39,724 INFO L304 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2024-11-09 15:44:39,724 INFO L305 stractBuchiCegarLoop]: Difference is false [2024-11-09 15:44:39,725 INFO L306 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2024-11-09 15:44:39,725 INFO L310 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2024-11-09 15:44:39,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 108 states have internal predecessors, (209), 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-11-09 15:44:39,746 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2024-11-09 15:44:39,746 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:44:39,746 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:44:39,752 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:44:39,752 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:44:39,752 INFO L332 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2024-11-09 15:44:39,753 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 109 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 108 states have internal predecessors, (209), 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-11-09 15:44:39,757 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 75 [2024-11-09 15:44:39,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:44:39,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:44:39,757 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2024-11-09 15:44:39,757 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 15:44:39,763 INFO L745 eck$LassoCheckResult]: Stem: 28#$Ultimate##0true assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; 33#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; 45#L26-2true [2024-11-09 15:44:39,763 INFO L747 eck$LassoCheckResult]: Loop: 45#L26-2true goto; 4#L544-2true assume !false;havoc main_#t~nondet4#1;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 21#L41true assume !(0 == main_~q~0#1); 53#L61true assume !(1 == main_~q~0#1); 13#L161true assume !(2 == main_~q~0#1); 110#L261true assume !(3 == main_~q~0#1); 57#L361true assume !(4 == main_~q~0#1); 5#L461true assume !(5 == main_~q~0#1);havoc main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1; 45#L26-2true [2024-11-09 15:44:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:44:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2024-11-09 15:44:39,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:44:39,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254638046] [2024-11-09 15:44:39,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:44:39,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:44:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:39,834 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:44:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:39,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:44:39,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:44:39,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2021581594, now seen corresponding path program 1 times [2024-11-09 15:44:39,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:44:39,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505508029] [2024-11-09 15:44:39,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:44:39,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:44:39,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:39,859 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:44:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:39,864 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:44:39,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:44:39,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1331020120, now seen corresponding path program 1 times [2024-11-09 15:44:39,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:44:39,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723208053] [2024-11-09 15:44:39,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:44:39,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:44:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 15:44:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 15:44:39,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 15:44:39,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723208053] [2024-11-09 15:44:39,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723208053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 15:44:39,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 15:44:39,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 15:44:39,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435557956] [2024-11-09 15:44:39,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 15:44:39,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 15:44:40,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 15:44:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 15:44:40,015 INFO L87 Difference]: Start difference. First operand has 109 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 108 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 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-11-09 15:44:40,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 15:44:40,065 INFO L93 Difference]: Finished difference Result 111 states and 201 transitions. [2024-11-09 15:44:40,067 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 201 transitions. [2024-11-09 15:44:40,071 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-09 15:44:40,074 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 80 states and 121 transitions. [2024-11-09 15:44:40,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 80 [2024-11-09 15:44:40,079 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 80 [2024-11-09 15:44:40,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 121 transitions. [2024-11-09 15:44:40,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2024-11-09 15:44:40,080 INFO L218 hiAutomatonCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-09 15:44:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 121 transitions. [2024-11-09 15:44:40,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2024-11-09 15:44:40,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 80 states have (on average 1.5125) internal successors, (121), 79 states have internal predecessors, (121), 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-11-09 15:44:40,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 121 transitions. [2024-11-09 15:44:40,107 INFO L240 hiAutomatonCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-09 15:44:40,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 15:44:40,110 INFO L425 stractBuchiCegarLoop]: Abstraction has 80 states and 121 transitions. [2024-11-09 15:44:40,110 INFO L332 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2024-11-09 15:44:40,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 121 transitions. [2024-11-09 15:44:40,111 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2024-11-09 15:44:40,111 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2024-11-09 15:44:40,111 INFO L119 BuchiIsEmpty]: Starting construction of run [2024-11-09 15:44:40,112 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2024-11-09 15:44:40,112 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2024-11-09 15:44:40,112 INFO L745 eck$LassoCheckResult]: Stem: 296#$Ultimate##0 assume { :begin_inline_ULTIMATE.init } true;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int#0(48, 1, 0, 1);call write~init~int#0(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3);~m_Protocol~0 := 1;~m_msg_2~0 := 2;~m_recv_ack_2~0 := 3;~m_msg_1_1~0 := 4;~m_msg_1_2~0 := 5;~m_recv_ack_1_1~0 := 6;~m_recv_ack_1_2~0 := 7; 297#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~P5~0#1, main_~P6~0#1, main_~P7~0#1, main_~P8~0#1, main_~P9~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_expect~0#1, main_~this_buffer_empty~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_expect~0#1 := 0;main_~this_buffer_empty~0#1 := 0; 300#L26-2 goto; 236#L544-2 [2024-11-09 15:44:40,112 INFO L747 eck$LassoCheckResult]: Loop: 236#L544-2 assume !false;havoc main_#t~nondet4#1;main_~P1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_#t~nondet5#1;main_~P2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_#t~nondet6#1;main_~P3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_#t~nondet7#1;main_~P4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_#t~nondet8#1;main_~P5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_#t~nondet9#1;main_~P6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_#t~nondet10#1;main_~P7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_#t~nondet11#1;main_~P8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_#t~nondet12#1;main_~P9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1; 237#L41 assume 0 == main_~q~0#1;havoc main_#t~nondet13#1; 282#L42 assume !(0 != main_#t~nondet13#1);havoc main_#t~nondet13#1; 236#L544-2 [2024-11-09 15:44:40,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:44:40,113 INFO L85 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2024-11-09 15:44:40,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:44:40,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804211200] [2024-11-09 15:44:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:44:40,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:44:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,122 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:44:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,132 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:44:40,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:44:40,133 INFO L85 PathProgramCache]: Analyzing trace with hash 40826, now seen corresponding path program 1 times [2024-11-09 15:44:40,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:44:40,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485171433] [2024-11-09 15:44:40,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:44:40,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:44:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:44:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,138 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:44:40,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 15:44:40,138 INFO L85 PathProgramCache]: Analyzing trace with hash 889540504, now seen corresponding path program 1 times [2024-11-09 15:44:40,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 15:44:40,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502764050] [2024-11-09 15:44:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 15:44:40,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 15:44:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,170 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:44:40,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,188 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 15:44:40,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,388 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 15:44:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 15:44:40,432 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.11 03:44:40 BoogieIcfgContainer [2024-11-09 15:44:40,433 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2024-11-09 15:44:40,433 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 15:44:40,433 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 15:44:40,433 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 15:44:40,434 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 03:44:39" (3/4) ... [2024-11-09 15:44:40,435 INFO L139 WitnessPrinter]: Generating witness for non-termination counterexample [2024-11-09 15:44:40,471 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 15:44:40,474 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 15:44:40,474 INFO L158 Benchmark]: Toolchain (without parser) took 1886.72ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 90.5MB in the beginning and 159.3MB in the end (delta: -68.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:44:40,474 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 163.6MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:44:40,475 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.25ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 69.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 15:44:40,475 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.43ms. Allocated memory is still 163.6MB. Free memory was 69.0MB in the beginning and 64.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:44:40,475 INFO L158 Benchmark]: Boogie Preprocessor took 49.63ms. Allocated memory is still 163.6MB. Free memory was 64.5MB in the beginning and 61.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 15:44:40,475 INFO L158 Benchmark]: RCFGBuilder took 663.52ms. Allocated memory is still 163.6MB. Free memory was 60.8MB in the beginning and 89.1MB in the end (delta: -28.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 15:44:40,476 INFO L158 Benchmark]: BuchiAutomizer took 760.10ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 88.4MB in the beginning and 161.4MB in the end (delta: -73.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 15:44:40,476 INFO L158 Benchmark]: Witness Printer took 40.63ms. Allocated memory is still 220.2MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 15:44:40,477 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.17ms. Allocated memory is still 163.6MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.25ms. Allocated memory is still 163.6MB. Free memory was 90.5MB in the beginning and 69.0MB in the end (delta: 21.5MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.43ms. Allocated memory is still 163.6MB. Free memory was 69.0MB in the beginning and 64.5MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.63ms. Allocated memory is still 163.6MB. Free memory was 64.5MB in the beginning and 61.1MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 663.52ms. Allocated memory is still 163.6MB. Free memory was 60.8MB in the beginning and 89.1MB in the end (delta: -28.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 760.10ms. Allocated memory was 163.6MB in the beginning and 220.2MB in the end (delta: 56.6MB). Free memory was 88.4MB in the beginning and 161.4MB in the end (delta: -73.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 40.63ms. Allocated memory is still 220.2MB. Free memory was 161.4MB in the beginning and 159.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (1 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.1 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 80 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.7s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.1s. Highest rank in rank-based complementation 0. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 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 [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4 mSDsluCounter, 373 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 176 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 197 mSDtfsCounter, 18 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 26]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] unsigned int this_expect = 0; [L23] unsigned int this_buffer_empty = 0; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] Loop: [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L41] COND TRUE q == 0 [L42] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 26]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int m_Protocol = 1; [L8] int m_msg_2 = 2; [L9] int m_recv_ack_2 = 3; [L10] int m_msg_1_1 = 4; [L11] int m_msg_1_2 = 5; [L12] int m_recv_ack_1_1 = 6; [L13] int m_recv_ack_1_2 = 7; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3] [L18] int q = 0; [L19] int method_id; [L22] unsigned int this_expect = 0; [L23] unsigned int this_buffer_empty = 0; VAL [m_Protocol=1, m_msg_1_1=4, m_msg_1_2=5, m_msg_2=2, m_recv_ack_1_1=6, m_recv_ack_1_2=7, m_recv_ack_2=3, q=0, this_buffer_empty=0, this_expect=0] Loop: [L26] COND TRUE 1 [L29] int P1=__VERIFIER_nondet_int(); [L30] int P2=__VERIFIER_nondet_int(); [L31] int P3=__VERIFIER_nondet_int(); [L32] int P4=__VERIFIER_nondet_int(); [L33] int P5=__VERIFIER_nondet_int(); [L34] int P6=__VERIFIER_nondet_int(); [L35] int P7=__VERIFIER_nondet_int(); [L36] int P8=__VERIFIER_nondet_int(); [L37] int P9=__VERIFIER_nondet_int(); [L41] COND TRUE q == 0 [L42] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2024-11-09 15:44:40,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)