./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/psyco/psyco_io_1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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_io_1.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 4f9f01bde8fda2c75630f127009f2a9b60883250862a9d96b52c34a46b69c1e5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:58:20,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:58:20,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2025-03-04 15:58:20,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:58:20,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:58:20,750 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder.Remove goto edges from RCFG [2025-03-04 15:58:20,771 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:58:20,772 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:58:20,773 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:58:20,773 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:58:20,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:58:20,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:58:20,774 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:58:20,774 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:58:20,774 INFO L151 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Use old map elimination=false [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Use external solver (rank synthesis)=false [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Use only trivial implications for array writes=true [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2025-03-04 15:58:20,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2025-03-04 15:58:20,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * Assume nondeterminstic values are in range=false [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:58:20,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:58:20,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:58:20,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:58:20,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:58:20,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:58:20,777 INFO L151 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2025-03-04 15:58:20,777 INFO L153 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 4f9f01bde8fda2c75630f127009f2a9b60883250862a9d96b52c34a46b69c1e5 [2025-03-04 15:58:20,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:58:20,986 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:58:20,988 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:58:20,989 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:58:20,989 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:58:20,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/psyco/psyco_io_1.c [2025-03-04 15:58:22,106 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec07c9139/643493ff9cf642e3ab2a013cce5f5b1a/FLAG8e8625757 [2025-03-04 15:58:22,361 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:58:22,362 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/psyco/psyco_io_1.c [2025-03-04 15:58:22,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec07c9139/643493ff9cf642e3ab2a013cce5f5b1a/FLAG8e8625757 [2025-03-04 15:58:22,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ec07c9139/643493ff9cf642e3ab2a013cce5f5b1a [2025-03-04 15:58:22,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:58:22,676 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:58:22,677 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:58:22,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:58:22,681 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:58:22,682 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,683 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35e20786 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22, skipping insertion in model container [2025-03-04 15:58:22,683 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,700 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:58:22,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:58:22,841 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:58:22,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:58:22,878 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:58:22,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22 WrapperNode [2025-03-04 15:58:22,878 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:58:22,879 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:58:22,879 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:58:22,879 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:58:22,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,887 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,901 INFO L138 Inliner]: procedures = 12, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 257 [2025-03-04 15:58:22,902 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:58:22,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:58:22,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:58:22,903 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:58:22,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,921 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]. [2025-03-04 15:58:22,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,924 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,925 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,926 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,927 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:58:22,928 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:58:22,928 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:58:22,928 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:58:22,929 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (1/1) ... [2025-03-04 15:58:22,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2025-03-04 15:58:22,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:58:22,953 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) [2025-03-04 15:58:22,955 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 [2025-03-04 15:58:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:58:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:58:22,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:58:22,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:58:23,023 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:58:23,025 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:58:23,246 INFO L? ?]: Removed 63 outVars from TransFormulas that were not future-live. [2025-03-04 15:58:23,247 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:58:23,254 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:58:23,254 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:58:23,254 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:23 BoogieIcfgContainer [2025-03-04 15:58:23,254 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:58:23,256 INFO L112 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2025-03-04 15:58:23,256 INFO L270 PluginConnector]: Initializing BuchiAutomizer... [2025-03-04 15:58:23,260 INFO L274 PluginConnector]: BuchiAutomizer initialized [2025-03-04 15:58:23,260 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:58:23,260 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 04.03 03:58:22" (1/3) ... [2025-03-04 15:58:23,261 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f83d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:58:23, skipping insertion in model container [2025-03-04 15:58:23,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:58:23,261 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:58:22" (2/3) ... [2025-03-04 15:58:23,261 INFO L204 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66f83d54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 04.03 03:58:23, skipping insertion in model container [2025-03-04 15:58:23,261 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2025-03-04 15:58:23,262 INFO L184 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:23" (3/3) ... [2025-03-04 15:58:23,262 INFO L363 chiAutomizerObserver]: Analyzing ICFG psyco_io_1.c [2025-03-04 15:58:23,293 INFO L306 stractBuchiCegarLoop]: Interprodecural is true [2025-03-04 15:58:23,293 INFO L307 stractBuchiCegarLoop]: Hoare is None [2025-03-04 15:58:23,294 INFO L308 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2025-03-04 15:58:23,294 INFO L309 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2025-03-04 15:58:23,294 INFO L310 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2025-03-04 15:58:23,294 INFO L311 stractBuchiCegarLoop]: Difference is false [2025-03-04 15:58:23,294 INFO L312 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2025-03-04 15:58:23,294 INFO L316 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2025-03-04 15:58:23,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 67 states have internal predecessors, (126), 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) [2025-03-04 15:58:23,310 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2025-03-04 15:58:23,310 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:58:23,310 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:58:23,314 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:58:23,314 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:58:23,314 INFO L338 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2025-03-04 15:58:23,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 68 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 67 states have internal predecessors, (126), 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) [2025-03-04 15:58:23,316 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 53 [2025-03-04 15:58:23,316 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:58:23,317 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:58:23,317 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2025-03-04 15:58:23,317 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:58:23,321 INFO L752 eck$LassoCheckResult]: Stem: "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(13, 2);call #Ultimate.allocInit(12, 3);~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6;" "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_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_sink~0#1, main_~this_sinkConnected~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_sink~0#1 := 0;main_~this_sinkConnected~0#1 := 0;" [2025-03-04 15:58:23,321 INFO L754 eck$LassoCheckResult]: Loop: "assume true;" "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;" "assume !(0 == main_~q~0#1);" "assume !(1 == main_~q~0#1);" "assume !(2 == main_~q~0#1);" "assume !(3 == main_~q~0#1);havoc main_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1;" [2025-03-04 15:58:23,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:23,325 INFO L85 PathProgramCache]: Analyzing trace with hash 8352, now seen corresponding path program 1 times [2025-03-04 15:58:23,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:23,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675017987] [2025-03-04 15:58:23,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:23,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:58:23,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:58:23,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,392 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-03-04 15:58:23,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-03-04 15:58:23,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,413 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:23,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:23,415 INFO L85 PathProgramCache]: Analyzing trace with hash -958402210, now seen corresponding path program 1 times [2025-03-04 15:58:23,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:23,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124854641] [2025-03-04 15:58:23,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:23,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:23,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:58:23,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:58:23,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,424 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:58:23,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:58:23,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,433 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:23,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:23,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1766252221, now seen corresponding path program 1 times [2025-03-04 15:58:23,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:23,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983860426] [2025-03-04 15:58:23,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:23,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:23,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:58:23,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:58:23,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:58:23,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:58:23,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:58:23,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983860426] [2025-03-04 15:58:23,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983860426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:58:23,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:58:23,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:58:23,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590481934] [2025-03-04 15:58:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:58:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:58:23,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:58:23,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:58:23,566 INFO L87 Difference]: Start difference. First operand has 68 states, 67 states have (on average 1.8805970149253732) internal successors, (126), 67 states have internal predecessors, (126), 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 2.6666666666666665) internal successors, (8), 3 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) [2025-03-04 15:58:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 15:58:23,601 INFO L93 Difference]: Finished difference Result 66 states and 102 transitions. [2025-03-04 15:58:23,602 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 66 states and 102 transitions. [2025-03-04 15:58:23,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2025-03-04 15:58:23,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 66 states to 52 states and 77 transitions. [2025-03-04 15:58:23,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2025-03-04 15:58:23,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2025-03-04 15:58:23,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 77 transitions. [2025-03-04 15:58:23,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2025-03-04 15:58:23,613 INFO L218 hiAutomatonCegarLoop]: Abstraction has 52 states and 77 transitions. [2025-03-04 15:58:23,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 77 transitions. [2025-03-04 15:58:23,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 15:58:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 1.4807692307692308) internal successors, (77), 51 states have internal predecessors, (77), 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) [2025-03-04 15:58:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 77 transitions. [2025-03-04 15:58:23,631 INFO L240 hiAutomatonCegarLoop]: Abstraction has 52 states and 77 transitions. [2025-03-04 15:58:23,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:58:23,634 INFO L432 stractBuchiCegarLoop]: Abstraction has 52 states and 77 transitions. [2025-03-04 15:58:23,634 INFO L338 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2025-03-04 15:58:23,634 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 52 states and 77 transitions. [2025-03-04 15:58:23,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2025-03-04 15:58:23,635 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2025-03-04 15:58:23,635 INFO L119 BuchiIsEmpty]: Starting construction of run [2025-03-04 15:58:23,636 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1, 1] [2025-03-04 15:58:23,636 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1] [2025-03-04 15:58:23,636 INFO L752 eck$LassoCheckResult]: Stem: "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(13, 2);call #Ultimate.allocInit(12, 3);~m_flush~0 := 1;~m_PipedOutputStream~0 := 2;~m_close~0 := 3;~m_write~0 := 4;~m_connect_1~0 := 5;~m_connect_2~0 := 6;" "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_~P1~0#1, main_~P2~0#1, main_~P3~0#1, main_~P4~0#1, main_~q~0#1, main_~method_id~0#1, main_~this_sink~0#1, main_~this_sinkConnected~0#1;main_~q~0#1 := 0;havoc main_~method_id~0#1;main_~this_sink~0#1 := 0;main_~this_sinkConnected~0#1 := 0;" "assume true;" [2025-03-04 15:58:23,636 INFO L754 eck$LassoCheckResult]: Loop: "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;" "assume 0 == main_~q~0#1;havoc main_#t~nondet8#1;" "assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1;" [2025-03-04 15:58:23,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:23,636 INFO L85 PathProgramCache]: Analyzing trace with hash 259140, now seen corresponding path program 1 times [2025-03-04 15:58:23,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:23,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967507868] [2025-03-04 15:58:23,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:23,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:23,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,642 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,649 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:23,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:23,651 INFO L85 PathProgramCache]: Analyzing trace with hash 255137, now seen corresponding path program 1 times [2025-03-04 15:58:23,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:23,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585438204] [2025-03-04 15:58:23,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:23,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:23,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,658 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,662 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:23,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:58:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash -869669506, now seen corresponding path program 1 times [2025-03-04 15:58:23,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:58:23,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020497698] [2025-03-04 15:58:23,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:58:23,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:58:23,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:58:23,667 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:58:23,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,667 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:58:23,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:58:23,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:58:23,866 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,868 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:58:23,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:58:23,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:58:23,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:58:23,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:58:23,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 04.03 03:58:23 BoogieIcfgContainer [2025-03-04 15:58:23,908 INFO L131 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2025-03-04 15:58:23,909 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:58:23,909 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:58:23,909 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:58:23,909 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:58:23" (3/4) ... [2025-03-04 15:58:23,911 INFO L143 WitnessPrinter]: Generating witness for non-termination counterexample [2025-03-04 15:58:23,938 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:58:23,939 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:58:23,941 INFO L158 Benchmark]: Toolchain (without parser) took 1263.20ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 47.9MB in the end (delta: 85.2MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,941 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:58:23,941 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.23ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,941 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.63ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 119.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,942 INFO L158 Benchmark]: Boogie Preprocessor took 25.53ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 117.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:58:23,942 INFO L158 Benchmark]: IcfgBuilder took 326.22ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 99.5MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,942 INFO L158 Benchmark]: BuchiAutomizer took 651.96ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 50.8MB in the end (delta: 48.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-04 15:58:23,943 INFO L158 Benchmark]: Witness Printer took 30.00ms. Allocated memory is still 167.8MB. Free memory was 50.8MB in the beginning and 47.9MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:58:23,945 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.22ms. Allocated memory is still 201.3MB. Free memory is still 126.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.23ms. Allocated memory is still 167.8MB. Free memory was 132.7MB in the beginning and 120.6MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.63ms. Allocated memory is still 167.8MB. Free memory was 120.6MB in the beginning and 119.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.53ms. Allocated memory is still 167.8MB. Free memory was 119.0MB in the beginning and 117.7MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 326.22ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 99.5MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * BuchiAutomizer took 651.96ms. Allocated memory is still 167.8MB. Free memory was 99.1MB in the beginning and 50.8MB in the end (delta: 48.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Witness Printer took 30.00ms. Allocated memory is still 167.8MB. Free memory was 50.8MB in the beginning and 47.9MB in the end (delta: 2.9MB). There was no memory consumed. 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 52 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 0.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 0.4s. Construction of modules took 0.0s. Büchi inclusion checks took 0.0s. 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, 177 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 98 mSDtfsCounter, 16 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: 25]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L7] int m_flush = 1; [L8] int m_PipedOutputStream = 2; [L9] int m_close = 3; [L10] int m_write = 4; [L11] int m_connect_1 = 5; [L12] int m_connect_2 = 6; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4] [L17] int q = 0; [L18] int method_id; [L21] int this_sink = 0; [L22] int this_sinkConnected = 0; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4, q=0, this_sink=0, this_sinkConnected=0] [L25] COND TRUE 1 VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4, q=0, this_sink=0, this_sinkConnected=0] Loop: [L28] int P1=__VERIFIER_nondet_int(); [L29] int P2=__VERIFIER_nondet_int(); [L30] int P3=__VERIFIER_nondet_int(); [L31] int P4=__VERIFIER_nondet_int(); [L35] COND TRUE q == 0 [L36] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 25]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int m_flush = 1; [L8] int m_PipedOutputStream = 2; [L9] int m_close = 3; [L10] int m_write = 4; [L11] int m_connect_1 = 5; [L12] int m_connect_2 = 6; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4] [L17] int q = 0; [L18] int method_id; [L21] int this_sink = 0; [L22] int this_sinkConnected = 0; VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4, q=0, this_sink=0, this_sinkConnected=0] [L25] COND TRUE 1 VAL [m_PipedOutputStream=2, m_close=3, m_connect_1=5, m_connect_2=6, m_flush=1, m_write=4, q=0, this_sink=0, this_sinkConnected=0] Loop: [L28] int P1=__VERIFIER_nondet_int(); [L29] int P2=__VERIFIER_nondet_int(); [L30] int P3=__VERIFIER_nondet_int(); [L31] int P4=__VERIFIER_nondet_int(); [L35] COND TRUE q == 0 [L36] COND FALSE !(__VERIFIER_nondet_int()) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2025-03-04 15:58:23,958 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)