./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-overflow.prp --file ../../../trunk/examples/svcomp/goblint-regression/04-mutex_17a-ps_add1_nr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version da043454 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 ../../../trunk/examples/svcomp/goblint-regression/04-mutex_17a-ps_add1_nr.c -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 90feb727e6b3b4475419ce7b207020c06b990f939765556387fbc3d70d96bec5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:00:45,809 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:00:45,855 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-04-29 11:00:45,858 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:00:45,859 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:00:45,875 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:00:45,876 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:00:45,876 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:00:45,876 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:00:45,876 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:00:45,876 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:00:45,876 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:00:45,876 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:00:45,876 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:00:45,876 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:00:45,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:00:45,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:00:45,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:45,877 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:45,878 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:45,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:00:45,878 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:00:45,878 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 -> 90feb727e6b3b4475419ce7b207020c06b990f939765556387fbc3d70d96bec5 [2025-04-29 11:00:46,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:00:46,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:00:46,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:00:46,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:00:46,121 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:00:46,123 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/04-mutex_17a-ps_add1_nr.c [2025-04-29 11:00:47,402 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ecedb54d/216d22b48d904a4293539624e21fcf48/FLAG5e0a4881b [2025-04-29 11:00:47,592 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:00:47,592 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/04-mutex_17a-ps_add1_nr.c [2025-04-29 11:00:47,593 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:47,593 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:47,593 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:00:47,596 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ecedb54d/216d22b48d904a4293539624e21fcf48/FLAG5e0a4881b [2025-04-29 11:00:48,452 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3ecedb54d/216d22b48d904a4293539624e21fcf48 [2025-04-29 11:00:48,454 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:00:48,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:00:48,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:48,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:00:48,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:00:48,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bd34b37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48, skipping insertion in model container [2025-04-29 11:00:48,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,473 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:00:48,615 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:48,623 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:00:48,645 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:00:48,662 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:00:48,664 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48 WrapperNode [2025-04-29 11:00:48,664 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:00:48,665 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:48,665 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:00:48,665 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:00:48,669 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,677 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,690 INFO L138 Inliner]: procedures = 12, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 50 [2025-04-29 11:00:48,691 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:00:48,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:00:48,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:00:48,692 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:00:48,697 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,697 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,699 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,707 INFO L175 MemorySlicer]: Split 1 memory accesses to 1 slices as follows [1]. 100 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1]. The 0 writes are split as follows [0]. [2025-04-29 11:00:48,707 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,707 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,713 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,713 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,717 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,718 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,720 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:00:48,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:00:48,722 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:00:48,722 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:00:48,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (1/1) ... [2025-04-29 11:00:48,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:00:48,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:00:48,743 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-04-29 11:00:48,744 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-04-29 11:00:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:00:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:00:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:00:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:00:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:00:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-29 11:00:48,759 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:00:48,759 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:00:48,760 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:00:48,811 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:00:48,812 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:00:48,902 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:00:48,902 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:00:48,974 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:00:48,974 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:00:48,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:48 BoogieIcfgContainer [2025-04-29 11:00:48,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:00:48,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:00:48,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:00:48,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:00:48,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:00:48" (1/3) ... [2025-04-29 11:00:48,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fd0cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:48, skipping insertion in model container [2025-04-29 11:00:48,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:00:48" (2/3) ... [2025-04-29 11:00:48,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fd0cb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:00:48, skipping insertion in model container [2025-04-29 11:00:48,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:48" (3/3) ... [2025-04-29 11:00:48,983 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_17a-ps_add1_nr.c [2025-04-29 11:00:48,992 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:00:48,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_17a-ps_add1_nr.c that has 2 procedures, 38 locations, 39 edges, 1 initial locations, 0 loop locations, and 10 error locations. [2025-04-29 11:00:48,994 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:00:49,030 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:00:49,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 40 transitions, 84 flow [2025-04-29 11:00:49,080 INFO L116 PetriNetUnfolderBase]: 3/39 cut-off events. [2025-04-29 11:00:49,082 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:49,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 3/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 37. Up to 2 conditions per place. [2025-04-29 11:00:49,084 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 40 transitions, 84 flow [2025-04-29 11:00:49,087 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 39 transitions, 81 flow [2025-04-29 11:00:49,095 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:00:49,104 INFO L340 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;@322b4dbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:00:49,105 INFO L341 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-04-29 11:00:49,109 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:00:49,109 INFO L116 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-04-29 11:00:49,109 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:49,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:49,110 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:49,110 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:00:49,114 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:49,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1725310089, now seen corresponding path program 1 times [2025-04-29 11:00:49,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:49,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528291786] [2025-04-29 11:00:49,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:49,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:49,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:49,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:49,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:49,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:49,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:49,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:49,231 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528291786] [2025-04-29 11:00:49,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528291786] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:49,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:49,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:49,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14642858] [2025-04-29 11:00:49,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:49,240 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:49,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:49,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:49,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-04-29 11:00:49,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04-29 11:00:49,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:49,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-04-29 11:00:49,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:49,445 INFO L116 PetriNetUnfolderBase]: 140/395 cut-off events. [2025-04-29 11:00:49,446 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:00:49,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 395 events. 140/395 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2141 event pairs, 60 based on Foata normal form. 12/351 useless extension candidates. Maximal degree in co-relation 670. Up to 152 conditions per place. [2025-04-29 11:00:49,450 INFO L140 encePairwiseOnDemand]: 29/40 looper letters, 40 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2025-04-29 11:00:49,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 64 transitions, 229 flow [2025-04-29 11:00:49,451 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:49,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:49,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2025-04-29 11:00:49,459 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.655 [2025-04-29 11:00:49,460 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 81 flow. Second operand 5 states and 131 transitions. [2025-04-29 11:00:49,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 64 transitions, 229 flow [2025-04-29 11:00:49,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 64 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:49,467 INFO L231 Difference]: Finished difference. Result has 46 places, 46 transitions, 147 flow [2025-04-29 11:00:49,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=46, PETRI_TRANSITIONS=46} [2025-04-29 11:00:49,471 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-04-29 11:00:49,472 INFO L485 AbstractCegarLoop]: Abstraction has has 46 places, 46 transitions, 147 flow [2025-04-29 11:00:49,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04-29 11:00:49,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:49,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:49,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:00:49,474 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:00:49,475 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1726390644, now seen corresponding path program 1 times [2025-04-29 11:00:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:49,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145065285] [2025-04-29 11:00:49,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:49,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-29 11:00:49,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-29 11:00:49,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:49,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:49,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:49,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:49,556 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145065285] [2025-04-29 11:00:49,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145065285] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:49,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:49,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:49,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599237690] [2025-04-29 11:00:49,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:49,557 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:49,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:49,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:49,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:49,567 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 40 [2025-04-29 11:00:49,568 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 46 transitions, 147 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-04-29 11:00:49,568 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:49,568 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 40 [2025-04-29 11:00:49,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:49,715 INFO L116 PetriNetUnfolderBase]: 167/475 cut-off events. [2025-04-29 11:00:49,715 INFO L117 PetriNetUnfolderBase]: For 143/157 co-relation queries the response was YES. [2025-04-29 11:00:49,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 992 conditions, 475 events. 167/475 cut-off events. For 143/157 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2767 event pairs, 60 based on Foata normal form. 31/448 useless extension candidates. Maximal degree in co-relation 981. Up to 139 conditions per place. [2025-04-29 11:00:49,718 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 48 selfloop transitions, 7 changer transitions 1/79 dead transitions. [2025-04-29 11:00:49,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 79 transitions, 371 flow [2025-04-29 11:00:49,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 152 transitions. [2025-04-29 11:00:49,719 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.76 [2025-04-29 11:00:49,719 INFO L175 Difference]: Start difference. First operand has 46 places, 46 transitions, 147 flow. Second operand 5 states and 152 transitions. [2025-04-29 11:00:49,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 79 transitions, 371 flow [2025-04-29 11:00:49,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 79 transitions, 371 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:00:49,721 INFO L231 Difference]: Finished difference. Result has 54 places, 51 transitions, 195 flow [2025-04-29 11:00:49,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=195, PETRI_PLACES=54, PETRI_TRANSITIONS=51} [2025-04-29 11:00:49,722 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 14 predicate places. [2025-04-29 11:00:49,722 INFO L485 AbstractCegarLoop]: Abstraction has has 54 places, 51 transitions, 195 flow [2025-04-29 11:00:49,722 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-04-29 11:00:49,722 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:49,722 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:49,722 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:00:49,722 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:00:49,723 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:49,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1978502628, now seen corresponding path program 1 times [2025-04-29 11:00:49,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:49,723 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706534619] [2025-04-29 11:00:49,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:49,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:49,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:49,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:49,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:49,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:49,755 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706534619] [2025-04-29 11:00:49,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706534619] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:49,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:49,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:49,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656407691] [2025-04-29 11:00:49,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:49,756 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:49,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:49,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:49,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:49,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 40 [2025-04-29 11:00:49,761 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 51 transitions, 195 flow. Second operand has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-04-29 11:00:49,761 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:49,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 40 [2025-04-29 11:00:49,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:49,850 INFO L116 PetriNetUnfolderBase]: 144/423 cut-off events. [2025-04-29 11:00:49,850 INFO L117 PetriNetUnfolderBase]: For 315/332 co-relation queries the response was YES. [2025-04-29 11:00:49,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 423 events. 144/423 cut-off events. For 315/332 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2415 event pairs, 38 based on Foata normal form. 34/436 useless extension candidates. Maximal degree in co-relation 1007. Up to 202 conditions per place. [2025-04-29 11:00:49,853 INFO L140 encePairwiseOnDemand]: 34/40 looper letters, 44 selfloop transitions, 7 changer transitions 8/82 dead transitions. [2025-04-29 11:00:49,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 82 transitions, 433 flow [2025-04-29 11:00:49,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:49,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:49,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 154 transitions. [2025-04-29 11:00:49,855 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.77 [2025-04-29 11:00:49,855 INFO L175 Difference]: Start difference. First operand has 54 places, 51 transitions, 195 flow. Second operand 5 states and 154 transitions. [2025-04-29 11:00:49,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 82 transitions, 433 flow [2025-04-29 11:00:49,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 82 transitions, 429 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:00:49,858 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 212 flow [2025-04-29 11:00:49,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=212, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2025-04-29 11:00:49,859 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2025-04-29 11:00:49,859 INFO L485 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 212 flow [2025-04-29 11:00:49,859 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.25) internal successors, (89), 4 states have internal predecessors, (89), 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-04-29 11:00:49,859 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:49,859 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:49,859 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:00:49,859 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:00:49,860 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:49,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1945005404, now seen corresponding path program 1 times [2025-04-29 11:00:49,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:49,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168985834] [2025-04-29 11:00:49,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:49,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:49,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:49,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:49,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:49,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:49,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:49,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168985834] [2025-04-29 11:00:49,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168985834] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:49,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:49,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:00:49,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868590847] [2025-04-29 11:00:49,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:49,913 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:49,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:49,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:49,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-04-29 11:00:49,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 212 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04-29 11:00:49,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:49,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-04-29 11:00:49,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:50,024 INFO L116 PetriNetUnfolderBase]: 177/497 cut-off events. [2025-04-29 11:00:50,024 INFO L117 PetriNetUnfolderBase]: For 517/521 co-relation queries the response was YES. [2025-04-29 11:00:50,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1329 conditions, 497 events. 177/497 cut-off events. For 517/521 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2853 event pairs, 99 based on Foata normal form. 7/471 useless extension candidates. Maximal degree in co-relation 1310. Up to 293 conditions per place. [2025-04-29 11:00:50,027 INFO L140 encePairwiseOnDemand]: 32/40 looper letters, 44 selfloop transitions, 7 changer transitions 2/68 dead transitions. [2025-04-29 11:00:50,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 68 transitions, 399 flow [2025-04-29 11:00:50,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:00:50,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-29 11:00:50,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2025-04-29 11:00:50,028 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.615 [2025-04-29 11:00:50,028 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 212 flow. Second operand 5 states and 123 transitions. [2025-04-29 11:00:50,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 68 transitions, 399 flow [2025-04-29 11:00:50,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 68 transitions, 379 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:50,031 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 214 flow [2025-04-29 11:00:50,031 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2025-04-29 11:00:50,032 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 20 predicate places. [2025-04-29 11:00:50,032 INFO L485 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 214 flow [2025-04-29 11:00:50,032 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04-29 11:00:50,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:50,032 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:50,032 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:00:50,032 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:00:50,032 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:50,033 INFO L85 PathProgramCache]: Analyzing trace with hash 1944950780, now seen corresponding path program 1 times [2025-04-29 11:00:50,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:50,033 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069837003] [2025-04-29 11:00:50,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:50,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:50,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:00:50,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:00:50,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:50,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:00:50,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:00:50,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:00:50,073 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069837003] [2025-04-29 11:00:50,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069837003] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:00:50,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:00:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:00:50,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331905848] [2025-04-29 11:00:50,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:00:50,074 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:00:50,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:00:50,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:00:50,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:00:50,094 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 16 out of 40 [2025-04-29 11:00:50,094 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04-29 11:00:50,094 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:00:50,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 16 of 40 [2025-04-29 11:00:50,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:00:50,181 INFO L116 PetriNetUnfolderBase]: 177/505 cut-off events. [2025-04-29 11:00:50,181 INFO L117 PetriNetUnfolderBase]: For 424/426 co-relation queries the response was YES. [2025-04-29 11:00:50,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 505 events. 177/505 cut-off events. For 424/426 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2869 event pairs, 86 based on Foata normal form. 8/479 useless extension candidates. Maximal degree in co-relation 1303. Up to 232 conditions per place. [2025-04-29 11:00:50,185 INFO L140 encePairwiseOnDemand]: 33/40 looper letters, 32 selfloop transitions, 9 changer transitions 6/62 dead transitions. [2025-04-29 11:00:50,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 62 transitions, 356 flow [2025-04-29 11:00:50,186 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:00:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:00:50,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-04-29 11:00:50,187 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.61875 [2025-04-29 11:00:50,187 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 214 flow. Second operand 4 states and 99 transitions. [2025-04-29 11:00:50,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 62 transitions, 356 flow [2025-04-29 11:00:50,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 62 transitions, 349 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:00:50,191 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 219 flow [2025-04-29 11:00:50,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=40, PETRI_DIFFERENCE_MINUEND_FLOW=201, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=219, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2025-04-29 11:00:50,192 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2025-04-29 11:00:50,192 INFO L485 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 219 flow [2025-04-29 11:00:50,192 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.5) internal successors, (70), 4 states have internal predecessors, (70), 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-04-29 11:00:50,192 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:00:50,192 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:00:50,192 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:00:50,192 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-04-29 11:00:50,193 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:00:50,193 INFO L85 PathProgramCache]: Analyzing trace with hash 163932233, now seen corresponding path program 1 times [2025-04-29 11:00:50,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:00:50,193 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534385682] [2025-04-29 11:00:50,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:00:50,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:00:50,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:00:50,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:00:50,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:50,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:00:50,208 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:00:50,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-29 11:00:50,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-29 11:00:50,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:00:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:00:50,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:00:50,226 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:00:50,226 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-04-29 11:00:50,228 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-04-29 11:00:50,229 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-04-29 11:00:50,229 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:00:50,229 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:00:50,255 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:00:50,256 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:00:50,261 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:00:50 BasicIcfg [2025-04-29 11:00:50,261 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:00:50,262 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:00:50,262 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:00:50,262 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:00:50,262 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:00:48" (3/4) ... [2025-04-29 11:00:50,263 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:00:50,300 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 2. [2025-04-29 11:00:50,328 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:00:50,328 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:00:50,328 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:00:50,329 INFO L158 Benchmark]: Toolchain (without parser) took 1873.78ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 127.6MB in the end (delta: -5.6MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:50,329 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:50,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 208.06ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:50,330 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:50,330 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:00:50,330 INFO L158 Benchmark]: RCFGBuilder took 252.78ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 87.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:50,330 INFO L158 Benchmark]: TraceAbstraction took 1285.56ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 42.9MB in the end (delta: 44.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2025-04-29 11:00:50,330 INFO L158 Benchmark]: Witness Printer took 66.64ms. Allocated memory is still 167.8MB. Free memory was 42.9MB in the beginning and 127.6MB in the end (delta: -84.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:00:50,331 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.26ms. Allocated memory is still 201.3MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 208.06ms. Allocated memory is still 167.8MB. Free memory was 121.9MB in the beginning and 108.3MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.15ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.7MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 167.8MB. Free memory was 106.7MB in the beginning and 105.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 252.78ms. Allocated memory is still 167.8MB. Free memory was 105.4MB in the beginning and 87.9MB in the end (delta: 17.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1285.56ms. Allocated memory is still 167.8MB. Free memory was 87.5MB in the beginning and 42.9MB in the end (delta: 44.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Witness Printer took 66.64ms. Allocated memory is still 167.8MB. Free memory was 42.9MB in the beginning and 127.6MB in the end (delta: -84.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 33]: integer overflow possible integer overflow possible We found a FailurePath: [L14] 0 int glob; [L15] 0 pthread_mutex_t m = PTHREAD_MUTEX_INITIALIZER; [L15] 0 pthread_mutex_t m = PTHREAD_MUTEX_INITIALIZER; [L25] 0 int i = __VERIFIER_nondet_int(); [L26] 0 pthread_t id; [L27] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, glob=0, i=2147483647, id=-1, m={1:0}] [L30] COND TRUE 0 \read(i) VAL [\at(arg, Pre)={0:0}, glob=0, i=2147483647, id=-1, m={1:0}] [L33] 0 i++ VAL [\at(arg, Pre)={0:0}, glob=0, i=2147483647, id=-1, m={1:0}] - UnprovableResult [Line: 33]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 35]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 37]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 27]: 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: 19]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 19]: 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, 49 locations, 50 edges, 13 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.2s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 157 mSDsluCounter, 28 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 386 IncrementalHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 7 mSDtfsCounter, 386 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=5, InterpolantAutomatonStates: 24, 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.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 41 NumberOfCodeBlocks, 41 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 28 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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-04-29 11:00:50,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)