./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing-overflow.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows 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/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing-overflow.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-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(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:22:57,087 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:22:57,139 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:22:57,146 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:22:57,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:22:57,164 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:22:57,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:22:57,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:22:57,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:22:57,165 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:22:57,165 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:22:57,165 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:22:57,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:22:57,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:22:57,166 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:22:57,167 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:22:57,167 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:57,168 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:22:57,168 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:22:57,169 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:22:57,169 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:22:57,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:22:57,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:22:57,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:22:57,169 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/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 ! overflow) ) 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 -> 8e4241de9ab6aaee40e34a0aea220f2af2541cd79c1f3c4ee08672ad0bf05f65 [2025-03-04 15:22:57,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:22:57,409 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:22:57,412 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:22:57,413 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:22:57,414 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:22:57,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing-overflow.i [2025-03-04 15:22:58,639 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee648ae8/bb3264c72d9741de8fa3566d4262a511/FLAGc7d7bcea5 [2025-03-04 15:22:58,986 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:22:58,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_78-equ_racing-overflow.i [2025-03-04 15:22:59,001 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee648ae8/bb3264c72d9741de8fa3566d4262a511/FLAGc7d7bcea5 [2025-03-04 15:22:59,221 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1ee648ae8/bb3264c72d9741de8fa3566d4262a511 [2025-03-04 15:22:59,223 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:22:59,225 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:22:59,226 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:59,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:22:59,230 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:22:59,230 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,232 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19036236 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59, skipping insertion in model container [2025-03-04 15:22:59,232 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:22:59,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:59,619 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:22:59,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:22:59,695 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:22:59,695 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59 WrapperNode [2025-03-04 15:22:59,695 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:22:59,696 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:59,696 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:22:59,696 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:22:59,700 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:22:59" (1/1) ... [2025-03-04 15:22:59,717 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:22:59" (1/1) ... [2025-03-04 15:22:59,741 INFO L138 Inliner]: procedures = 272, calls = 65, calls flagged for inlining = 5, calls inlined = 6, statements flattened = 227 [2025-03-04 15:22:59,742 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:22:59,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:22:59,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:22:59,742 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:22:59,756 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,760 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,770 INFO L175 MemorySlicer]: Split 35 memory accesses to 4 slices as follows [2, 5, 2, 26]. 74 percent of accesses are in the largest equivalence class. The 23 initializations are split as follows [2, 5, 0, 16]. The 5 writes are split as follows [0, 0, 1, 4]. [2025-03-04 15:22:59,771 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,771 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,777 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,778 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,779 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,782 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:22:59,782 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:22:59,782 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:22:59,783 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:22:59,783 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (1/1) ... [2025-03-04 15:22:59,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:22:59,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:22:59,811 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:22:59,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:22:59,830 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 15:22:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:22:59,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:22:59,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:22:59,832 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:22:59,941 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:22:59,942 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:23:00,166 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-04 15:23:00,167 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1033-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-04 15:23:00,237 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:23:00,238 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:23:00,408 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:23:00,408 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:23:00,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:00 BoogieIcfgContainer [2025-03-04 15:23:00,409 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:23:00,411 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:23:00,411 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:23:00,414 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:23:00,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:22:59" (1/3) ... [2025-03-04 15:23:00,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4606735b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:00, skipping insertion in model container [2025-03-04 15:23:00,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:22:59" (2/3) ... [2025-03-04 15:23:00,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4606735b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:23:00, skipping insertion in model container [2025-03-04 15:23:00,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:00" (3/3) ... [2025-03-04 15:23:00,417 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_78-equ_racing-overflow.i [2025-03-04 15:23:00,427 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:23:00,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_78-equ_racing-overflow.i that has 2 procedures, 90 locations, 1 initial locations, 10 loop locations, and 16 error locations. [2025-03-04 15:23:00,429 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:23:00,469 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-04 15:23:00,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 93 places, 114 transitions, 235 flow [2025-03-04 15:23:00,533 INFO L124 PetriNetUnfolderBase]: 35/160 cut-off events. [2025-03-04 15:23:00,535 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:23:00,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165 conditions, 160 events. 35/160 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 615 event pairs, 0 based on Foata normal form. 0/102 useless extension candidates. Maximal degree in co-relation 94. Up to 8 conditions per place. [2025-03-04 15:23:00,539 INFO L82 GeneralOperation]: Start removeDead. Operand has 93 places, 114 transitions, 235 flow [2025-03-04 15:23:00,541 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 93 places, 113 transitions, 233 flow [2025-03-04 15:23:00,546 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:23:00,557 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;@4e64c2bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:23:00,557 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:23:00,563 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:23:00,563 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 15:23:00,563 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:23:00,563 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:00,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:00,564 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:00,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:00,568 INFO L85 PathProgramCache]: Analyzing trace with hash 547120, now seen corresponding path program 1 times [2025-03-04 15:23:00,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:00,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491778222] [2025-03-04 15:23:00,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:00,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:00,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:00,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:00,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:00,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:00,771 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:23:00,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:00,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491778222] [2025-03-04 15:23:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491778222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:00,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:00,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:00,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418119653] [2025-03-04 15:23:00,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:00,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:00,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:00,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:00,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:00,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 114 [2025-03-04 15:23:00,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 113 transitions, 233 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:23:00,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:00,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 114 [2025-03-04 15:23:00,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:01,059 INFO L124 PetriNetUnfolderBase]: 417/1302 cut-off events. [2025-03-04 15:23:01,059 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:23:01,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2144 conditions, 1302 events. 417/1302 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 8675 event pairs, 374 based on Foata normal form. 220/1363 useless extension candidates. Maximal degree in co-relation 2054. Up to 835 conditions per place. [2025-03-04 15:23:01,069 INFO L140 encePairwiseOnDemand]: 91/114 looper letters, 46 selfloop transitions, 2 changer transitions 0/92 dead transitions. [2025-03-04 15:23:01,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 287 flow [2025-03-04 15:23:01,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:01,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2025-03-04 15:23:01,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5877192982456141 [2025-03-04 15:23:01,082 INFO L175 Difference]: Start difference. First operand has 93 places, 113 transitions, 233 flow. Second operand 3 states and 201 transitions. [2025-03-04 15:23:01,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 287 flow [2025-03-04 15:23:01,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 92 transitions, 287 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:23:01,090 INFO L231 Difference]: Finished difference. Result has 94 places, 92 transitions, 195 flow [2025-03-04 15:23:01,093 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=92} [2025-03-04 15:23:01,097 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-03-04 15:23:01,098 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 92 transitions, 195 flow [2025-03-04 15:23:01,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:23:01,098 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:01,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:23:01,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:23:01,099 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:01,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:01,100 INFO L85 PathProgramCache]: Analyzing trace with hash 547182, now seen corresponding path program 1 times [2025-03-04 15:23:01,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92439279] [2025-03-04 15:23:01,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:01,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:23:01,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:23:01,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:01,188 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:23:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:01,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92439279] [2025-03-04 15:23:01,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92439279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:01,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:01,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:01,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412460643] [2025-03-04 15:23:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:01,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:23:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:01,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:23:01,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:23:01,203 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 114 [2025-03-04 15:23:01,203 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 92 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:23:01,203 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:01,203 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 114 [2025-03-04 15:23:01,203 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:01,595 INFO L124 PetriNetUnfolderBase]: 833/2568 cut-off events. [2025-03-04 15:23:01,595 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:23:01,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4228 conditions, 2568 events. 833/2568 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 20454 event pairs, 731 based on Foata normal form. 1/2263 useless extension candidates. Maximal degree in co-relation 2125. Up to 851 conditions per place. [2025-03-04 15:23:01,608 INFO L140 encePairwiseOnDemand]: 108/114 looper letters, 85 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2025-03-04 15:23:01,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 133 transitions, 463 flow [2025-03-04 15:23:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:23:01,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:23:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 267 transitions. [2025-03-04 15:23:01,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5855263157894737 [2025-03-04 15:23:01,611 INFO L175 Difference]: Start difference. First operand has 94 places, 92 transitions, 195 flow. Second operand 4 states and 267 transitions. [2025-03-04 15:23:01,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 133 transitions, 463 flow [2025-03-04 15:23:01,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 133 transitions, 459 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:01,617 INFO L231 Difference]: Finished difference. Result has 95 places, 92 transitions, 208 flow [2025-03-04 15:23:01,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=95, PETRI_TRANSITIONS=92} [2025-03-04 15:23:01,618 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 2 predicate places. [2025-03-04 15:23:01,618 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 92 transitions, 208 flow [2025-03-04 15:23:01,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 44.75) internal successors, (179), 4 states have internal predecessors, (179), 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:23:01,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:01,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:23:01,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:01,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:01,621 INFO L85 PathProgramCache]: Analyzing trace with hash 16961183, now seen corresponding path program 1 times [2025-03-04 15:23:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820026006] [2025-03-04 15:23:01,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:01,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:01,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:01,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:23:01,695 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:23:01,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:23:01,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820026006] [2025-03-04 15:23:01,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820026006] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:23:01,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:23:01,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:23:01,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571599661] [2025-03-04 15:23:01,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:23:01,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:23:01,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:23:01,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:23:01,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:23:01,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 114 [2025-03-04 15:23:01,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 92 transitions, 208 flow. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:23:01,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:23:01,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 114 [2025-03-04 15:23:01,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:23:01,938 INFO L124 PetriNetUnfolderBase]: 833/2567 cut-off events. [2025-03-04 15:23:01,938 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-04 15:23:01,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4288 conditions, 2567 events. 833/2567 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 20468 event pairs, 731 based on Foata normal form. 1/2297 useless extension candidates. Maximal degree in co-relation 2144. Up to 1647 conditions per place. [2025-03-04 15:23:01,947 INFO L140 encePairwiseOnDemand]: 111/114 looper letters, 46 selfloop transitions, 2 changer transitions 0/91 dead transitions. [2025-03-04 15:23:01,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 91 transitions, 302 flow [2025-03-04 15:23:01,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:23:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:23:01,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2025-03-04 15:23:01,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5263157894736842 [2025-03-04 15:23:01,948 INFO L175 Difference]: Start difference. First operand has 95 places, 92 transitions, 208 flow. Second operand 3 states and 180 transitions. [2025-03-04 15:23:01,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 91 transitions, 302 flow [2025-03-04 15:23:01,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 91 transitions, 297 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:23:01,950 INFO L231 Difference]: Finished difference. Result has 94 places, 91 transitions, 205 flow [2025-03-04 15:23:01,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=114, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=205, PETRI_PLACES=94, PETRI_TRANSITIONS=91} [2025-03-04 15:23:01,951 INFO L279 CegarLoopForPetriNet]: 93 programPoint places, 1 predicate places. [2025-03-04 15:23:01,951 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 91 transitions, 205 flow [2025-03-04 15:23:01,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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:23:01,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:23:01,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:23:01,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:23:01,951 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:23:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:23:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 16963082, now seen corresponding path program 1 times [2025-03-04 15:23:01,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:23:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110234869] [2025-03-04 15:23:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:23:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:23:01,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:01,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:01,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:01,970 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:23:01,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:23:01,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:23:01,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:23:01,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:23:01,991 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:23:01,992 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:23:01,992 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 21 remaining) [2025-03-04 15:23:01,994 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 21 remaining) [2025-03-04 15:23:01,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 21 remaining) [2025-03-04 15:23:01,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 21 remaining) [2025-03-04 15:23:01,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 21 remaining) [2025-03-04 15:23:01,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 21 remaining) [2025-03-04 15:23:01,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 21 remaining) [2025-03-04 15:23:01,995 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 21 remaining) [2025-03-04 15:23:01,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 21 remaining) [2025-03-04 15:23:01,996 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 21 remaining) [2025-03-04 15:23:01,997 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 21 remaining) [2025-03-04 15:23:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:23:01,998 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 15:23:02,014 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:23:02,015 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:23:02,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:23:02 BasicIcfg [2025-03-04 15:23:02,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:23:02,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:23:02,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:23:02,019 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:23:02,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:23:00" (3/4) ... [2025-03-04 15:23:02,021 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 15:23:02,054 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-03-04 15:23:02,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:23:02,083 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:23:02,083 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:23:02,084 INFO L158 Benchmark]: Toolchain (without parser) took 2858.29ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 107.9MB in the beginning and 212.1MB in the end (delta: -104.2MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2025-03-04 15:23:02,084 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:23:02,084 INFO L158 Benchmark]: CACSL2BoogieTranslator took 469.18ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 78.6MB in the end (delta: 29.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 15:23:02,084 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.90ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:23:02,084 INFO L158 Benchmark]: Boogie Preprocessor took 39.38ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:23:02,085 INFO L158 Benchmark]: IcfgBuilder took 626.48ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 95.0MB in the end (delta: -20.6MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. [2025-03-04 15:23:02,089 INFO L158 Benchmark]: TraceAbstraction took 1607.98ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 94.3MB in the beginning and 218.4MB in the end (delta: -124.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2025-03-04 15:23:02,089 INFO L158 Benchmark]: Witness Printer took 63.80ms. Allocated memory is still 285.2MB. Free memory was 218.4MB in the beginning and 212.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:23:02,090 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.16ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 469.18ms. Allocated memory is still 142.6MB. Free memory was 107.9MB in the beginning and 78.6MB in the end (delta: 29.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.90ms. Allocated memory is still 142.6MB. Free memory was 78.6MB in the beginning and 76.6MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.38ms. Allocated memory is still 142.6MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 626.48ms. Allocated memory is still 142.6MB. Free memory was 74.5MB in the beginning and 95.0MB in the end (delta: -20.6MB). Peak memory consumption was 48.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1607.98ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 94.3MB in the beginning and 218.4MB in the end (delta: -124.1MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. * Witness Printer took 63.80ms. Allocated memory is still 285.2MB. Free memory was 218.4MB in the beginning and 212.1MB in the end (delta: 6.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: integer overflow possible integer overflow possible We found a FailurePath: [L1004] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1004] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1004] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1004] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1004] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1004] pthread_mutex_t __global_lock = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1006-L1010] struct s { int datum; struct q inside; pthread_mutex_t mutex; } A, B; [L1020] int x = __VERIFIER_nondet_int(); [L1021] struct s *s; [L1022] int *d; [L1023] pthread_mutex_t *m; VAL [A={4:0}, B={5:0}, __global_lock={3:0}, x=2147483647] [L1024] COND TRUE \read(x) [L1025] s = &A [L1026] x++ VAL [A={4:0}, B={5:0}, __global_lock={3:0}, s={4:0}, x=2147483647] - UnprovableResult [Line: 1029]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 124 locations, 21 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 59 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 5 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 418 IncrementalHoareTripleChecker+Invalid, 422 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 3 mSDtfsCounter, 418 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233occurred in iteration=0, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 21 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-03-04 15:23:02,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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(OVERFLOW)