/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.positions.where.we.compute.the.hoare.annotation All --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.signed.integer.overflows ASSERTandASSUME -i ../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.empire2-owicki-f61efc6-m [2025-03-15 01:39:49,677 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-15 01:39:49,726 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2025-03-15 01:39:49,757 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-15 01:39:49,759 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-15 01:39:49,759 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-15 01:39:49,760 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Use SBE=true [2025-03-15 01:39:49,760 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-15 01:39:49,760 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-15 01:39:49,761 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * To the following directory=./dump/ [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:39:49,761 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-15 01:39:49,761 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of signed integer overflows -> ASSERTandASSUME [2025-03-15 01:39:50,042 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-15 01:39:50,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-15 01:39:50,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-15 01:39:50,055 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-15 01:39:50,056 INFO L274 PluginConnector]: CDTParser initialized [2025-03-15 01:39:50,056 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-03-15 01:39:51,248 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a13d6962/a29b3ed3de65406a8f03cbe4e08dd08a/FLAGd9444e6d4 [2025-03-15 01:39:51,505 INFO L384 CDTParser]: Found 1 translation units. [2025-03-15 01:39:51,506 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_1-container_of.i [2025-03-15 01:39:51,530 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a13d6962/a29b3ed3de65406a8f03cbe4e08dd08a/FLAGd9444e6d4 [2025-03-15 01:39:51,826 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a13d6962/a29b3ed3de65406a8f03cbe4e08dd08a [2025-03-15 01:39:51,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-15 01:39:51,829 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-03-15 01:39:51,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-15 01:39:51,830 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-15 01:39:51,833 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-15 01:39:51,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:39:51" (1/1) ... [2025-03-15 01:39:51,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aee873c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:51, skipping insertion in model container [2025-03-15 01:39:51,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.03 01:39:51" (1/1) ... [2025-03-15 01:39:51,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-15 01:39:52,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:39:52,243 INFO L200 MainTranslator]: Completed pre-run [2025-03-15 01:39:52,304 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-15 01:39:52,354 INFO L204 MainTranslator]: Completed translation [2025-03-15 01:39:52,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52 WrapperNode [2025-03-15 01:39:52,356 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-15 01:39:52,357 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-15 01:39:52,357 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-15 01:39:52,357 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-15 01:39:52,362 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,376 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,398 INFO L138 Inliner]: procedures = 246, calls = 40, calls flagged for inlining = 13, calls inlined = 18, statements flattened = 144 [2025-03-15 01:39:52,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-15 01:39:52,399 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-15 01:39:52,399 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-15 01:39:52,399 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-15 01:39:52,404 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,416 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,418 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,426 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-15 01:39:52,427 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-03-15 01:39:52,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-03-15 01:39:52,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-03-15 01:39:52,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (1/1) ... [2025-03-15 01:39:52,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-03-15 01:39:52,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-15 01:39:52,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-03-15 01:39:52,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-03-15 01:39:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-15 01:39:52,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-15 01:39:52,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-15 01:39:52,491 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-15 01:39:52,694 INFO L234 CfgBuilder]: Building ICFG [2025-03-15 01:39:52,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-15 01:39:52,893 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-15 01:39:52,893 INFO L283 CfgBuilder]: Performing block encoding [2025-03-15 01:39:52,905 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-15 01:39:52,905 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-15 01:39:52,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:39:52 BoogieIcfgContainer [2025-03-15 01:39:52,905 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-03-15 01:39:52,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-15 01:39:52,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-15 01:39:52,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-15 01:39:52,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.03 01:39:51" (1/3) ... [2025-03-15 01:39:52,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fd1511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:39:52, skipping insertion in model container [2025-03-15 01:39:52,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.03 01:39:52" (2/3) ... [2025-03-15 01:39:52,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25fd1511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.03 01:39:52, skipping insertion in model container [2025-03-15 01:39:52,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.03 01:39:52" (3/3) ... [2025-03-15 01:39:52,912 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_1-container_of.i [2025-03-15 01:39:52,922 INFO L303 ceAbstractionStarter]: Automizer settings: Hoare:All NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-15 01:39:52,923 INFO L169 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_1-container_of.i that has 2 procedures, 186 locations, 1 initial locations, 0 loop locations, and 2 error locations. [2025-03-15 01:39:52,924 INFO L581 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-15 01:39:52,966 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-15 01:39:53,009 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-15 01:39:53,016 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=All, 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;@445a22f9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-15 01:39:53,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-03-15 01:39:53,054 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-15 01:39:53,055 INFO L124 PetriNetUnfolderBase]: 4/129 cut-off events. [2025-03-15 01:39:53,056 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-15 01:39:53,056 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:53,057 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:53,057 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:39:53,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1166781406, now seen corresponding path program 1 times [2025-03-15 01:39:53,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:53,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246903227] [2025-03-15 01:39:53,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:53,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:54,523 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-15 01:39:54,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:54,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246903227] [2025-03-15 01:39:54,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246903227] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:54,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:54,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:39:54,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552876530] [2025-03-15 01:39:54,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:54,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:39:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:54,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:39:54,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:39:54,564 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 223 [2025-03-15 01:39:54,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 223 transitions, 460 flow. Second operand has 12 states, 12 states have (on average 160.91666666666666) internal successors, (1931), 12 states have internal predecessors, (1931), 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-15 01:39:54,572 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:54,572 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 223 [2025-03-15 01:39:54,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:56,050 INFO L124 PetriNetUnfolderBase]: 1325/5018 cut-off events. [2025-03-15 01:39:56,051 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-03-15 01:39:56,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7240 conditions, 5018 events. 1325/5018 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 48913 event pairs, 423 based on Foata normal form. 345/4846 useless extension candidates. Maximal degree in co-relation 7022. Up to 1548 conditions per place. [2025-03-15 01:39:56,090 INFO L140 encePairwiseOnDemand]: 192/223 looper letters, 116 selfloop transitions, 67 changer transitions 43/337 dead transitions. [2025-03-15 01:39:56,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 337 transitions, 1103 flow [2025-03-15 01:39:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-15 01:39:56,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-15 01:39:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4350 transitions. [2025-03-15 01:39:56,115 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7502587098999655 [2025-03-15 01:39:56,118 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 5 predicate places. [2025-03-15 01:39:56,118 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 337 transitions, 1103 flow [2025-03-15 01:39:56,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 160.91666666666666) internal successors, (1931), 12 states have internal predecessors, (1931), 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-15 01:39:56,120 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:56,120 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:56,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-15 01:39:56,120 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:39:56,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:56,122 INFO L85 PathProgramCache]: Analyzing trace with hash 309599464, now seen corresponding path program 1 times [2025-03-15 01:39:56,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:56,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197007374] [2025-03-15 01:39:56,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:56,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:56,840 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-15 01:39:56,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:56,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197007374] [2025-03-15 01:39:56,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197007374] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:56,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:56,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-15 01:39:56,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729005719] [2025-03-15 01:39:56,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:56,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-15 01:39:56,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:56,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-15 01:39:56,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2025-03-15 01:39:56,847 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 159 out of 223 [2025-03-15 01:39:56,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 337 transitions, 1103 flow. Second operand has 12 states, 12 states have (on average 161.0) internal successors, (1932), 12 states have internal predecessors, (1932), 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-15 01:39:56,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:56,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 159 of 223 [2025-03-15 01:39:56,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:39:58,826 INFO L124 PetriNetUnfolderBase]: 4355/16389 cut-off events. [2025-03-15 01:39:58,827 INFO L125 PetriNetUnfolderBase]: For 2008/3537 co-relation queries the response was YES. [2025-03-15 01:39:58,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27740 conditions, 16389 events. 4355/16389 cut-off events. For 2008/3537 co-relation queries the response was YES. Maximal size of possible extension queue 579. Compared 196730 event pairs, 1230 based on Foata normal form. 59/14897 useless extension candidates. Maximal degree in co-relation 27273. Up to 4300 conditions per place. [2025-03-15 01:39:58,915 INFO L140 encePairwiseOnDemand]: 204/223 looper letters, 150 selfloop transitions, 204 changer transitions 49/553 dead transitions. [2025-03-15 01:39:58,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 553 transitions, 2630 flow [2025-03-15 01:39:58,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-15 01:39:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-15 01:39:58,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 4328 transitions. [2025-03-15 01:39:58,922 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7464642980338048 [2025-03-15 01:39:58,923 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 30 predicate places. [2025-03-15 01:39:58,923 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 553 transitions, 2630 flow [2025-03-15 01:39:58,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 161.0) internal successors, (1932), 12 states have internal predecessors, (1932), 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-15 01:39:58,924 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:39:58,924 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:39:58,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-15 01:39:58,924 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:39:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:39:58,925 INFO L85 PathProgramCache]: Analyzing trace with hash 177335383, now seen corresponding path program 1 times [2025-03-15 01:39:58,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:39:58,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820631607] [2025-03-15 01:39:58,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:39:58,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:39:58,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:39:59,993 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-15 01:39:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:39:59,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820631607] [2025-03-15 01:39:59,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820631607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:39:59,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:39:59,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-15 01:39:59,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735671149] [2025-03-15 01:39:59,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:39:59,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:39:59,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:39:59,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:39:59,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:39:59,996 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 223 [2025-03-15 01:39:59,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 553 transitions, 2630 flow. Second operand has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:39:59,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:39:59,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 223 [2025-03-15 01:39:59,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:40:05,191 INFO L124 PetriNetUnfolderBase]: 6605/24771 cut-off events. [2025-03-15 01:40:05,191 INFO L125 PetriNetUnfolderBase]: For 7351/13670 co-relation queries the response was YES. [2025-03-15 01:40:05,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 50795 conditions, 24771 events. 6605/24771 cut-off events. For 7351/13670 co-relation queries the response was YES. Maximal size of possible extension queue 695. Compared 312842 event pairs, 1567 based on Foata normal form. 208/22857 useless extension candidates. Maximal degree in co-relation 50085. Up to 6601 conditions per place. [2025-03-15 01:40:05,317 INFO L140 encePairwiseOnDemand]: 195/223 looper letters, 590 selfloop transitions, 514 changer transitions 88/1310 dead transitions. [2025-03-15 01:40:05,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 1310 transitions, 9026 flow [2025-03-15 01:40:05,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-03-15 01:40:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2025-03-15 01:40:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 9735 transitions. [2025-03-15 01:40:05,332 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7156509593472028 [2025-03-15 01:40:05,333 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 90 predicate places. [2025-03-15 01:40:05,333 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 1310 transitions, 9026 flow [2025-03-15 01:40:05,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:40:05,334 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:40:05,335 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:40:05,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-15 01:40:05,335 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:40:05,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:40:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1194332737, now seen corresponding path program 1 times [2025-03-15 01:40:05,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:40:05,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825653579] [2025-03-15 01:40:05,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-15 01:40:05,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:40:05,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:40:06,499 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-15 01:40:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:40:06,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825653579] [2025-03-15 01:40:06,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825653579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:40:06,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:40:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-15 01:40:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134128885] [2025-03-15 01:40:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:40:06,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:40:06,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:40:06,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:40:06,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:40:06,503 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 223 [2025-03-15 01:40:06,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 1310 transitions, 9026 flow. Second operand has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:40:06,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:40:06,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 223 [2025-03-15 01:40:06,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:40:12,559 INFO L124 PetriNetUnfolderBase]: 8541/29559 cut-off events. [2025-03-15 01:40:12,560 INFO L125 PetriNetUnfolderBase]: For 20382/79764 co-relation queries the response was YES. [2025-03-15 01:40:12,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74548 conditions, 29559 events. 8541/29559 cut-off events. For 20382/79764 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 372527 event pairs, 1881 based on Foata normal form. 951/28123 useless extension candidates. Maximal degree in co-relation 73723. Up to 8578 conditions per place. [2025-03-15 01:40:12,724 INFO L140 encePairwiseOnDemand]: 195/223 looper letters, 986 selfloop transitions, 822 changer transitions 123/2069 dead transitions. [2025-03-15 01:40:12,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 2069 transitions, 18100 flow [2025-03-15 01:40:12,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-03-15 01:40:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2025-03-15 01:40:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 9418 transitions. [2025-03-15 01:40:12,733 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7158166755339364 [2025-03-15 01:40:12,733 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 148 predicate places. [2025-03-15 01:40:12,733 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 2069 transitions, 18100 flow [2025-03-15 01:40:12,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:40:12,734 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:40:12,734 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:40:12,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-15 01:40:12,735 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:40:12,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:40:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash -311935991, now seen corresponding path program 2 times [2025-03-15 01:40:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:40:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447238944] [2025-03-15 01:40:12,735 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:40:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:40:12,759 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:40:12,759 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:40:13,618 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-15 01:40:13,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:40:13,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447238944] [2025-03-15 01:40:13,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447238944] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:40:13,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:40:13,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-15 01:40:13,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738690653] [2025-03-15 01:40:13,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:40:13,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 01:40:13,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:40:13,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 01:40:13,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2025-03-15 01:40:13,624 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 223 [2025-03-15 01:40:13,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 2069 transitions, 18100 flow. Second operand has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:40:13,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:40:13,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 223 [2025-03-15 01:40:13,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:40:23,931 INFO L124 PetriNetUnfolderBase]: 31675/64122 cut-off events. [2025-03-15 01:40:23,932 INFO L125 PetriNetUnfolderBase]: For 188698/215334 co-relation queries the response was YES. [2025-03-15 01:40:24,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 239270 conditions, 64122 events. 31675/64122 cut-off events. For 188698/215334 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 648974 event pairs, 6079 based on Foata normal form. 1152/59530 useless extension candidates. Maximal degree in co-relation 238009. Up to 30494 conditions per place. [2025-03-15 01:40:24,377 INFO L140 encePairwiseOnDemand]: 186/223 looper letters, 2852 selfloop transitions, 1100 changer transitions 239/4334 dead transitions. [2025-03-15 01:40:24,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 4334 transitions, 45140 flow [2025-03-15 01:40:24,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2025-03-15 01:40:24,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2025-03-15 01:40:24,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 10882 transitions. [2025-03-15 01:40:24,390 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5304152856307273 [2025-03-15 01:40:24,392 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 236 predicate places. [2025-03-15 01:40:24,393 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 4334 transitions, 45140 flow [2025-03-15 01:40:24,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:40:24,393 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:40:24,393 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:40:24,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-15 01:40:24,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:40:24,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:40:24,394 INFO L85 PathProgramCache]: Analyzing trace with hash 2097496759, now seen corresponding path program 2 times [2025-03-15 01:40:24,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:40:24,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194357092] [2025-03-15 01:40:24,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-15 01:40:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:40:24,421 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:40:24,423 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:40:25,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-15 01:40:25,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:40:25,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194357092] [2025-03-15 01:40:25,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194357092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:40:25,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:40:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-15 01:40:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000920427] [2025-03-15 01:40:25,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:40:25,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 01:40:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:40:25,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 01:40:25,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-15 01:40:25,075 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 223 [2025-03-15 01:40:25,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 4334 transitions, 45140 flow. Second operand has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:40:25,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:40:25,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 223 [2025-03-15 01:40:25,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:40:45,543 INFO L124 PetriNetUnfolderBase]: 49665/99560 cut-off events. [2025-03-15 01:40:45,544 INFO L125 PetriNetUnfolderBase]: For 327679/362583 co-relation queries the response was YES. [2025-03-15 01:40:45,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445509 conditions, 99560 events. 49665/99560 cut-off events. For 327679/362583 co-relation queries the response was YES. Maximal size of possible extension queue 2064. Compared 1066495 event pairs, 9010 based on Foata normal form. 1032/91864 useless extension candidates. Maximal degree in co-relation 443037. Up to 49374 conditions per place. [2025-03-15 01:40:46,317 INFO L140 encePairwiseOnDemand]: 187/223 looper letters, 5054 selfloop transitions, 1413 changer transitions 313/6923 dead transitions. [2025-03-15 01:40:46,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 529 places, 6923 transitions, 82047 flow [2025-03-15 01:40:46,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-03-15 01:40:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2025-03-15 01:40:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 9323 transitions. [2025-03-15 01:40:46,323 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5292047454163592 [2025-03-15 01:40:46,323 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 314 predicate places. [2025-03-15 01:40:46,323 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 6923 transitions, 82047 flow [2025-03-15 01:40:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:40:46,324 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:40:46,324 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:40:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-15 01:40:46,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:40:46,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:40:46,325 INFO L85 PathProgramCache]: Analyzing trace with hash 853583607, now seen corresponding path program 3 times [2025-03-15 01:40:46,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:40:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805217979] [2025-03-15 01:40:46,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:40:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:40:46,340 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:40:46,341 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:40:46,951 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-15 01:40:46,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:40:46,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805217979] [2025-03-15 01:40:46,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805217979] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:40:46,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:40:46,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-15 01:40:46,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695810569] [2025-03-15 01:40:46,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:40:46,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:40:46,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:40:46,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:40:46,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:40:46,954 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 223 [2025-03-15 01:40:46,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 6923 transitions, 82047 flow. Second operand has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:40:46,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:40:46,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 223 [2025-03-15 01:40:46,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:13,729 INFO L124 PetriNetUnfolderBase]: 52515/106609 cut-off events. [2025-03-15 01:41:13,729 INFO L125 PetriNetUnfolderBase]: For 465762/529343 co-relation queries the response was YES. [2025-03-15 01:41:14,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 533000 conditions, 106609 events. 52515/106609 cut-off events. For 465762/529343 co-relation queries the response was YES. Maximal size of possible extension queue 2209. Compared 1168471 event pairs, 8396 based on Foata normal form. 451/97928 useless extension candidates. Maximal degree in co-relation 530004. Up to 53967 conditions per place. [2025-03-15 01:41:14,631 INFO L140 encePairwiseOnDemand]: 196/223 looper letters, 4624 selfloop transitions, 1197 changer transitions 389/7450 dead transitions. [2025-03-15 01:41:14,631 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 7450 transitions, 101223 flow [2025-03-15 01:41:14,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-03-15 01:41:14,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-03-15 01:41:14,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 6737 transitions. [2025-03-15 01:41:14,635 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7193038650437753 [2025-03-15 01:41:14,636 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 355 predicate places. [2025-03-15 01:41:14,636 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 7450 transitions, 101223 flow [2025-03-15 01:41:14,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:41:14,637 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:14,637 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:14,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-15 01:41:14,637 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:41:14,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:14,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1108038711, now seen corresponding path program 3 times [2025-03-15 01:41:14,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:14,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661506923] [2025-03-15 01:41:14,638 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-15 01:41:14,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:14,659 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-15 01:41:14,660 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:41:15,248 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-15 01:41:15,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:15,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661506923] [2025-03-15 01:41:15,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661506923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:15,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:15,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-15 01:41:15,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237422158] [2025-03-15 01:41:15,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:15,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 01:41:15,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:15,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 01:41:15,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2025-03-15 01:41:15,251 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 223 [2025-03-15 01:41:15,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 7450 transitions, 101223 flow. Second operand has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:41:15,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:15,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 223 [2025-03-15 01:41:15,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:41:55,287 INFO L124 PetriNetUnfolderBase]: 57054/114785 cut-off events. [2025-03-15 01:41:55,288 INFO L125 PetriNetUnfolderBase]: For 607203/702990 co-relation queries the response was YES. [2025-03-15 01:41:55,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 657929 conditions, 114785 events. 57054/114785 cut-off events. For 607203/702990 co-relation queries the response was YES. Maximal size of possible extension queue 2440. Compared 1263881 event pairs, 10034 based on Foata normal form. 987/105719 useless extension candidates. Maximal degree in co-relation 654554. Up to 59814 conditions per place. [2025-03-15 01:41:56,312 INFO L140 encePairwiseOnDemand]: 187/223 looper letters, 6023 selfloop transitions, 1596 changer transitions 394/8176 dead transitions. [2025-03-15 01:41:56,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 637 places, 8176 transitions, 127023 flow [2025-03-15 01:41:56,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-15 01:41:56,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2025-03-15 01:41:56,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 7856 transitions. [2025-03-15 01:41:56,318 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5180691110524928 [2025-03-15 01:41:56,320 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 422 predicate places. [2025-03-15 01:41:56,320 INFO L471 AbstractCegarLoop]: Abstraction has has 637 places, 8176 transitions, 127023 flow [2025-03-15 01:41:56,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:41:56,321 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:41:56,321 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:41:56,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-15 01:41:56,321 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:41:56,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:41:56,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1876454921, now seen corresponding path program 4 times [2025-03-15 01:41:56,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:41:56,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548732061] [2025-03-15 01:41:56,321 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:41:56,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:41:56,343 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:41:56,343 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:41:56,958 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-15 01:41:56,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:41:56,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548732061] [2025-03-15 01:41:56,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548732061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:41:56,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:41:56,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-15 01:41:56,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829305314] [2025-03-15 01:41:56,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:41:56,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:41:56,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:41:56,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:41:56,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=301, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:41:56,960 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 223 [2025-03-15 01:41:56,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 637 places, 8176 transitions, 127023 flow. Second operand has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:41:56,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:41:56,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 223 [2025-03-15 01:41:56,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:42:44,955 INFO L124 PetriNetUnfolderBase]: 64622/131111 cut-off events. [2025-03-15 01:42:44,955 INFO L125 PetriNetUnfolderBase]: For 930188/1119863 co-relation queries the response was YES. [2025-03-15 01:42:45,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 824823 conditions, 131111 events. 64622/131111 cut-off events. For 930188/1119863 co-relation queries the response was YES. Maximal size of possible extension queue 2830. Compared 1481089 event pairs, 11561 based on Foata normal form. 723/120871 useless extension candidates. Maximal degree in co-relation 821180. Up to 70308 conditions per place. [2025-03-15 01:42:46,535 INFO L140 encePairwiseOnDemand]: 195/223 looper letters, 5842 selfloop transitions, 2417 changer transitions 479/10150 dead transitions. [2025-03-15 01:42:46,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 10150 transitions, 177749 flow [2025-03-15 01:42:46,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-03-15 01:42:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2025-03-15 01:42:46,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 11941 transitions. [2025-03-15 01:42:46,541 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7139611360239163 [2025-03-15 01:42:46,542 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 496 predicate places. [2025-03-15 01:42:46,542 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 10150 transitions, 177749 flow [2025-03-15 01:42:46,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:42:46,543 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:42:46,543 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:42:46,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-15 01:42:46,543 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:42:46,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:42:46,544 INFO L85 PathProgramCache]: Analyzing trace with hash -270096103, now seen corresponding path program 4 times [2025-03-15 01:42:46,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:42:46,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501519081] [2025-03-15 01:42:46,544 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-15 01:42:46,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:42:46,560 INFO L229 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2025-03-15 01:42:46,560 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:42:47,372 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-15 01:42:47,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:42:47,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501519081] [2025-03-15 01:42:47,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501519081] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:42:47,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:42:47,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-15 01:42:47,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462805199] [2025-03-15 01:42:47,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:42:47,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:42:47,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:42:47,373 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:42:47,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:42:47,374 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 223 [2025-03-15 01:42:47,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 10150 transitions, 177749 flow. Second operand has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:42:47,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:42:47,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 223 [2025-03-15 01:42:47,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:43:47,169 INFO L124 PetriNetUnfolderBase]: 68973/141396 cut-off events. [2025-03-15 01:43:47,169 INFO L125 PetriNetUnfolderBase]: For 1309531/1537824 co-relation queries the response was YES. [2025-03-15 01:43:47,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 962068 conditions, 141396 events. 68973/141396 cut-off events. For 1309531/1537824 co-relation queries the response was YES. Maximal size of possible extension queue 3082. Compared 1629538 event pairs, 13272 based on Foata normal form. 1400/131170 useless extension candidates. Maximal degree in co-relation 957631. Up to 75928 conditions per place. [2025-03-15 01:43:48,529 INFO L140 encePairwiseOnDemand]: 195/223 looper letters, 6704 selfloop transitions, 2038 changer transitions 598/10780 dead transitions. [2025-03-15 01:43:48,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 792 places, 10780 transitions, 208274 flow [2025-03-15 01:43:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-03-15 01:43:48,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2025-03-15 01:43:48,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 12925 transitions. [2025-03-15 01:43:48,536 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7068248933610413 [2025-03-15 01:43:48,536 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 577 predicate places. [2025-03-15 01:43:48,536 INFO L471 AbstractCegarLoop]: Abstraction has has 792 places, 10780 transitions, 208274 flow [2025-03-15 01:43:48,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:43:48,538 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:43:48,538 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:43:48,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-15 01:43:48,538 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:43:48,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:43:48,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1775897593, now seen corresponding path program 5 times [2025-03-15 01:43:48,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:43:48,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197137633] [2025-03-15 01:43:48,543 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:43:48,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:43:48,613 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:43:48,613 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:43:49,164 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-15 01:43:49,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:43:49,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197137633] [2025-03-15 01:43:49,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197137633] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:43:49,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:43:49,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-03-15 01:43:49,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730996810] [2025-03-15 01:43:49,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:43:49,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-15 01:43:49,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:43:49,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-15 01:43:49,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=299, Unknown=0, NotChecked=0, Total=342 [2025-03-15 01:43:49,167 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 223 [2025-03-15 01:43:49,170 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 792 places, 10780 transitions, 208274 flow. Second operand has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:43:49,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:43:49,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 223 [2025-03-15 01:43:49,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:44:55,531 INFO L124 PetriNetUnfolderBase]: 71960/149446 cut-off events. [2025-03-15 01:44:55,531 INFO L125 PetriNetUnfolderBase]: For 1739986/2010577 co-relation queries the response was YES. [2025-03-15 01:44:56,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1087986 conditions, 149446 events. 71960/149446 cut-off events. For 1739986/2010577 co-relation queries the response was YES. Maximal size of possible extension queue 3206. Compared 1751987 event pairs, 14133 based on Foata normal form. 1479/138957 useless extension candidates. Maximal degree in co-relation 1082825. Up to 79438 conditions per place. [2025-03-15 01:44:57,184 INFO L140 encePairwiseOnDemand]: 195/223 looper letters, 6974 selfloop transitions, 2430 changer transitions 667/11511 dead transitions. [2025-03-15 01:44:57,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 902 places, 11511 transitions, 243746 flow [2025-03-15 01:44:57,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2025-03-15 01:44:57,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2025-03-15 01:44:57,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 17432 transitions. [2025-03-15 01:44:57,191 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.7042378701571527 [2025-03-15 01:44:57,192 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 687 predicate places. [2025-03-15 01:44:57,192 INFO L471 AbstractCegarLoop]: Abstraction has has 902 places, 11511 transitions, 243746 flow [2025-03-15 01:44:57,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 152.78947368421052) internal successors, (2903), 19 states have internal predecessors, (2903), 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-15 01:44:57,193 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:44:57,193 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:44:57,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-15 01:44:57,193 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:44:57,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:44:57,194 INFO L85 PathProgramCache]: Analyzing trace with hash -218347497, now seen corresponding path program 5 times [2025-03-15 01:44:57,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:44:57,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603126814] [2025-03-15 01:44:57,194 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-15 01:44:57,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:44:57,209 INFO L229 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-15 01:44:57,209 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:44:57,738 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-15 01:44:57,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:44:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603126814] [2025-03-15 01:44:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603126814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:44:57,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:44:57,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-15 01:44:57,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580920028] [2025-03-15 01:44:57,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:44:57,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 01:44:57,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:44:57,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 01:44:57,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=487, Unknown=0, NotChecked=0, Total=552 [2025-03-15 01:44:57,741 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 223 [2025-03-15 01:44:57,747 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 902 places, 11511 transitions, 243746 flow. Second operand has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:44:57,747 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:44:57,747 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 223 [2025-03-15 01:44:57,747 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:47:24,258 INFO L124 PetriNetUnfolderBase]: 93265/191961 cut-off events. [2025-03-15 01:47:24,258 INFO L125 PetriNetUnfolderBase]: For 2576586/3010512 co-relation queries the response was YES. [2025-03-15 01:47:25,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1543232 conditions, 191961 events. 93265/191961 cut-off events. For 2576586/3010512 co-relation queries the response was YES. Maximal size of possible extension queue 4355. Compared 2311653 event pairs, 18763 based on Foata normal form. 1488/176712 useless extension candidates. Maximal degree in co-relation 1535923. Up to 104944 conditions per place. [2025-03-15 01:47:26,505 INFO L140 encePairwiseOnDemand]: 187/223 looper letters, 10247 selfloop transitions, 2339 changer transitions 757/13602 dead transitions. [2025-03-15 01:47:26,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 13602 transitions, 308786 flow [2025-03-15 01:47:26,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-03-15 01:47:26,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2025-03-15 01:47:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 10439 transitions. [2025-03-15 01:47:26,510 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.5319506726457399 [2025-03-15 01:47:26,511 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 774 predicate places. [2025-03-15 01:47:26,511 INFO L471 AbstractCegarLoop]: Abstraction has has 989 places, 13602 transitions, 308786 flow [2025-03-15 01:47:26,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:47:26,512 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:47:26,512 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:47:26,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-15 01:47:26,512 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:47:26,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:47:26,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1276799145, now seen corresponding path program 6 times [2025-03-15 01:47:26,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:47:26,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293445657] [2025-03-15 01:47:26,513 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-15 01:47:26,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:47:26,527 INFO L229 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-15 01:47:26,527 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2025-03-15 01:47:27,076 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-15 01:47:27,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:47:27,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293445657] [2025-03-15 01:47:27,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293445657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:47:27,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:47:27,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-15 01:47:27,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467021076] [2025-03-15 01:47:27,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:47:27,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 01:47:27,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:47:27,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 01:47:27,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-03-15 01:47:27,080 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 223 [2025-03-15 01:47:27,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 989 places, 13602 transitions, 308786 flow. Second operand has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:47:27,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:47:27,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 223 [2025-03-15 01:47:27,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-15 01:49:27,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([530] L3906-->L3906-3: Formula: (and (= |v_my_callbackThread1of1ForFork1_#t~ret7_1| 0) (= (store |v_#pthreadsMutex_12| v_my_callbackThread1of1ForFork1_~data~0.base_13 (store (select |v_#pthreadsMutex_12| v_my_callbackThread1of1ForFork1_~data~0.base_13) v_my_callbackThread1of1ForFork1_~data~0.offset_13 0)) |v_#pthreadsMutex_11|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_13, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_13} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_13, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_13, my_callbackThread1of1ForFork1_#t~ret7=|v_my_callbackThread1of1ForFork1_#t~ret7_1|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_#t~ret7][10979], [1332#true, 1722#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 1029#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 77#L3906-3true, 938#true, 218#true, 683#(and (= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (= my_callbackThread1of1ForFork1_~data~0.offset 0)), 116#L3903true, 268#true, 770#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), my_callbackThread1of1ForFork0InUse, 445#true, my_callbackThread1of1ForFork1InUse, 1497#true, 103#L3955-2true, 318#true, 1999#(and (= my_callbackThread1of1ForFork0_~data~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= 0 my_callbackThread1of1ForFork0_~data~0.offset)), 1179#true]) [2025-03-15 01:49:27,772 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is cut-off event [2025-03-15 01:49:27,772 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-15 01:49:27,772 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-15 01:49:27,772 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is cut-off event [2025-03-15 01:49:36,101 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L3903-->L3903-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_20| v_my_callbackThread1of1ForFork0_~data~0.base_5))) (and (= |v_my_callbackThread1of1ForFork0_#t~ret5_1| 0) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_5) 0) (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| v_my_callbackThread1of1ForFork0_~data~0.base_5 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_5 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_5, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_5} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, my_callbackThread1of1ForFork0_#t~ret5=|v_my_callbackThread1of1ForFork0_#t~ret5_1|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_5, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_5} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~ret5][10776], [1332#true, 1722#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 1029#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 938#true, 218#true, 208#L3906true, 106#L3903-3true, 2011#(and (not (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) 0) 0)) (= my_callbackThread1of1ForFork0_~data~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= 0 my_callbackThread1of1ForFork0_~data~0.offset)), 268#true, 770#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), my_callbackThread1of1ForFork0InUse, 693#(and (= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (not (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) 0) 0)) (= my_callbackThread1of1ForFork1_~data~0.offset 0)), 445#true, my_callbackThread1of1ForFork1InUse, 1497#true, 103#L3955-2true, 318#true, 1179#true]) [2025-03-15 01:49:36,101 INFO L294 olderBase$Statistics]: this new event has 103 ancestors and is not cut-off event [2025-03-15 01:49:36,101 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is not cut-off event [2025-03-15 01:49:36,101 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is not cut-off event [2025-03-15 01:49:36,101 INFO L297 olderBase$Statistics]: existing Event has 103 ancestors and is not cut-off event [2025-03-15 01:49:36,159 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([530] L3906-->L3906-3: Formula: (and (= |v_my_callbackThread1of1ForFork1_#t~ret7_1| 0) (= (store |v_#pthreadsMutex_12| v_my_callbackThread1of1ForFork1_~data~0.base_13 (store (select |v_#pthreadsMutex_12| v_my_callbackThread1of1ForFork1_~data~0.base_13) v_my_callbackThread1of1ForFork1_~data~0.offset_13 0)) |v_#pthreadsMutex_11|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_12|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_13, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_13} OutVars{#pthreadsMutex=|v_#pthreadsMutex_11|, my_callbackThread1of1ForFork1_~data~0.offset=v_my_callbackThread1of1ForFork1_~data~0.offset_13, my_callbackThread1of1ForFork1_~data~0.base=v_my_callbackThread1of1ForFork1_~data~0.base_13, my_callbackThread1of1ForFork1_#t~ret7=|v_my_callbackThread1of1ForFork1_#t~ret7_1|} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork1_#t~ret7][10979], [1332#true, 1029#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 1722#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 77#L3906-3true, 938#true, 218#true, 683#(and (= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (= my_callbackThread1of1ForFork1_~data~0.offset 0)), 116#L3903true, 268#true, 90#L3955-3true, 770#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), my_callbackThread1of1ForFork0InUse, 445#true, my_callbackThread1of1ForFork1InUse, 1497#true, 318#true, 1999#(and (= my_callbackThread1of1ForFork0_~data~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= 0 my_callbackThread1of1ForFork0_~data~0.offset)), 1179#true]) [2025-03-15 01:49:36,159 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is cut-off event [2025-03-15 01:49:36,159 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-15 01:49:36,159 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-15 01:49:36,159 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is cut-off event [2025-03-15 01:49:45,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([408] L3956-->L3956-1: Formula: (= |v_ULTIMATE.start_main_#t~mem22#1_3| (select (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#data~1#1.base_11|) (+ |v_ULTIMATE.start_main_~#data~1#1.offset_11| 28))) InVars {ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_11|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_11|} OutVars{ULTIMATE.start_main_~#data~1#1.base=|v_ULTIMATE.start_main_~#data~1#1.base_11|, #memory_int=|v_#memory_int_20|, ULTIMATE.start_main_#t~mem22#1=|v_ULTIMATE.start_main_#t~mem22#1_3|, ULTIMATE.start_main_~#data~1#1.offset=|v_ULTIMATE.start_main_~#data~1#1.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem22#1][13205], [1332#true, 1722#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 1029#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 70#L3956-1true, 938#true, 218#true, 208#L3906true, 116#L3903true, 268#true, 770#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), my_callbackThread1of1ForFork0InUse, 445#true, 693#(and (= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (not (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) 0) 0)) (= my_callbackThread1of1ForFork1_~data~0.offset 0)), my_callbackThread1of1ForFork1InUse, 1497#true, 318#true, 1179#true, 1999#(and (= my_callbackThread1of1ForFork0_~data~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= 0 my_callbackThread1of1ForFork0_~data~0.offset))]) [2025-03-15 01:49:45,668 INFO L294 olderBase$Statistics]: this new event has 105 ancestors and is cut-off event [2025-03-15 01:49:45,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-15 01:49:45,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-15 01:49:45,668 INFO L297 olderBase$Statistics]: existing Event has 105 ancestors and is cut-off event [2025-03-15 01:49:45,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([498] L3903-->L3903-3: Formula: (let ((.cse0 (select |v_#pthreadsMutex_20| v_my_callbackThread1of1ForFork0_~data~0.base_5))) (and (= |v_my_callbackThread1of1ForFork0_#t~ret5_1| 0) (= (select .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_5) 0) (= |v_#pthreadsMutex_19| (store |v_#pthreadsMutex_20| v_my_callbackThread1of1ForFork0_~data~0.base_5 (store .cse0 v_my_callbackThread1of1ForFork0_~data~0.offset_5 1))))) InVars {#pthreadsMutex=|v_#pthreadsMutex_20|, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_5, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_5} OutVars{#pthreadsMutex=|v_#pthreadsMutex_19|, my_callbackThread1of1ForFork0_#t~ret5=|v_my_callbackThread1of1ForFork0_#t~ret5_1|, my_callbackThread1of1ForFork0_~data~0.offset=v_my_callbackThread1of1ForFork0_~data~0.offset_5, my_callbackThread1of1ForFork0_~data~0.base=v_my_callbackThread1of1ForFork0_~data~0.base_5} AuxVars[] AssignedVars[#pthreadsMutex, my_callbackThread1of1ForFork0_#t~ret5][10776], [1332#true, 1722#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 1029#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), 938#true, 218#true, 208#L3906true, 2011#(and (not (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork0_~data~0.base) 0) 0)) (= my_callbackThread1of1ForFork0_~data~0.base |my_callbackThread1of1ForFork1_#in~arg.base|) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= 0 my_callbackThread1of1ForFork0_~data~0.offset)), 106#L3903-3true, 268#true, 90#L3955-3true, 770#(= |ULTIMATE.start_main_~#data~1#1.offset| 0), my_callbackThread1of1ForFork0InUse, 693#(and (= my_callbackThread1of1ForFork1_~arg.offset 24) (= my_callbackThread1of1ForFork1_~dev~0.offset 24) (= |my_callbackThread1of1ForFork0_#in~arg.base| |my_callbackThread1of1ForFork1_#in~arg.base|) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~arg.base) (= |my_callbackThread1of1ForFork0_#in~arg.base| my_callbackThread1of1ForFork1_~data~0.base) (= |ULTIMATE.start_main_~#data~1#1.offset| 0) (= |my_callbackThread1of1ForFork1_#in~arg.offset| 24) (= |my_callbackThread1of1ForFork0_#in~arg.offset| 24) (= my_callbackThread1of1ForFork1_~dev~0.base |my_callbackThread1of1ForFork0_#in~arg.base|) (not (= (select (select |#pthreadsMutex| my_callbackThread1of1ForFork1_~data~0.base) 0) 0)) (= my_callbackThread1of1ForFork1_~data~0.offset 0)), 445#true, my_callbackThread1of1ForFork1InUse, 1497#true, 318#true, 1179#true]) [2025-03-15 01:49:45,720 INFO L294 olderBase$Statistics]: this new event has 104 ancestors and is not cut-off event [2025-03-15 01:49:45,720 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2025-03-15 01:49:45,720 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2025-03-15 01:49:45,720 INFO L297 olderBase$Statistics]: existing Event has 104 ancestors and is not cut-off event [2025-03-15 01:51:08,842 INFO L124 PetriNetUnfolderBase]: 106485/217981 cut-off events. [2025-03-15 01:51:08,842 INFO L125 PetriNetUnfolderBase]: For 3361165/3866566 co-relation queries the response was YES. [2025-03-15 01:51:09,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1919326 conditions, 217981 events. 106485/217981 cut-off events. For 3361165/3866566 co-relation queries the response was YES. Maximal size of possible extension queue 5023. Compared 2662007 event pairs, 21714 based on Foata normal form. 1436/199324 useless extension candidates. Maximal degree in co-relation 1909727. Up to 121070 conditions per place. [2025-03-15 01:51:11,651 INFO L140 encePairwiseOnDemand]: 187/223 looper letters, 11902 selfloop transitions, 2291 changer transitions 818/15270 dead transitions. [2025-03-15 01:51:11,651 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1061 places, 15270 transitions, 371056 flow [2025-03-15 01:51:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-03-15 01:51:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2025-03-15 01:51:11,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 8557 transitions. [2025-03-15 01:51:11,655 INFO L531 CegarLoopForPetriNet]: DFA transition density 0.525646538485165 [2025-03-15 01:51:11,655 INFO L298 CegarLoopForPetriNet]: 215 programPoint places, 846 predicate places. [2025-03-15 01:51:11,655 INFO L471 AbstractCegarLoop]: Abstraction has has 1061 places, 15270 transitions, 371056 flow [2025-03-15 01:51:11,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:51:11,656 INFO L213 CegarLoopForPetriNet]: Found error trace [2025-03-15 01:51:11,656 INFO L221 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-15 01:51:11,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-15 01:51:11,657 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-03-15 01:51:11,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-15 01:51:11,657 INFO L85 PathProgramCache]: Analyzing trace with hash -2060990949, now seen corresponding path program 7 times [2025-03-15 01:51:11,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-15 01:51:11,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639207101] [2025-03-15 01:51:11,657 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-15 01:51:11,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-15 01:51:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-15 01:51:12,411 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-15 01:51:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-15 01:51:12,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639207101] [2025-03-15 01:51:12,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639207101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-15 01:51:12,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-15 01:51:12,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2025-03-15 01:51:12,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661731963] [2025-03-15 01:51:12,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-15 01:51:12,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-15 01:51:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-15 01:51:12,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-15 01:51:12,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=486, Unknown=0, NotChecked=0, Total=552 [2025-03-15 01:51:12,413 INFO L486 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 223 [2025-03-15 01:51:12,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1061 places, 15270 transitions, 371056 flow. Second operand has 24 states, 24 states have (on average 107.04166666666667) internal successors, (2569), 24 states have internal predecessors, (2569), 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-15 01:51:12,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-15 01:51:12,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 223 [2025-03-15 01:51:12,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand Received shutdown request... [2025-03-15 01:53:13,286 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-03-15 01:53:13,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2025-03-15 01:53:13,642 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2025-03-15 01:53:13,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-15 01:53:13,646 WARN L596 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 105/223 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 999942 conditions, 96326 events (53230/96325 cut-off events. For 1785256/2276094 co-relation queries the response was YES. Maximal size of possible extension queue 5166. Compared 1056450 event pairs, 7350 based on Foata normal form. 1052/93232 useless extension candidates. Maximal degree in co-relation 998114. Up to 57402 conditions per place.). [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location my_callbackErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2025-03-15 01:53:13,648 INFO L782 garLoopResultBuilder]: Registering result TIMEOUT for location my_callbackErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2025-03-15 01:53:13,653 INFO L422 BasicCegarLoop]: Path program histogram: [7, 5, 1, 1] [2025-03-15 01:53:13,658 INFO L328 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-15 01:53:13,665 INFO L188 ceAbstractionStarter]: Computing trace abstraction results [2025-03-15 01:53:13,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.03 01:53:13 BasicIcfg [2025-03-15 01:53:13,672 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-15 01:53:13,672 INFO L158 Benchmark]: Toolchain (without parser) took 801843.00ms. Allocated memory was 71.3MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 41.7MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 01:53:13,672 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. [2025-03-15 01:53:13,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 526.00ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 34.0MB in the end (delta: 7.5MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. [2025-03-15 01:53:13,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.10ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 31.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:53:13,673 INFO L158 Benchmark]: Boogie Preprocessor took 26.79ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 29.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-03-15 01:53:13,673 INFO L158 Benchmark]: RCFGBuilder took 478.78ms. Allocated memory is still 71.3MB. Free memory was 29.2MB in the beginning and 24.7MB in the end (delta: 4.5MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. [2025-03-15 01:53:13,674 INFO L158 Benchmark]: TraceAbstraction took 800764.50ms. Allocated memory was 71.3MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 23.9MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. [2025-03-15 01:53:13,680 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.24ms. Allocated memory is still 71.3MB. Free memory was 36.9MB in the beginning and 36.9MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 526.00ms. Allocated memory is still 71.3MB. Free memory was 41.6MB in the beginning and 34.0MB in the end (delta: 7.5MB). Peak memory consumption was 31.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.10ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 31.9MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.79ms. Allocated memory is still 71.3MB. Free memory was 31.5MB in the beginning and 29.2MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 478.78ms. Allocated memory is still 71.3MB. Free memory was 29.2MB in the beginning and 24.7MB in the end (delta: 4.5MB). Peak memory consumption was 11.9MB. Max. memory is 8.0GB. * TraceAbstraction took 800764.50ms. Allocated memory was 71.3MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 23.9MB in the beginning and 2.1GB in the end (delta: -2.1GB). Peak memory consumption was 2.9GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 3905]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 105/223 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 999942 conditions, 96326 events (53230/96325 cut-off events. For 1785256/2276094 co-relation queries the response was YES. Maximal size of possible extension queue 5166. Compared 1056450 event pairs, 7350 based on Foata normal form. 1052/93232 useless extension candidates. Maximal degree in co-relation 998114. Up to 57402 conditions per place.). - TimeoutResultAtElement [Line: 3922]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 105/223 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 999942 conditions, 96326 events (53230/96325 cut-off events. For 1785256/2276094 co-relation queries the response was YES. Maximal size of possible extension queue 5166. Compared 1056450 event pairs, 7350 based on Foata normal form. 1052/93232 useless extension candidates. Maximal degree in co-relation 998114. Up to 57402 conditions per place.). - TimeoutResultAtElement [Line: 3923]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 105/223 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 999942 conditions, 96326 events (53230/96325 cut-off events. For 1785256/2276094 co-relation queries the response was YES. Maximal size of possible extension queue 5166. Compared 1056450 event pairs, 7350 based on Foata normal form. 1052/93232 useless extension candidates. Maximal degree in co-relation 998114. Up to 57402 conditions per place.). - TimeoutResultAtElement [Line: 3905]: Timeout (TraceAbstraction) Unable to prove that integer overflow can never occur Cancelled while CegarLoopForPetriNet was enhancing Floyd-Hoare automaton (24states, 105/223 universal loopers) in iteration 14,while PetriNetUnfolder was constructing finite prefix that currently has 999942 conditions, 96326 events (53230/96325 cut-off events. For 1785256/2276094 co-relation queries the response was YES. Maximal size of possible extension queue 5166. Compared 1056450 event pairs, 7350 based on Foata normal form. 1052/93232 useless extension candidates. Maximal degree in co-relation 998114. Up to 57402 conditions per place.). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 234 locations, 8 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: 800.7s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 789.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11955 SdHoareTripleChecker+Valid, 12.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11955 mSDsluCounter, 27723 SdHoareTripleChecker+Invalid, 10.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25329 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24365 IncrementalHoareTripleChecker+Invalid, 24537 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 2394 mSDtfsCounter, 24365 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1167 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 1115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31050 ImplicationChecksByTransitivity, 28.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=371056occurred in iteration=13, InterpolantAutomatonStates: 882, 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.2s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 1120 NumberOfCodeBlocks, 1120 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1106 ConstructedInterpolants, 0 QuantifiedInterpolants, 9154 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown