./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/bubble_sort-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loops/bubble_sort-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3b81c98cb025a57c782cd7fac59d92180084d85fffb615d87a6622128bc11df5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 02:51:37,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 02:51:37,694 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 02:51:37,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 02:51:37,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 02:51:37,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 02:51:37,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 02:51:37,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 02:51:37,730 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 02:51:37,730 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 02:51:37,731 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 02:51:37,731 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 02:51:37,731 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 02:51:37,731 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 02:51:37,731 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 02:51:37,732 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 02:51:37,732 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 02:51:37,733 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 02:51:37,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:51:37,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:51:37,733 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:51:37,733 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:51:37,733 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 02:51:37,733 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 02:51:37,733 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:51:37,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 02:51:37,734 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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(G ! call(reach_error())) ) 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 -> 3b81c98cb025a57c782cd7fac59d92180084d85fffb615d87a6622128bc11df5 [2025-01-09 02:51:37,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 02:51:37,958 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 02:51:37,959 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 02:51:37,960 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 02:51:37,960 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 02:51:37,966 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/bubble_sort-2.i [2025-01-09 02:51:39,096 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4d574f65/d6780b59335447968d7c4dcb65e12505/FLAG47684e196 [2025-01-09 02:51:39,386 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 02:51:39,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i [2025-01-09 02:51:39,401 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4d574f65/d6780b59335447968d7c4dcb65e12505/FLAG47684e196 [2025-01-09 02:51:39,639 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f4d574f65/d6780b59335447968d7c4dcb65e12505 [2025-01-09 02:51:39,641 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 02:51:39,642 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 02:51:39,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 02:51:39,643 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 02:51:39,645 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 02:51:39,646 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f864566 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39, skipping insertion in model container [2025-01-09 02:51:39,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,665 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 02:51:39,765 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i[1830,1843] [2025-01-09 02:51:39,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:51:39,827 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 02:51:39,837 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/loops/bubble_sort-2.i[1830,1843] [2025-01-09 02:51:39,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 02:51:39,905 INFO L204 MainTranslator]: Completed translation [2025-01-09 02:51:39,907 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39 WrapperNode [2025-01-09 02:51:39,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 02:51:39,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 02:51:39,908 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 02:51:39,908 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 02:51:39,912 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,923 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,938 INFO L138 Inliner]: procedures = 32, calls = 79, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 228 [2025-01-09 02:51:39,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 02:51:39,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 02:51:39,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 02:51:39,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 02:51:39,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,990 INFO L175 MemorySlicer]: Split 39 memory accesses to 5 slices as follows [2, 2, 18, 1, 16]. 46 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 2, 2, 0, 0]. The 10 writes are split as follows [0, 0, 4, 1, 5]. [2025-01-09 02:51:39,991 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:39,991 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,006 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,007 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,011 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,014 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 02:51:40,018 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 02:51:40,018 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 02:51:40,021 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 02:51:40,022 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (1/1) ... [2025-01-09 02:51:40,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 02:51:40,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 02:51:40,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 02:51:40,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 02:51:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 02:51:40,076 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 02:51:40,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 02:51:40,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 02:51:40,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 02:51:40,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 02:51:40,080 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2025-01-09 02:51:40,080 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2025-01-09 02:51:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2025-01-09 02:51:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-01-09 02:51:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 02:51:40,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 02:51:40,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 02:51:40,251 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 02:51:40,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 02:51:40,315 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint failFINAL: assume true; [2025-01-09 02:51:40,614 INFO L? ?]: Removed 299 outVars from TransFormulas that were not future-live. [2025-01-09 02:51:40,615 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 02:51:40,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 02:51:40,647 INFO L312 CfgBuilder]: Removed 23 assume(true) statements. [2025-01-09 02:51:40,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:40 BoogieIcfgContainer [2025-01-09 02:51:40,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 02:51:40,649 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 02:51:40,649 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 02:51:40,652 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 02:51:40,652 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:51:39" (1/3) ... [2025-01-09 02:51:40,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb9942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:40, skipping insertion in model container [2025-01-09 02:51:40,653 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:39" (2/3) ... [2025-01-09 02:51:40,653 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67fb9942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:40, skipping insertion in model container [2025-01-09 02:51:40,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:40" (3/3) ... [2025-01-09 02:51:40,654 INFO L128 eAbstractionObserver]: Analyzing ICFG bubble_sort-2.i [2025-01-09 02:51:40,664 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 02:51:40,665 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bubble_sort-2.i that has 5 procedures, 106 locations, 1 initial locations, 23 loop locations, and 1 error locations. [2025-01-09 02:51:40,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 02:51:40,720 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5fd98bf2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 02:51:40,720 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 02:51:40,723 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 95 states have internal predecessors, (126), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-01-09 02:51:40,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 02:51:40,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:40,727 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:40,727 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:40,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:40,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1866172999, now seen corresponding path program 1 times [2025-01-09 02:51:40,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:40,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80226733] [2025-01-09 02:51:40,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:40,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:40,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 02:51:40,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 02:51:40,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:40,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:40,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:40,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80226733] [2025-01-09 02:51:40,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80226733] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:51:40,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:51:40,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 02:51:40,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682635041] [2025-01-09 02:51:40,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:51:40,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 02:51:40,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 02:51:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:51:40,832 INFO L87 Difference]: Start difference. First operand has 105 states, 77 states have (on average 1.6363636363636365) internal successors, (126), 95 states have internal predecessors, (126), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:51:40,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:40,851 INFO L93 Difference]: Finished difference Result 206 states and 307 transitions. [2025-01-09 02:51:40,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 02:51:40,852 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 02:51:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:40,856 INFO L225 Difference]: With dead ends: 206 [2025-01-09 02:51:40,857 INFO L226 Difference]: Without dead ends: 95 [2025-01-09 02:51:40,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 02:51:40,861 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:40,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 02:51:40,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-01-09 02:51:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-01-09 02:51:40,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.3235294117647058) internal successors, (90), 85 states have internal predecessors, (90), 23 states have call successors, (23), 4 states have call predecessors, (23), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:51:40,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2025-01-09 02:51:40,885 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 9 [2025-01-09 02:51:40,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:40,885 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2025-01-09 02:51:40,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 02:51:40,886 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2025-01-09 02:51:40,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-01-09 02:51:40,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:40,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:40,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 02:51:40,887 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:40,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:40,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1422626120, now seen corresponding path program 1 times [2025-01-09 02:51:40,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:40,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227869436] [2025-01-09 02:51:40,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:40,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:40,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-09 02:51:40,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-09 02:51:40,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:40,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 02:51:41,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 02:51:41,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 02:51:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227869436] [2025-01-09 02:51:41,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227869436] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 02:51:41,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 02:51:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 02:51:41,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046559999] [2025-01-09 02:51:41,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 02:51:41,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 02:51:41,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 02:51:41,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 02:51:41,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 02:51:41,182 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:51:41,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 02:51:41,346 INFO L93 Difference]: Finished difference Result 154 states and 193 transitions. [2025-01-09 02:51:41,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 02:51:41,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2025-01-09 02:51:41,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 02:51:41,348 INFO L225 Difference]: With dead ends: 154 [2025-01-09 02:51:41,349 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 02:51:41,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-01-09 02:51:41,349 INFO L435 NwaCegarLoop]: 104 mSDtfsCounter, 239 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 02:51:41,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 387 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 02:51:41,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 02:51:41,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 133. [2025-01-09 02:51:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 106 states have (on average 1.3584905660377358) internal successors, (144), 122 states have internal predecessors, (144), 23 states have call successors, (23), 5 states have call predecessors, (23), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-09 02:51:41,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 172 transitions. [2025-01-09 02:51:41,393 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 172 transitions. Word has length 19 [2025-01-09 02:51:41,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 02:51:41,397 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 172 transitions. [2025-01-09 02:51:41,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 02:51:41,398 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 172 transitions. [2025-01-09 02:51:41,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-09 02:51:41,398 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 02:51:41,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 02:51:41,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 02:51:41,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 02:51:41,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 02:51:41,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1336428012, now seen corresponding path program 1 times [2025-01-09 02:51:41,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 02:51:41,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481964166] [2025-01-09 02:51:41,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 02:51:41,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 02:51:41,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:51:41,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:51:41,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:51:41,544 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 02:51:41,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-09 02:51:41,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-09 02:51:41,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 02:51:41,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 02:51:41,673 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 02:51:41,673 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 02:51:41,674 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 02:51:41,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 02:51:41,681 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2025-01-09 02:51:41,718 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 02:51:41,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 02:51:41 BoogieIcfgContainer [2025-01-09 02:51:41,720 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 02:51:41,721 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 02:51:41,721 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 02:51:41,721 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 02:51:41,721 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:40" (3/4) ... [2025-01-09 02:51:41,722 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 02:51:41,788 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 15. [2025-01-09 02:51:41,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 02:51:41,853 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 02:51:41,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 02:51:41,854 INFO L158 Benchmark]: Toolchain (without parser) took 2212.51ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 47.2MB in the end (delta: 58.3MB). Peak memory consumption was 55.6MB. Max. memory is 16.1GB. [2025-01-09 02:51:41,855 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:51:41,856 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.09ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 86.2MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 02:51:41,856 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.66ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:51:41,856 INFO L158 Benchmark]: Boogie Preprocessor took 78.01ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 76.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 02:51:41,856 INFO L158 Benchmark]: RCFGBuilder took 630.14ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 102.7MB in the end (delta: -26.4MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. [2025-01-09 02:51:41,857 INFO L158 Benchmark]: TraceAbstraction took 1071.52ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 55.2MB in the end (delta: 46.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. [2025-01-09 02:51:41,857 INFO L158 Benchmark]: Witness Printer took 132.68ms. Allocated memory is still 142.6MB. Free memory was 54.4MB in the beginning and 47.2MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 02:51:41,859 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.21ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.09ms. Allocated memory is still 142.6MB. Free memory was 105.5MB in the beginning and 86.2MB in the end (delta: 19.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.66ms. Allocated memory is still 142.6MB. Free memory was 86.2MB in the beginning and 84.7MB in the end (delta: 1.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 78.01ms. Allocated memory is still 142.6MB. Free memory was 84.7MB in the beginning and 76.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 630.14ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 102.7MB in the end (delta: -26.4MB). Peak memory consumption was 49.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1071.52ms. Allocated memory is still 142.6MB. Free memory was 101.9MB in the beginning and 55.2MB in the end (delta: 46.8MB). Peak memory consumption was 40.2MB. Max. memory is 16.1GB. * Witness Printer took 132.68ms. Allocated memory is still 142.6MB. Free memory was 54.4MB in the beginning and 47.2MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 46]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L52] struct list_head gl_list = {& gl_list, & gl_list}; [L52] struct list_head gl_list = {& gl_list, & gl_list}; VAL [gl_list={5:0}] [L835] struct list_head const *__cil_tmp1 ; [L836] struct list_head const *__cil_tmp2 ; [L839] CALL gl_read() [L676] int tmp ; [L677] int tmp___0 ; VAL [gl_list={5:0}] [L683] tmp = __VERIFIER_nondet_int() [L684] CALL gl_insert(tmp) [L622] struct node *node ; [L623] void *tmp ; [L624] unsigned int __cil_tmp4 ; [L625] unsigned int __cil_tmp5 ; [L626] unsigned int __cil_tmp6 ; [L627] struct list_head *__cil_tmp7 ; [L628] unsigned int __cil_tmp8 ; [L629] unsigned int __cil_tmp9 ; [L630] unsigned int __cil_tmp10 ; [L631] unsigned int __cil_tmp11 ; [L632] unsigned int __cil_tmp12 ; [L633] unsigned int __cil_tmp13 ; [L634] unsigned int __cil_tmp14 ; [L635] unsigned int __cil_tmp15 ; [L638] __cil_tmp4 = (unsigned int )20UL [L639] tmp = malloc(__cil_tmp4) [L640] node = (struct node *)tmp VAL [gl_list={5:0}, node={4294967297:0}, value=6] [L642] COND FALSE !(! node) VAL [gl_list={5:0}, node={4294967297:0}, value=6] [L649] *((int *)node) = value [L650] __cil_tmp5 = (unsigned int )node [L651] __cil_tmp6 = __cil_tmp5 + 4 [L652] __cil_tmp7 = (struct list_head *)__cil_tmp6 VAL [__cil_tmp7={0:5}, gl_list={5:0}, node={4294967297:0}] [L653] CALL list_add(__cil_tmp7, & gl_list) VAL [gl_list={5:0}] [L595] struct list_head *__cil_tmp3 ; [L598] EXPR \read(*head) [L598] __cil_tmp3 = *((struct list_head **)head) [L599] CALL __list_add(new, head, __cil_tmp3) [L567] unsigned int __cil_tmp4 ; [L568] unsigned int __cil_tmp5 ; [L569] unsigned int __cil_tmp6 ; [L570] unsigned int __cil_tmp7 ; [L572] __cil_tmp4 = (unsigned int )next [L573] __cil_tmp5 = __cil_tmp4 + 4 [L574] *((struct list_head **)__cil_tmp5) = new [L575] *((struct list_head **)new) = next [L576] __cil_tmp6 = (unsigned int )new [L577] __cil_tmp7 = __cil_tmp6 + 4 [L578] *((struct list_head **)__cil_tmp7) = prev [L579] *((struct list_head **)prev) = new VAL [\old(head)={5:0}, \old(new)={0:5}, gl_list={5:0}] [L599] RET __list_add(new, head, __cil_tmp3) [L653] RET list_add(__cil_tmp7, & gl_list) VAL [__cil_tmp7={0:5}, gl_list={5:0}, node={4294967297:0}] [L658] __cil_tmp8 = (unsigned int )node [L659] __cil_tmp9 = __cil_tmp8 + 12 [L660] __cil_tmp10 = (unsigned int )node [L661] __cil_tmp11 = __cil_tmp10 + 12 [L662] *((struct list_head **)__cil_tmp9) = (struct list_head *)__cil_tmp11 [L663] __cil_tmp12 = (unsigned int )node [L664] __cil_tmp13 = __cil_tmp12 + 12 [L665] __cil_tmp14 = (unsigned int )node [L666] __cil_tmp15 = __cil_tmp14 + 12 [L667] *((struct list_head **)__cil_tmp13) = (struct list_head *)__cil_tmp15 VAL [gl_list={5:0}] [L684] RET gl_insert(tmp) [L685] tmp___0 = __VERIFIER_nondet_int() [L687] COND FALSE !(\read(tmp___0)) VAL [gl_list={5:0}] [L839] RET gl_read() [L840] __cil_tmp1 = (struct list_head const *)(& gl_list) VAL [__cil_tmp1={5:0}, gl_list={5:0}] [L841] CALL inspect(__cil_tmp1) VAL [\old(head)={5:0}, gl_list={5:0}] [L55] struct node const *node ; [L56] unsigned int __cil_tmp3 ; [L57] struct list_head *__cil_tmp4 ; [L58] unsigned int __cil_tmp5 ; [L59] int __cil_tmp6 ; [L60] unsigned int __cil_tmp7 ; [L61] unsigned int __cil_tmp8 ; [L62] unsigned int __cil_tmp9 ; [L63] struct list_head *__cil_tmp10 ; [L64] unsigned int __cil_tmp11 ; [L65] int __cil_tmp12 ; [L66] unsigned int __cil_tmp13 ; [L67] unsigned int __cil_tmp14 ; [L68] struct list_head *__cil_tmp15 ; [L69] unsigned int __cil_tmp16 ; [L70] struct list_head *__cil_tmp17 ; [L71] unsigned int __cil_tmp18 ; [L72] int __cil_tmp19 ; [L73] unsigned int __cil_tmp20 ; [L74] unsigned int __cil_tmp21 ; [L75] unsigned int __cil_tmp22 ; [L76] struct list_head *__cil_tmp23 ; [L77] unsigned int __cil_tmp24 ; [L78] int __cil_tmp25 ; [L79] struct node *__cil_tmp26 ; [L80] unsigned int __cil_tmp27 ; [L81] unsigned int __cil_tmp28 ; [L82] struct list_head *__cil_tmp29 ; [L83] unsigned long __cil_tmp30 ; [L84] char *__cil_tmp31 ; [L85] char *__cil_tmp32 ; [L86] struct node *__cil_tmp33 ; [L87] unsigned int __cil_tmp34 ; [L88] unsigned int __cil_tmp35 ; [L89] struct list_head const *__cil_tmp36 ; [L90] unsigned int __cil_tmp37 ; [L91] unsigned int __cil_tmp38 ; [L92] unsigned int __cil_tmp39 ; [L93] struct list_head *__cil_tmp40 ; [L94] unsigned int __cil_tmp41 ; [L95] int __cil_tmp42 ; [L96] unsigned int __cil_tmp43 ; [L97] unsigned int __cil_tmp44 ; [L98] struct list_head const *__cil_tmp45 ; [L99] unsigned int __cil_tmp46 ; [L100] unsigned int __cil_tmp47 ; [L101] unsigned int __cil_tmp48 ; [L102] unsigned int __cil_tmp49 ; [L103] struct list_head *__cil_tmp50 ; [L104] unsigned int __cil_tmp51 ; [L105] int __cil_tmp52 ; [L106] unsigned int __cil_tmp53 ; [L107] unsigned int __cil_tmp54 ; [L108] struct list_head const *__cil_tmp55 ; [L109] unsigned int __cil_tmp56 ; [L110] unsigned int __cil_tmp57 ; [L111] unsigned int __cil_tmp58 ; [L112] struct list_head *__cil_tmp59 ; [L113] unsigned int __cil_tmp60 ; [L114] int __cil_tmp61 ; [L115] unsigned int __cil_tmp62 ; [L116] unsigned int __cil_tmp63 ; [L117] struct list_head const *__cil_tmp64 ; [L118] unsigned int __cil_tmp65 ; [L119] unsigned int __cil_tmp66 ; [L120] unsigned int __cil_tmp67 ; [L121] unsigned int __cil_tmp68 ; [L122] struct list_head *__cil_tmp69 ; [L123] unsigned int __cil_tmp70 ; [L124] int __cil_tmp71 ; [L125] struct node const *__cil_tmp72 ; [L126] unsigned int __cil_tmp73 ; [L127] unsigned int __cil_tmp74 ; [L128] int __cil_tmp75 ; [L129] unsigned int __cil_tmp76 ; [L130] unsigned int __cil_tmp77 ; [L131] struct list_head const *__cil_tmp78 ; [L132] struct node const *__cil_tmp79 ; [L133] unsigned int __cil_tmp80 ; [L134] unsigned int __cil_tmp81 ; [L135] int __cil_tmp82 ; [L136] int const *__cil_tmp83 ; [L137] struct node const *__cil_tmp84 ; [L138] unsigned int __cil_tmp85 ; [L139] unsigned int __cil_tmp86 ; [L140] int __cil_tmp87 ; [L141] unsigned int __cil_tmp88 ; [L142] unsigned int __cil_tmp89 ; [L143] struct list_head *__cil_tmp90 ; [L144] unsigned int __cil_tmp91 ; [L145] unsigned int __cil_tmp92 ; [L146] struct list_head *__cil_tmp93 ; [L147] unsigned int __cil_tmp94 ; [L148] unsigned int __cil_tmp95 ; [L149] int __cil_tmp96 ; [L150] unsigned int __cil_tmp97 ; [L151] unsigned int __cil_tmp98 ; [L152] unsigned int __cil_tmp99 ; [L153] struct list_head *__cil_tmp100 ; [L154] struct list_head *__cil_tmp101 ; [L155] unsigned int __cil_tmp102 ; [L156] unsigned int __cil_tmp103 ; [L157] int __cil_tmp104 ; [L158] struct list_head *__cil_tmp105 ; [L159] unsigned int __cil_tmp106 ; [L160] unsigned int __cil_tmp107 ; [L161] unsigned int __cil_tmp108 ; [L162] struct list_head const *__cil_tmp109 ; [L163] unsigned int __cil_tmp110 ; [L164] struct list_head *__cil_tmp111 ; [L165] unsigned int __cil_tmp112 ; [L166] struct node *__cil_tmp113 ; [L167] unsigned int __cil_tmp114 ; [L168] unsigned int __cil_tmp115 ; [L169] struct list_head *__cil_tmp116 ; [L170] unsigned long __cil_tmp117 ; [L171] char *__cil_tmp118 ; [L172] char *__cil_tmp119 ; [L173] struct node *__cil_tmp120 ; [L174] unsigned int __cil_tmp121 ; [L175] int __cil_tmp122 ; VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L181] COND FALSE !(! head) VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L195] __cil_tmp3 = (unsigned int )head [L196] EXPR \read(*head) [L196] __cil_tmp4 = *((struct list_head * const *)head) [L197] __cil_tmp5 = (unsigned int )__cil_tmp4 [L198] __cil_tmp6 = __cil_tmp5 != __cil_tmp3 VAL [\old(head)={5:0}, __cil_tmp6=0, gl_list={5:0}, head={5:0}] [L199] COND TRUE ! __cil_tmp6 VAL [\old(head)={5:0}, gl_list={5:0}, head={5:0}] [L201] CALL fail() VAL [gl_list={5:0}] [L46] reach_error() VAL [gl_list={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 239 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 239 mSDsluCounter, 514 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 26 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 62 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 26 mSolverCounterUnsat, 231 mSDtfsCounter, 62 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 16 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 26 ConstructedInterpolants, 0 QuantifiedInterpolants, 50 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 02:51:41,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (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