./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_42-trylock_2mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/04-mutex_42-trylock_2mutex.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 29686c593874684b7702dd35cbbbd25416d0d0dde1b2c7e324de66da32235cfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:33:12,354 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:33:12,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:33:12,407 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:33:12,407 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:33:12,431 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:33:12,432 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:33:12,432 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:33:12,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:33:12,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:33:12,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:33:12,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:33:12,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:33:12,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:33:12,432 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:33:12,433 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:33:12,433 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:33:12,434 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:33:12,434 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:33:12,434 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:33:12,434 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:33:12,434 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:33:12,435 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:12,435 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:33:12,435 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:33:12,436 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:33:12,436 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:33:12,436 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:33:12,436 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:33:12,436 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 -> 29686c593874684b7702dd35cbbbd25416d0d0dde1b2c7e324de66da32235cfd [2025-03-09 06:33:12,652 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:33:12,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:33:12,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:33:12,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:33:12,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:33:12,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_42-trylock_2mutex.i [2025-03-09 06:33:13,840 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0640725e4/9c672ea5173a4830be590e3682800e86/FLAG0291b2eca [2025-03-09 06:33:14,114 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:33:14,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_42-trylock_2mutex.i [2025-03-09 06:33:14,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0640725e4/9c672ea5173a4830be590e3682800e86/FLAG0291b2eca [2025-03-09 06:33:14,141 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0640725e4/9c672ea5173a4830be590e3682800e86 [2025-03-09 06:33:14,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:33:14,147 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:33:14,148 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:14,148 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:33:14,153 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:33:14,154 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,154 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5926d4bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14, skipping insertion in model container [2025-03-09 06:33:14,154 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:33:14,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:14,405 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:33:14,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:33:14,478 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:33:14,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14 WrapperNode [2025-03-09 06:33:14,479 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:33:14,480 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:14,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:33:14,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:33:14,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,491 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,501 INFO L138 Inliner]: procedures = 163, calls = 25, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2025-03-09 06:33:14,502 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:33:14,502 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:33:14,502 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:33:14,502 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:33:14,508 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,508 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,516 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [5, 5]. 50 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5]. The 0 writes are split as follows [0, 0]. [2025-03-09 06:33:14,516 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,520 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,521 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,522 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,524 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:33:14,530 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:33:14,530 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:33:14,530 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:33:14,532 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (1/1) ... [2025-03-09 06:33:14,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:33:14,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:14,559 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-09 06:33:14,562 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-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-09 06:33:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexTryLock [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:33:14,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:33:14,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:33:14,579 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:33:14,675 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:33:14,677 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:33:14,818 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:33:14,818 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:33:14,892 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:33:14,892 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:33:14,893 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:14 BoogieIcfgContainer [2025-03-09 06:33:14,893 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:33:14,895 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:33:14,895 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:33:14,898 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:33:14,899 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:33:14" (1/3) ... [2025-03-09 06:33:14,900 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243d996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:14, skipping insertion in model container [2025-03-09 06:33:14,900 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:33:14" (2/3) ... [2025-03-09 06:33:14,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@243d996 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:33:14, skipping insertion in model container [2025-03-09 06:33:14,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:14" (3/3) ... [2025-03-09 06:33:14,902 INFO L128 eAbstractionObserver]: Analyzing ICFG 04-mutex_42-trylock_2mutex.i [2025-03-09 06:33:14,912 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:33:14,914 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 04-mutex_42-trylock_2mutex.i that has 2 procedures, 40 locations, 1 initial locations, 1 loop locations, and 6 error locations. [2025-03-09 06:33:14,914 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:33:14,947 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:33:14,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 43 places, 41 transitions, 89 flow [2025-03-09 06:33:14,999 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2025-03-09 06:33:15,001 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:33:15,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 40 events. 2/40 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 71 event pairs, 0 based on Foata normal form. 0/32 useless extension candidates. Maximal degree in co-relation 36. Up to 2 conditions per place. [2025-03-09 06:33:15,011 INFO L82 GeneralOperation]: Start removeDead. Operand has 43 places, 41 transitions, 89 flow [2025-03-09 06:33:15,014 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 40 places, 38 transitions, 79 flow [2025-03-09 06:33:15,020 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:33:15,030 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;@1e5ccce0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:33:15,030 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-09 06:33:15,035 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:33:15,035 INFO L124 PetriNetUnfolderBase]: 1/12 cut-off events. [2025-03-09 06:33:15,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:15,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:15,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-09 06:33:15,036 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:15,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:15,040 INFO L85 PathProgramCache]: Analyzing trace with hash 1893147753, now seen corresponding path program 1 times [2025-03-09 06:33:15,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:15,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699339167] [2025-03-09 06:33:15,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:15,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:15,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-09 06:33:15,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-09 06:33:15,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:15,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:15,273 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-09 06:33:15,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699339167] [2025-03-09 06:33:15,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699339167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:15,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:15,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:15,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968118216] [2025-03-09 06:33:15,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:15,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:15,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:15,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:15,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:15,320 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-09 06:33:15,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 38 transitions, 79 flow. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 06:33:15,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:15,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-09 06:33:15,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:15,480 INFO L124 PetriNetUnfolderBase]: 98/288 cut-off events. [2025-03-09 06:33:15,480 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:33:15,481 INFO L83 FinitePrefix]: Finished finitePrefix Result has 509 conditions, 288 events. 98/288 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1384 event pairs, 31 based on Foata normal form. 11/275 useless extension candidates. Maximal degree in co-relation 500. Up to 175 conditions per place. [2025-03-09 06:33:15,487 INFO L140 encePairwiseOnDemand]: 34/41 looper letters, 39 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-03-09 06:33:15,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 211 flow [2025-03-09 06:33:15,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:15,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2025-03-09 06:33:15,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6195121951219512 [2025-03-09 06:33:15,502 INFO L175 Difference]: Start difference. First operand has 40 places, 38 transitions, 79 flow. Second operand 5 states and 127 transitions. [2025-03-09 06:33:15,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 211 flow [2025-03-09 06:33:15,506 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:15,510 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 120 flow [2025-03-09 06:33:15,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=120, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2025-03-09 06:33:15,515 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-09 06:33:15,516 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 120 flow [2025-03-09 06:33:15,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-09 06:33:15,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:15,517 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:15,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:33:15,517 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:15,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1433208674, now seen corresponding path program 1 times [2025-03-09 06:33:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:15,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28741440] [2025-03-09 06:33:15,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:15,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:15,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:33:15,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:33:15,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:15,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:15,582 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-09 06:33:15,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:15,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28741440] [2025-03-09 06:33:15,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28741440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:15,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:15,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:33:15,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42175994] [2025-03-09 06:33:15,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:15,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:15,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:15,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:15,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:15,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 41 [2025-03-09 06:33:15,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-09 06:33:15,588 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:15,588 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 41 [2025-03-09 06:33:15,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:15,664 INFO L124 PetriNetUnfolderBase]: 106/306 cut-off events. [2025-03-09 06:33:15,664 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-03-09 06:33:15,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 608 conditions, 306 events. 106/306 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1474 event pairs, 60 based on Foata normal form. 14/296 useless extension candidates. Maximal degree in co-relation 595. Up to 148 conditions per place. [2025-03-09 06:33:15,666 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 33 selfloop transitions, 2 changer transitions 3/52 dead transitions. [2025-03-09 06:33:15,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 52 transitions, 218 flow [2025-03-09 06:33:15,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:15,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2025-03-09 06:33:15,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6504065040650406 [2025-03-09 06:33:15,667 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 120 flow. Second operand 3 states and 80 transitions. [2025-03-09 06:33:15,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 52 transitions, 218 flow [2025-03-09 06:33:15,669 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 52 transitions, 218 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-09 06:33:15,670 INFO L231 Difference]: Finished difference. Result has 49 places, 42 transitions, 130 flow [2025-03-09 06:33:15,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=49, PETRI_TRANSITIONS=42} [2025-03-09 06:33:15,671 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 9 predicate places. [2025-03-09 06:33:15,671 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 42 transitions, 130 flow [2025-03-09 06:33:15,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 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-09 06:33:15,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:15,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:15,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:33:15,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:15,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:15,671 INFO L85 PathProgramCache]: Analyzing trace with hash 2004289164, now seen corresponding path program 1 times [2025-03-09 06:33:15,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:15,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264875333] [2025-03-09 06:33:15,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:15,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:15,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-09 06:33:15,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-09 06:33:15,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:15,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:15,757 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-09 06:33:15,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:15,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264875333] [2025-03-09 06:33:15,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264875333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:15,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:15,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:33:15,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648660293] [2025-03-09 06:33:15,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:15,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:33:15,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:15,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:33:15,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:33:15,775 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-09 06:33:15,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 42 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-09 06:33:15,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:15,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-09 06:33:15,776 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:15,860 INFO L124 PetriNetUnfolderBase]: 106/284 cut-off events. [2025-03-09 06:33:15,860 INFO L125 PetriNetUnfolderBase]: For 70/70 co-relation queries the response was YES. [2025-03-09 06:33:15,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 617 conditions, 284 events. 106/284 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1280 event pairs, 50 based on Foata normal form. 22/293 useless extension candidates. Maximal degree in co-relation 601. Up to 126 conditions per place. [2025-03-09 06:33:15,862 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 35 selfloop transitions, 3 changer transitions 10/60 dead transitions. [2025-03-09 06:33:15,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 266 flow [2025-03-09 06:33:15,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:33:15,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:33:15,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 97 transitions. [2025-03-09 06:33:15,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5914634146341463 [2025-03-09 06:33:15,865 INFO L175 Difference]: Start difference. First operand has 49 places, 42 transitions, 130 flow. Second operand 4 states and 97 transitions. [2025-03-09 06:33:15,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 266 flow [2025-03-09 06:33:15,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 60 transitions, 262 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:33:15,866 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 109 flow [2025-03-09 06:33:15,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=109, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2025-03-09 06:33:15,867 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 8 predicate places. [2025-03-09 06:33:15,867 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 109 flow [2025-03-09 06:33:15,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-09 06:33:15,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:15,867 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:15,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:33:15,869 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:15,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:15,869 INFO L85 PathProgramCache]: Analyzing trace with hash 375491271, now seen corresponding path program 1 times [2025-03-09 06:33:15,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:15,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056857201] [2025-03-09 06:33:15,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:15,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:15,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:33:15,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:33:15,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:15,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:15,946 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-09 06:33:15,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:15,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056857201] [2025-03-09 06:33:15,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056857201] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:15,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:15,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:15,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811111810] [2025-03-09 06:33:15,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:15,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:33:15,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:15,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:33:15,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:33:15,948 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 41 [2025-03-09 06:33:15,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09 06:33:15,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:15,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 41 [2025-03-09 06:33:15,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:16,023 INFO L124 PetriNetUnfolderBase]: 51/177 cut-off events. [2025-03-09 06:33:16,024 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-09 06:33:16,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 373 conditions, 177 events. 51/177 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 749 event pairs, 12 based on Foata normal form. 12/178 useless extension candidates. Maximal degree in co-relation 357. Up to 72 conditions per place. [2025-03-09 06:33:16,027 INFO L140 encePairwiseOnDemand]: 33/41 looper letters, 26 selfloop transitions, 8 changer transitions 0/48 dead transitions. [2025-03-09 06:33:16,027 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 208 flow [2025-03-09 06:33:16,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:33:16,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:33:16,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2025-03-09 06:33:16,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7073170731707317 [2025-03-09 06:33:16,029 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 109 flow. Second operand 3 states and 87 transitions. [2025-03-09 06:33:16,029 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 208 flow [2025-03-09 06:33:16,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 48 transitions, 191 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-09 06:33:16,032 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 132 flow [2025-03-09 06:33:16,032 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-09 06:33:16,032 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2025-03-09 06:33:16,033 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 132 flow [2025-03-09 06:33:16,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-09 06:33:16,033 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:16,033 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:16,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:33:16,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:16,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:16,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1320383400, now seen corresponding path program 1 times [2025-03-09 06:33:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:16,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028980963] [2025-03-09 06:33:16,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:16,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:16,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:33:16,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:33:16,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:16,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:16,094 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-09 06:33:16,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:16,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028980963] [2025-03-09 06:33:16,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028980963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:16,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:16,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621542514] [2025-03-09 06:33:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:16,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:33:16,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:16,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:33:16,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:33:16,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-09 06:33:16,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 132 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-09 06:33:16,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:16,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-09 06:33:16,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:16,200 INFO L124 PetriNetUnfolderBase]: 56/187 cut-off events. [2025-03-09 06:33:16,201 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2025-03-09 06:33:16,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 448 conditions, 187 events. 56/187 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 762 event pairs, 30 based on Foata normal form. 3/179 useless extension candidates. Maximal degree in co-relation 434. Up to 76 conditions per place. [2025-03-09 06:33:16,203 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 33 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-03-09 06:33:16,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 235 flow [2025-03-09 06:33:16,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:16,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 100 transitions. [2025-03-09 06:33:16,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4878048780487805 [2025-03-09 06:33:16,205 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 132 flow. Second operand 5 states and 100 transitions. [2025-03-09 06:33:16,205 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 235 flow [2025-03-09 06:33:16,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 222 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:33:16,206 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 128 flow [2025-03-09 06:33:16,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=128, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2025-03-09 06:33:16,207 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 7 predicate places. [2025-03-09 06:33:16,207 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 128 flow [2025-03-09 06:33:16,207 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-09 06:33:16,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:16,207 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:16,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:33:16,207 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:16,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:16,210 INFO L85 PathProgramCache]: Analyzing trace with hash 813702357, now seen corresponding path program 1 times [2025-03-09 06:33:16,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:16,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96495473] [2025-03-09 06:33:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:16,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:16,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:33:16,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:33:16,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:16,274 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-09 06:33:16,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96495473] [2025-03-09 06:33:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96495473] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746474831] [2025-03-09 06:33:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:33:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:16,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:33:16,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:33:16,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-09 06:33:16,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 128 flow. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-09 06:33:16,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:16,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-09 06:33:16,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:16,363 INFO L124 PetriNetUnfolderBase]: 59/185 cut-off events. [2025-03-09 06:33:16,363 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-03-09 06:33:16,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 185 events. 59/185 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 709 event pairs, 22 based on Foata normal form. 3/178 useless extension candidates. Maximal degree in co-relation 419. Up to 79 conditions per place. [2025-03-09 06:33:16,365 INFO L140 encePairwiseOnDemand]: 36/41 looper letters, 32 selfloop transitions, 4 changer transitions 9/53 dead transitions. [2025-03-09 06:33:16,365 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 53 transitions, 256 flow [2025-03-09 06:33:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 105 transitions. [2025-03-09 06:33:16,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5121951219512195 [2025-03-09 06:33:16,366 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 128 flow. Second operand 5 states and 105 transitions. [2025-03-09 06:33:16,366 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 53 transitions, 256 flow [2025-03-09 06:33:16,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 244 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:33:16,368 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 96 flow [2025-03-09 06:33:16,369 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=96, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2025-03-09 06:33:16,369 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2025-03-09 06:33:16,369 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 96 flow [2025-03-09 06:33:16,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 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-09 06:33:16,369 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:16,369 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:16,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:33:16,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:16,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:16,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1032268920, now seen corresponding path program 1 times [2025-03-09 06:33:16,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:16,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305253124] [2025-03-09 06:33:16,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:16,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:16,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:33:16,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:33:16,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:16,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:16,435 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-09 06:33:16,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:16,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305253124] [2025-03-09 06:33:16,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305253124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:16,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:16,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:16,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671539215] [2025-03-09 06:33:16,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:16,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:33:16,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:16,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:33:16,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:33:16,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-09 06:33:16,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 96 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-09 06:33:16,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:16,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-09 06:33:16,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:16,529 INFO L124 PetriNetUnfolderBase]: 51/159 cut-off events. [2025-03-09 06:33:16,530 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-03-09 06:33:16,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 364 conditions, 159 events. 51/159 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 544 event pairs, 20 based on Foata normal form. 5/153 useless extension candidates. Maximal degree in co-relation 351. Up to 67 conditions per place. [2025-03-09 06:33:16,531 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 32 selfloop transitions, 3 changer transitions 0/43 dead transitions. [2025-03-09 06:33:16,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 43 transitions, 202 flow [2025-03-09 06:33:16,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:16,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 99 transitions. [2025-03-09 06:33:16,532 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48292682926829267 [2025-03-09 06:33:16,532 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 96 flow. Second operand 5 states and 99 transitions. [2025-03-09 06:33:16,532 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 43 transitions, 202 flow [2025-03-09 06:33:16,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 43 transitions, 190 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:33:16,534 INFO L231 Difference]: Finished difference. Result has 36 places, 29 transitions, 86 flow [2025-03-09 06:33:16,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=36, PETRI_TRANSITIONS=29} [2025-03-09 06:33:16,534 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2025-03-09 06:33:16,534 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 29 transitions, 86 flow [2025-03-09 06:33:16,534 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-09 06:33:16,535 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:16,536 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:16,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:33:16,536 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-03-09 06:33:16,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:16,536 INFO L85 PathProgramCache]: Analyzing trace with hash 716517863, now seen corresponding path program 1 times [2025-03-09 06:33:16,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:16,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598519674] [2025-03-09 06:33:16,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:33:16,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:16,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:33:16,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:33:16,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:33:16,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:16,606 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-09 06:33:16,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:16,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598519674] [2025-03-09 06:33:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598519674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:33:16,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:33:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:33:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729334089] [2025-03-09 06:33:16,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:33:16,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:33:16,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:16,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:33:16,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:33:16,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 41 [2025-03-09 06:33:16,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 29 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-09 06:33:16,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:16,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 41 [2025-03-09 06:33:16,618 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:16,670 INFO L124 PetriNetUnfolderBase]: 48/151 cut-off events. [2025-03-09 06:33:16,670 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-09 06:33:16,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 340 conditions, 151 events. 48/151 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 502 event pairs, 17 based on Foata normal form. 5/145 useless extension candidates. Maximal degree in co-relation 328. Up to 59 conditions per place. [2025-03-09 06:33:16,670 INFO L140 encePairwiseOnDemand]: 37/41 looper letters, 0 selfloop transitions, 0 changer transitions 42/42 dead transitions. [2025-03-09 06:33:16,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 42 transitions, 190 flow [2025-03-09 06:33:16,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:33:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:33:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2025-03-09 06:33:16,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47804878048780486 [2025-03-09 06:33:16,675 INFO L175 Difference]: Start difference. First operand has 36 places, 29 transitions, 86 flow. Second operand 5 states and 98 transitions. [2025-03-09 06:33:16,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 42 transitions, 190 flow [2025-03-09 06:33:16,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 42 transitions, 183 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:33:16,675 INFO L231 Difference]: Finished difference. Result has 35 places, 0 transitions, 0 flow [2025-03-09 06:33:16,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=41, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=35, PETRI_TRANSITIONS=0} [2025-03-09 06:33:16,676 INFO L279 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2025-03-09 06:33:16,676 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 0 transitions, 0 flow [2025-03-09 06:33:16,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 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-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-09 06:33:16,678 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-09 06:33:16,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:33:16,678 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:33:16,684 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-09 06:33:16,684 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-09 06:33:16,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.03 06:33:16 BasicIcfg [2025-03-09 06:33:16,690 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-09 06:33:16,691 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-09 06:33:16,691 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-09 06:33:16,691 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-09 06:33:16,691 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:33:14" (3/4) ... [2025-03-09 06:33:16,692 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-09 06:33:16,694 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-03-09 06:33:16,696 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-09 06:33:16,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2025-03-09 06:33:16,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-09 06:33:16,697 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-09 06:33:16,753 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-09 06:33:16,754 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-09 06:33:16,754 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-09 06:33:16,754 INFO L158 Benchmark]: Toolchain (without parser) took 2607.61ms. Allocated memory is still 142.6MB. Free memory was 108.1MB in the beginning and 75.8MB in the end (delta: 32.4MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-03-09 06:33:16,754 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:16,755 INFO L158 Benchmark]: CACSL2BoogieTranslator took 331.48ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 88.3MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:33:16,755 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.00ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:16,755 INFO L158 Benchmark]: Boogie Preprocessor took 22.11ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 85.4MB in the end (delta: 973.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:16,756 INFO L158 Benchmark]: IcfgBuilder took 363.38ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 63.1MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-09 06:33:16,756 INFO L158 Benchmark]: TraceAbstraction took 1795.07ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 81.0MB in the end (delta: -18.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-09 06:33:16,756 INFO L158 Benchmark]: Witness Printer took 62.90ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 75.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-09 06:33:16,757 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.18ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 331.48ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 88.3MB in the end (delta: 18.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.00ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 86.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 22.11ms. Allocated memory is still 142.6MB. Free memory was 86.3MB in the beginning and 85.4MB in the end (delta: 973.5kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 363.38ms. Allocated memory is still 142.6MB. Free memory was 85.4MB in the beginning and 63.1MB in the end (delta: 22.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 1795.07ms. Allocated memory is still 142.6MB. Free memory was 62.1MB in the beginning and 81.0MB in the end (delta: -18.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 62.90ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 75.8MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 699]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 699]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 684]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 684]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 687]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 687]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 59 locations, 60 edges, 11 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.7s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 197 mSDsluCounter, 68 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 582 IncrementalHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 19 mSDtfsCounter, 582 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=132occurred in iteration=4, InterpolantAutomatonStates: 35, 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.5s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 99 ConstructedInterpolants, 0 QuantifiedInterpolants, 285 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-09 06:33:16,770 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 Result: TRUE