./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:32:37,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:32:37,111 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:32:37,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:32:37,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:32:37,137 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:32:37,138 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:32:37,138 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:32:37,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:32:37,139 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:32:37,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:32:37,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:32:37,140 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:32:37,140 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:32:37,140 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:32:37,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:32:37,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:32:37,140 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:32:37,141 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:32:37,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:32:37,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:32:37,142 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 81147b3e42a82bd92b2fd1c17836bc41bf8598e66ad2317620561a8ac507fa9a [2025-03-09 06:32:37,405 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:32:37,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:32:37,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:32:37,416 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:32:37,417 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:32:37,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-09 06:32:38,592 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e418f273/b4b89aeac7304384bd88c486f77ab384/FLAG44eb5c801 [2025-03-09 06:32:38,853 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:32:38,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-C-DAC/pthread-demo-datarace-1.i [2025-03-09 06:32:38,870 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e418f273/b4b89aeac7304384bd88c486f77ab384/FLAG44eb5c801 [2025-03-09 06:32:39,163 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e418f273/b4b89aeac7304384bd88c486f77ab384 [2025-03-09 06:32:39,165 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:32:39,166 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:32:39,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:32:39,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:32:39,169 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:32:39,170 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,171 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@655b42f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39, skipping insertion in model container [2025-03-09 06:32:39,171 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:32:39,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:32:39,501 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:32:39,545 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:32:39,591 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:32:39,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39 WrapperNode [2025-03-09 06:32:39,593 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:32:39,593 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:32:39,593 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:32:39,593 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:32:39,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,608 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,621 INFO L138 Inliner]: procedures = 364, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 66 [2025-03-09 06:32:39,621 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:32:39,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:32:39,622 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:32:39,622 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:32:39,627 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,627 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,629 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,642 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [2, 5]. 71 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5]. The 0 writes are split as follows [0, 0]. [2025-03-09 06:32:39,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,646 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,653 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,655 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:32:39,657 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:32:39,657 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:32:39,657 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:32:39,658 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (1/1) ... [2025-03-09 06:32:39,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:32:39,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:39,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-09 06:32:39,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-09 06:32:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:32:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:32:39,710 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:32:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure thread_function_mutex [2025-03-09 06:32:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure thread_function_mutex [2025-03-09 06:32:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:32:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:32:39,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:32:39,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:32:39,712 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:32:39,807 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:32:39,808 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:32:39,922 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:32:39,922 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:32:39,999 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:32:40,002 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:32:40,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:32:40 BoogieIcfgContainer [2025-03-09 06:32:40,003 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:32:40,004 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:32:40,004 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:32:40,008 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:32:40,008 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:32:39" (1/3) ... [2025-03-09 06:32:40,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ba9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:32:40, skipping insertion in model container [2025-03-09 06:32:40,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:32:39" (2/3) ... [2025-03-09 06:32:40,009 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ba9a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:32:40, skipping insertion in model container [2025-03-09 06:32:40,009 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:32:40" (3/3) ... [2025-03-09 06:32:40,010 INFO L128 eAbstractionObserver]: Analyzing ICFG pthread-demo-datarace-1.i [2025-03-09 06:32:40,022 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:32:40,023 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pthread-demo-datarace-1.i that has 2 procedures, 34 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-09 06:32:40,023 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:32:40,057 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-09 06:32:40,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 35 transitions, 77 flow [2025-03-09 06:32:40,118 INFO L124 PetriNetUnfolderBase]: 2/34 cut-off events. [2025-03-09 06:32:40,121 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-09 06:32:40,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 34 events. 2/34 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 75 event pairs, 0 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 30. Up to 2 conditions per place. [2025-03-09 06:32:40,124 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 35 transitions, 77 flow [2025-03-09 06:32:40,126 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 34 places, 32 transitions, 67 flow [2025-03-09 06:32:40,134 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:32:40,143 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7365f089, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:32:40,147 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-09 06:32:40,153 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:32:40,154 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-09 06:32:40,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:32:40,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:40,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:40,155 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:40,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:40,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1958380184, now seen corresponding path program 1 times [2025-03-09 06:32:40,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:40,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361337861] [2025-03-09 06:32:40,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:40,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:40,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:32:40,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:32:40,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:40,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:40,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:40,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:40,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361337861] [2025-03-09 06:32:40,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361337861] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:40,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:40,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-09 06:32:40,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050190653] [2025-03-09 06:32:40,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:40,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:32:40,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:40,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:32:40,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:32:40,373 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-03-09 06:32:40,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:40,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-03-09 06:32:40,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:40,450 INFO L124 PetriNetUnfolderBase]: 79/235 cut-off events. [2025-03-09 06:32:40,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:32:40,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 235 events. 79/235 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1050 event pairs, 26 based on Foata normal form. 3/203 useless extension candidates. Maximal degree in co-relation 389. Up to 135 conditions per place. [2025-03-09 06:32:40,453 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 23 selfloop transitions, 3 changer transitions 0/40 dead transitions. [2025-03-09 06:32:40,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 40 transitions, 135 flow [2025-03-09 06:32:40,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:32:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:32:40,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-09 06:32:40,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952380952380952 [2025-03-09 06:32:40,462 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 67 flow. Second operand 3 states and 73 transitions. [2025-03-09 06:32:40,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 40 transitions, 135 flow [2025-03-09 06:32:40,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 40 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:32:40,467 INFO L231 Difference]: Finished difference. Result has 36 places, 34 transitions, 87 flow [2025-03-09 06:32:40,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=87, PETRI_PLACES=36, PETRI_TRANSITIONS=34} [2025-03-09 06:32:40,471 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2025-03-09 06:32:40,471 INFO L471 AbstractCegarLoop]: Abstraction has has 36 places, 34 transitions, 87 flow [2025-03-09 06:32:40,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:40,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:40,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:32:40,472 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:40,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1932099409, now seen corresponding path program 1 times [2025-03-09 06:32:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:40,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978741922] [2025-03-09 06:32:40,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:40,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:40,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:32:40,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:32:40,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:40,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:40,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:40,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:40,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978741922] [2025-03-09 06:32:40,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978741922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:40,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:32:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848735299] [2025-03-09 06:32:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:40,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:32:40,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:40,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:32:40,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:32:40,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:40,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 34 transitions, 87 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:40,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:40,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:40,697 INFO L124 PetriNetUnfolderBase]: 102/272 cut-off events. [2025-03-09 06:32:40,697 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-03-09 06:32:40,698 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 272 events. 102/272 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1268 event pairs, 34 based on Foata normal form. 20/262 useless extension candidates. Maximal degree in co-relation 536. Up to 173 conditions per place. [2025-03-09 06:32:40,703 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 33 selfloop transitions, 6 changer transitions 0/51 dead transitions. [2025-03-09 06:32:40,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 51 transitions, 210 flow [2025-03-09 06:32:40,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:32:40,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:32:40,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 108 transitions. [2025-03-09 06:32:40,706 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6171428571428571 [2025-03-09 06:32:40,706 INFO L175 Difference]: Start difference. First operand has 36 places, 34 transitions, 87 flow. Second operand 5 states and 108 transitions. [2025-03-09 06:32:40,706 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 51 transitions, 210 flow [2025-03-09 06:32:40,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 51 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:32:40,708 INFO L231 Difference]: Finished difference. Result has 42 places, 37 transitions, 126 flow [2025-03-09 06:32:40,708 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=126, PETRI_PLACES=42, PETRI_TRANSITIONS=37} [2025-03-09 06:32:40,708 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2025-03-09 06:32:40,708 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 37 transitions, 126 flow [2025-03-09 06:32:40,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,708 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:40,708 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:40,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:32:40,709 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:40,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:40,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1201262833, now seen corresponding path program 1 times [2025-03-09 06:32:40,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:40,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-09 06:32:40,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:40,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:40,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:32:40,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:32:40,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:40,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:40,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:40,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:40,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208791508] [2025-03-09 06:32:40,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208791508] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:40,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:40,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980040732] [2025-03-09 06:32:40,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:40,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:32:40,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:40,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:32:40,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:32:40,801 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-03-09 06:32:40,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 37 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:40,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-03-09 06:32:40,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:40,924 INFO L124 PetriNetUnfolderBase]: 117/340 cut-off events. [2025-03-09 06:32:40,924 INFO L125 PetriNetUnfolderBase]: For 131/141 co-relation queries the response was YES. [2025-03-09 06:32:40,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 744 conditions, 340 events. 117/340 cut-off events. For 131/141 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1625 event pairs, 39 based on Foata normal form. 14/330 useless extension candidates. Maximal degree in co-relation 729. Up to 132 conditions per place. [2025-03-09 06:32:40,928 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/56 dead transitions. [2025-03-09 06:32:40,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 263 flow [2025-03-09 06:32:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:32:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:32:40,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-09 06:32:40,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2025-03-09 06:32:40,930 INFO L175 Difference]: Start difference. First operand has 42 places, 37 transitions, 126 flow. Second operand 4 states and 99 transitions. [2025-03-09 06:32:40,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 263 flow [2025-03-09 06:32:40,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 56 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:32:40,932 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 142 flow [2025-03-09 06:32:40,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2025-03-09 06:32:40,932 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 11 predicate places. [2025-03-09 06:32:40,932 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 142 flow [2025-03-09 06:32:40,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:40,933 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:40,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:32:40,933 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:40,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1212658282, now seen corresponding path program 1 times [2025-03-09 06:32:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025010335] [2025-03-09 06:32:40,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:40,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:40,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:32:40,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:32:40,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:40,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:40,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:40,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025010335] [2025-03-09 06:32:40,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025010335] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:40,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:40,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:40,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541330115] [2025-03-09 06:32:40,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:40,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:32:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:40,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:32:40,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:32:40,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-09 06:32:40,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 142 flow. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:40,993 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:40,993 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-09 06:32:40,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:41,084 INFO L124 PetriNetUnfolderBase]: 217/598 cut-off events. [2025-03-09 06:32:41,085 INFO L125 PetriNetUnfolderBase]: For 394/457 co-relation queries the response was YES. [2025-03-09 06:32:41,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1380 conditions, 598 events. 217/598 cut-off events. For 394/457 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 3105 event pairs, 79 based on Foata normal form. 29/608 useless extension candidates. Maximal degree in co-relation 1364. Up to 278 conditions per place. [2025-03-09 06:32:41,088 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 52 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2025-03-09 06:32:41,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 68 transitions, 371 flow [2025-03-09 06:32:41,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:32:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:32:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 99 transitions. [2025-03-09 06:32:41,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7071428571428572 [2025-03-09 06:32:41,090 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 142 flow. Second operand 4 states and 99 transitions. [2025-03-09 06:32:41,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 68 transitions, 371 flow [2025-03-09 06:32:41,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 68 transitions, 365 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:32:41,092 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 164 flow [2025-03-09 06:32:41,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=164, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2025-03-09 06:32:41,095 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 15 predicate places. [2025-03-09 06:32:41,095 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 164 flow [2025-03-09 06:32:41,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:41,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:41,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:32:41,096 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:41,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:41,096 INFO L85 PathProgramCache]: Analyzing trace with hash -967481885, now seen corresponding path program 1 times [2025-03-09 06:32:41,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:41,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365125089] [2025-03-09 06:32:41,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:41,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:41,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:32:41,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:32:41,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:41,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:41,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:41,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:41,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365125089] [2025-03-09 06:32:41,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365125089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:41,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:41,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:41,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670249202] [2025-03-09 06:32:41,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:41,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:32:41,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:41,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:32:41,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:32:41,161 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 17 out of 35 [2025-03-09 06:32:41,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:41,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 17 of 35 [2025-03-09 06:32:41,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:41,231 INFO L124 PetriNetUnfolderBase]: 111/407 cut-off events. [2025-03-09 06:32:41,232 INFO L125 PetriNetUnfolderBase]: For 268/284 co-relation queries the response was YES. [2025-03-09 06:32:41,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 407 events. 111/407 cut-off events. For 268/284 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1922 event pairs, 37 based on Foata normal form. 20/425 useless extension candidates. Maximal degree in co-relation 989. Up to 128 conditions per place. [2025-03-09 06:32:41,234 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 30 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2025-03-09 06:32:41,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 50 transitions, 269 flow [2025-03-09 06:32:41,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:32:41,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:32:41,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2025-03-09 06:32:41,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7238095238095238 [2025-03-09 06:32:41,236 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 164 flow. Second operand 3 states and 76 transitions. [2025-03-09 06:32:41,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 50 transitions, 269 flow [2025-03-09 06:32:41,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 50 transitions, 259 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-03-09 06:32:41,239 INFO L231 Difference]: Finished difference. Result has 48 places, 39 transitions, 151 flow [2025-03-09 06:32:41,240 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=48, PETRI_TRANSITIONS=39} [2025-03-09 06:32:41,241 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2025-03-09 06:32:41,241 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 39 transitions, 151 flow [2025-03-09 06:32:41,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:41,242 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:41,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:32:41,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:41,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:41,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1715226317, now seen corresponding path program 1 times [2025-03-09 06:32:41,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:41,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308400333] [2025-03-09 06:32:41,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:41,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:41,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:32:41,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:32:41,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:41,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:41,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:41,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308400333] [2025-03-09 06:32:41,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308400333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:41,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:41,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153767409] [2025-03-09 06:32:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:32:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:32:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:32:41,312 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:41,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 39 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:41,313 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:41,313 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:41,422 INFO L124 PetriNetUnfolderBase]: 206/602 cut-off events. [2025-03-09 06:32:41,422 INFO L125 PetriNetUnfolderBase]: For 412/448 co-relation queries the response was YES. [2025-03-09 06:32:41,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 602 events. 206/602 cut-off events. For 412/448 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3173 event pairs, 81 based on Foata normal form. 10/587 useless extension candidates. Maximal degree in co-relation 1594. Up to 223 conditions per place. [2025-03-09 06:32:41,425 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 46 selfloop transitions, 6 changer transitions 0/64 dead transitions. [2025-03-09 06:32:41,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 64 transitions, 359 flow [2025-03-09 06:32:41,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:32:41,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:32:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 06:32:41,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-09 06:32:41,427 INFO L175 Difference]: Start difference. First operand has 48 places, 39 transitions, 151 flow. Second operand 5 states and 110 transitions. [2025-03-09 06:32:41,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 64 transitions, 359 flow [2025-03-09 06:32:41,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 64 transitions, 349 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:32:41,429 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 180 flow [2025-03-09 06:32:41,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=180, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2025-03-09 06:32:41,429 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2025-03-09 06:32:41,429 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 180 flow [2025-03-09 06:32:41,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:41,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:41,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:32:41,430 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:41,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:41,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1217329078, now seen corresponding path program 1 times [2025-03-09 06:32:41,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:41,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393610999] [2025-03-09 06:32:41,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:41,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:41,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-09 06:32:41,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-09 06:32:41,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:41,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:41,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:41,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:41,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393610999] [2025-03-09 06:32:41,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393610999] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:41,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:41,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:41,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550343096] [2025-03-09 06:32:41,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:41,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:32:41,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:41,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:32:41,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:32:41,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:41,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 180 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:41,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:41,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:41,644 INFO L124 PetriNetUnfolderBase]: 245/768 cut-off events. [2025-03-09 06:32:41,645 INFO L125 PetriNetUnfolderBase]: For 731/762 co-relation queries the response was YES. [2025-03-09 06:32:41,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2036 conditions, 768 events. 245/768 cut-off events. For 731/762 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 4363 event pairs, 105 based on Foata normal form. 16/773 useless extension candidates. Maximal degree in co-relation 2015. Up to 272 conditions per place. [2025-03-09 06:32:41,648 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 65 selfloop transitions, 7 changer transitions 0/84 dead transitions. [2025-03-09 06:32:41,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 509 flow [2025-03-09 06:32:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:32:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:32:41,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 135 transitions. [2025-03-09 06:32:41,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6428571428571429 [2025-03-09 06:32:41,649 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 180 flow. Second operand 6 states and 135 transitions. [2025-03-09 06:32:41,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 509 flow [2025-03-09 06:32:41,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 504 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:32:41,653 INFO L231 Difference]: Finished difference. Result has 59 places, 45 transitions, 233 flow [2025-03-09 06:32:41,653 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=233, PETRI_PLACES=59, PETRI_TRANSITIONS=45} [2025-03-09 06:32:41,654 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 25 predicate places. [2025-03-09 06:32:41,654 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 45 transitions, 233 flow [2025-03-09 06:32:41,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,654 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:41,654 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:41,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:32:41,654 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:41,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:41,654 INFO L85 PathProgramCache]: Analyzing trace with hash -959509969, now seen corresponding path program 1 times [2025-03-09 06:32:41,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:41,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052033764] [2025-03-09 06:32:41,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:41,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:41,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:32:41,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:32:41,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:41,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:41,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:41,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:41,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052033764] [2025-03-09 06:32:41,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052033764] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:41,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:41,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:41,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473234977] [2025-03-09 06:32:41,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:41,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:32:41,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:41,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:32:41,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:32:41,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:41,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 45 transitions, 233 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:41,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:41,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:41,866 INFO L124 PetriNetUnfolderBase]: 244/721 cut-off events. [2025-03-09 06:32:41,866 INFO L125 PetriNetUnfolderBase]: For 1022/1093 co-relation queries the response was YES. [2025-03-09 06:32:41,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 721 events. 244/721 cut-off events. For 1022/1093 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3878 event pairs, 100 based on Foata normal form. 5/724 useless extension candidates. Maximal degree in co-relation 2053. Up to 447 conditions per place. [2025-03-09 06:32:41,870 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 51 selfloop transitions, 7 changer transitions 0/70 dead transitions. [2025-03-09 06:32:41,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 464 flow [2025-03-09 06:32:41,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:32:41,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:32:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2025-03-09 06:32:41,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-09 06:32:41,872 INFO L175 Difference]: Start difference. First operand has 59 places, 45 transitions, 233 flow. Second operand 5 states and 110 transitions. [2025-03-09 06:32:41,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 464 flow [2025-03-09 06:32:41,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 70 transitions, 457 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-09 06:32:41,877 INFO L231 Difference]: Finished difference. Result has 63 places, 47 transitions, 267 flow [2025-03-09 06:32:41,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=63, PETRI_TRANSITIONS=47} [2025-03-09 06:32:41,878 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 29 predicate places. [2025-03-09 06:32:41,879 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 47 transitions, 267 flow [2025-03-09 06:32:41,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:41,879 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:41,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-09 06:32:41,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:41,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:41,880 INFO L85 PathProgramCache]: Analyzing trace with hash 917504451, now seen corresponding path program 1 times [2025-03-09 06:32:41,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:41,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021885767] [2025-03-09 06:32:41,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:41,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:41,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-09 06:32:41,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-09 06:32:41,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:41,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:41,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:41,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:41,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021885767] [2025-03-09 06:32:41,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021885767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:41,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:41,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:41,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849453087] [2025-03-09 06:32:41,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:41,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:32:41,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:41,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:32:41,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:32:41,934 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:41,935 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 47 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:41,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:41,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:41,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:42,070 INFO L124 PetriNetUnfolderBase]: 242/799 cut-off events. [2025-03-09 06:32:42,070 INFO L125 PetriNetUnfolderBase]: For 1207/1214 co-relation queries the response was YES. [2025-03-09 06:32:42,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2272 conditions, 799 events. 242/799 cut-off events. For 1207/1214 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 4815 event pairs, 121 based on Foata normal form. 3/792 useless extension candidates. Maximal degree in co-relation 2245. Up to 457 conditions per place. [2025-03-09 06:32:42,074 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 50 selfloop transitions, 9 changer transitions 0/71 dead transitions. [2025-03-09 06:32:42,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 71 transitions, 494 flow [2025-03-09 06:32:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:32:42,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:32:42,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 137 transitions. [2025-03-09 06:32:42,075 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5591836734693878 [2025-03-09 06:32:42,075 INFO L175 Difference]: Start difference. First operand has 63 places, 47 transitions, 267 flow. Second operand 7 states and 137 transitions. [2025-03-09 06:32:42,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 71 transitions, 494 flow [2025-03-09 06:32:42,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 71 transitions, 481 flow, removed 4 selfloop flow, removed 2 redundant places. [2025-03-09 06:32:42,079 INFO L231 Difference]: Finished difference. Result has 69 places, 50 transitions, 310 flow [2025-03-09 06:32:42,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=310, PETRI_PLACES=69, PETRI_TRANSITIONS=50} [2025-03-09 06:32:42,079 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 35 predicate places. [2025-03-09 06:32:42,080 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 50 transitions, 310 flow [2025-03-09 06:32:42,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:42,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:42,080 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:42,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:32:42,080 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread_function_mutexErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:42,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:42,081 INFO L85 PathProgramCache]: Analyzing trace with hash 660579815, now seen corresponding path program 1 times [2025-03-09 06:32:42,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:42,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-03-09 06:32:42,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:42,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:42,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:32:42,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:32:42,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:42,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:42,164 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:42,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:42,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310293470] [2025-03-09 06:32:42,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310293470] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:42,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516172050] [2025-03-09 06:32:42,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:42,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:42,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:42,168 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:42,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-09 06:32:42,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-09 06:32:42,221 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-09 06:32:42,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:42,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:42,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:32:42,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:42,283 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:32:42,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516172050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:42,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:32:42,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 8 [2025-03-09 06:32:42,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006466412] [2025-03-09 06:32:42,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:42,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:32:42,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:42,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:32:42,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:32:42,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 12 out of 35 [2025-03-09 06:32:42,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 50 transitions, 310 flow. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:42,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:42,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 12 of 35 [2025-03-09 06:32:42,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:42,397 INFO L124 PetriNetUnfolderBase]: 245/733 cut-off events. [2025-03-09 06:32:42,397 INFO L125 PetriNetUnfolderBase]: For 1252/1296 co-relation queries the response was YES. [2025-03-09 06:32:42,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 733 events. 245/733 cut-off events. For 1252/1296 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 4112 event pairs, 119 based on Foata normal form. 22/745 useless extension candidates. Maximal degree in co-relation 2124. Up to 485 conditions per place. [2025-03-09 06:32:42,401 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 42 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2025-03-09 06:32:42,401 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 57 transitions, 417 flow [2025-03-09 06:32:42,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:32:42,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:32:42,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2025-03-09 06:32:42,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5571428571428572 [2025-03-09 06:32:42,402 INFO L175 Difference]: Start difference. First operand has 69 places, 50 transitions, 310 flow. Second operand 4 states and 78 transitions. [2025-03-09 06:32:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 57 transitions, 417 flow [2025-03-09 06:32:42,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 399 flow, removed 1 selfloop flow, removed 5 redundant places. [2025-03-09 06:32:42,406 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 278 flow [2025-03-09 06:32:42,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=278, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-03-09 06:32:42,406 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 30 predicate places. [2025-03-09 06:32:42,407 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 278 flow [2025-03-09 06:32:42,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:42,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:42,407 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:42,417 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-09 06:32:42,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-09 06:32:42,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:42,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:42,608 INFO L85 PathProgramCache]: Analyzing trace with hash -996862010, now seen corresponding path program 1 times [2025-03-09 06:32:42,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:42,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116975468] [2025-03-09 06:32:42,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:42,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:42,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:32:42,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:32:42,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:42,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:42,670 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:42,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:42,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116975468] [2025-03-09 06:32:42,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116975468] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:42,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951833270] [2025-03-09 06:32:42,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:42,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:42,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:42,673 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:42,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-09 06:32:42,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-09 06:32:42,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-09 06:32:42,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:42,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:42,722 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-09 06:32:42,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:42,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:42,752 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:32:42,798 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:42,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951833270] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:32:42,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:32:42,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-09 06:32:42,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369552656] [2025-03-09 06:32:42,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:32:42,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:32:42,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:42,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:32:42,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:32:42,820 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:42,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 278 flow. Second operand has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:42,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:42,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:42,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:43,162 INFO L124 PetriNetUnfolderBase]: 535/1731 cut-off events. [2025-03-09 06:32:43,162 INFO L125 PetriNetUnfolderBase]: For 2766/2896 co-relation queries the response was YES. [2025-03-09 06:32:43,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4692 conditions, 1731 events. 535/1731 cut-off events. For 2766/2896 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 12789 event pairs, 86 based on Foata normal form. 66/1784 useless extension candidates. Maximal degree in co-relation 4664. Up to 354 conditions per place. [2025-03-09 06:32:43,169 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 153 selfloop transitions, 28 changer transitions 0/193 dead transitions. [2025-03-09 06:32:43,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 193 transitions, 1306 flow [2025-03-09 06:32:43,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:32:43,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 06:32:43,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 367 transitions. [2025-03-09 06:32:43,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6553571428571429 [2025-03-09 06:32:43,171 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 278 flow. Second operand 16 states and 367 transitions. [2025-03-09 06:32:43,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 193 transitions, 1306 flow [2025-03-09 06:32:43,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 193 transitions, 1305 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:32:43,178 INFO L231 Difference]: Finished difference. Result has 86 places, 73 transitions, 584 flow [2025-03-09 06:32:43,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=277, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=584, PETRI_PLACES=86, PETRI_TRANSITIONS=73} [2025-03-09 06:32:43,179 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 52 predicate places. [2025-03-09 06:32:43,179 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 73 transitions, 584 flow [2025-03-09 06:32:43,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 15.5) internal successors, (186), 12 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:43,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:43,180 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:43,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:32:43,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-09 06:32:43,384 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread_function_mutexErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:43,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:43,385 INFO L85 PathProgramCache]: Analyzing trace with hash -2111989207, now seen corresponding path program 1 times [2025-03-09 06:32:43,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:43,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-03-09 06:32:43,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:43,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:43,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:32:43,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:32:43,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:43,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:43,441 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:43,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:43,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254277477] [2025-03-09 06:32:43,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254277477] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:43,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810713606] [2025-03-09 06:32:43,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:43,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:43,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:43,444 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:43,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-09 06:32:43,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:32:43,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:32:43,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:43,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:43,497 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:32:43,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:43,534 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:43,535 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:32:43,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810713606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:43,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:32:43,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:32:43,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550585763] [2025-03-09 06:32:43,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:43,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:32:43,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:43,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:32:43,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:32:43,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 35 [2025-03-09 06:32:43,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 73 transitions, 584 flow. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:43,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:43,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 35 [2025-03-09 06:32:43,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:43,762 INFO L124 PetriNetUnfolderBase]: 548/1649 cut-off events. [2025-03-09 06:32:43,762 INFO L125 PetriNetUnfolderBase]: For 3184/3302 co-relation queries the response was YES. [2025-03-09 06:32:43,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 1649 events. 548/1649 cut-off events. For 3184/3302 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 12006 event pairs, 52 based on Foata normal form. 55/1649 useless extension candidates. Maximal degree in co-relation 4871. Up to 680 conditions per place. [2025-03-09 06:32:43,768 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 115 selfloop transitions, 5 changer transitions 0/136 dead transitions. [2025-03-09 06:32:43,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 136 transitions, 1258 flow [2025-03-09 06:32:43,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:32:43,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:32:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 138 transitions. [2025-03-09 06:32:43,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6571428571428571 [2025-03-09 06:32:43,771 INFO L175 Difference]: Start difference. First operand has 86 places, 73 transitions, 584 flow. Second operand 6 states and 138 transitions. [2025-03-09 06:32:43,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 136 transitions, 1258 flow [2025-03-09 06:32:43,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 136 transitions, 1060 flow, removed 84 selfloop flow, removed 6 redundant places. [2025-03-09 06:32:43,778 INFO L231 Difference]: Finished difference. Result has 84 places, 72 transitions, 486 flow [2025-03-09 06:32:43,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=486, PETRI_PLACES=84, PETRI_TRANSITIONS=72} [2025-03-09 06:32:43,780 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-09 06:32:43,780 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 72 transitions, 486 flow [2025-03-09 06:32:43,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 6 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:43,780 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:43,780 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:43,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-09 06:32:43,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:43,985 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:43,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:43,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1943690934, now seen corresponding path program 1 times [2025-03-09 06:32:43,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:43,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736750053] [2025-03-09 06:32:43,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:43,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:43,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:32:43,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:32:43,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:43,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:44,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736750053] [2025-03-09 06:32:44,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1736750053] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:44,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575375256] [2025-03-09 06:32:44,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:44,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:44,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:44,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:44,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-09 06:32:44,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-09 06:32:44,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-09 06:32:44,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:44,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:44,095 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-09 06:32:44,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:44,125 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:32:44,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575375256] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:44,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:32:44,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-09 06:32:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279471436] [2025-03-09 06:32:44,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:44,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:32:44,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:44,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:32:44,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:32:44,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-09 06:32:44,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 72 transitions, 486 flow. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:44,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:44,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-09 06:32:44,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:44,323 INFO L124 PetriNetUnfolderBase]: 675/1982 cut-off events. [2025-03-09 06:32:44,323 INFO L125 PetriNetUnfolderBase]: For 3718/3760 co-relation queries the response was YES. [2025-03-09 06:32:44,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 1982 events. 675/1982 cut-off events. For 3718/3760 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 14790 event pairs, 81 based on Foata normal form. 75/1975 useless extension candidates. Maximal degree in co-relation 5851. Up to 798 conditions per place. [2025-03-09 06:32:44,332 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 138 selfloop transitions, 5 changer transitions 0/157 dead transitions. [2025-03-09 06:32:44,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 157 transitions, 1331 flow [2025-03-09 06:32:44,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:32:44,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:32:44,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2025-03-09 06:32:44,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-09 06:32:44,333 INFO L175 Difference]: Start difference. First operand has 84 places, 72 transitions, 486 flow. Second operand 6 states and 140 transitions. [2025-03-09 06:32:44,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 157 transitions, 1331 flow [2025-03-09 06:32:44,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 157 transitions, 1306 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:32:44,340 INFO L231 Difference]: Finished difference. Result has 85 places, 71 transitions, 487 flow [2025-03-09 06:32:44,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=487, PETRI_PLACES=85, PETRI_TRANSITIONS=71} [2025-03-09 06:32:44,340 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 51 predicate places. [2025-03-09 06:32:44,340 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 71 transitions, 487 flow [2025-03-09 06:32:44,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 6 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:44,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:44,341 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:32:44,349 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-09 06:32:44,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:44,541 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread_function_mutexErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:44,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:44,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1047155766, now seen corresponding path program 1 times [2025-03-09 06:32:44,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:44,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016766960] [2025-03-09 06:32:44,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:44,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:44,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:32:44,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:32:44,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:44,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:32:44,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:44,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016766960] [2025-03-09 06:32:44,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016766960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:44,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:44,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:44,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318872124] [2025-03-09 06:32:44,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:44,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:32:44,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:44,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:32:44,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:32:44,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 14 out of 35 [2025-03-09 06:32:44,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 71 transitions, 487 flow. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:44,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:44,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 14 of 35 [2025-03-09 06:32:44,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:44,721 INFO L124 PetriNetUnfolderBase]: 605/1811 cut-off events. [2025-03-09 06:32:44,721 INFO L125 PetriNetUnfolderBase]: For 3423/3458 co-relation queries the response was YES. [2025-03-09 06:32:44,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5473 conditions, 1811 events. 605/1811 cut-off events. For 3423/3458 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 13095 event pairs, 133 based on Foata normal form. 55/1866 useless extension candidates. Maximal degree in co-relation 5438. Up to 706 conditions per place. [2025-03-09 06:32:44,729 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 89 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-03-09 06:32:44,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 109 transitions, 902 flow [2025-03-09 06:32:44,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:32:44,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:32:44,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-09 06:32:44,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6214285714285714 [2025-03-09 06:32:44,731 INFO L175 Difference]: Start difference. First operand has 85 places, 71 transitions, 487 flow. Second operand 4 states and 87 transitions. [2025-03-09 06:32:44,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 109 transitions, 902 flow [2025-03-09 06:32:44,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 109 transitions, 883 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-09 06:32:44,738 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 494 flow [2025-03-09 06:32:44,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=494, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2025-03-09 06:32:44,739 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-09 06:32:44,739 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 494 flow [2025-03-09 06:32:44,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:44,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:44,739 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:32:44,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-09 06:32:44,740 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:44,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:44,740 INFO L85 PathProgramCache]: Analyzing trace with hash -124876626, now seen corresponding path program 1 times [2025-03-09 06:32:44,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729332018] [2025-03-09 06:32:44,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:44,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:32:44,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:32:44,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:44,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:44,779 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:32:44,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:44,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729332018] [2025-03-09 06:32:44,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729332018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:32:44,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:32:44,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:32:44,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288692664] [2025-03-09 06:32:44,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:32:44,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:32:44,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:44,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:32:44,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:32:44,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:44,786 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 494 flow. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:44,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:44,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:44,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:44,938 INFO L124 PetriNetUnfolderBase]: 739/2042 cut-off events. [2025-03-09 06:32:44,938 INFO L125 PetriNetUnfolderBase]: For 4550/4554 co-relation queries the response was YES. [2025-03-09 06:32:44,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6504 conditions, 2042 events. 739/2042 cut-off events. For 4550/4554 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 14523 event pairs, 177 based on Foata normal form. 75/2110 useless extension candidates. Maximal degree in co-relation 6470. Up to 824 conditions per place. [2025-03-09 06:32:44,950 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 112 selfloop transitions, 6 changer transitions 0/131 dead transitions. [2025-03-09 06:32:44,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 131 transitions, 1176 flow [2025-03-09 06:32:44,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:32:44,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:32:44,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 88 transitions. [2025-03-09 06:32:44,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6285714285714286 [2025-03-09 06:32:44,952 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 494 flow. Second operand 4 states and 88 transitions. [2025-03-09 06:32:44,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 131 transitions, 1176 flow [2025-03-09 06:32:44,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 131 transitions, 1150 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:32:44,961 INFO L231 Difference]: Finished difference. Result has 84 places, 71 transitions, 498 flow [2025-03-09 06:32:44,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=498, PETRI_PLACES=84, PETRI_TRANSITIONS=71} [2025-03-09 06:32:44,961 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 50 predicate places. [2025-03-09 06:32:44,961 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 71 transitions, 498 flow [2025-03-09 06:32:44,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:44,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:44,962 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:32:44,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:32:44,962 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:44,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:44,963 INFO L85 PathProgramCache]: Analyzing trace with hash -864707431, now seen corresponding path program 1 times [2025-03-09 06:32:44,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:44,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577303079] [2025-03-09 06:32:44,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:44,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:44,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:32:44,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:32:44,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:44,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:45,161 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577303079] [2025-03-09 06:32:45,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577303079] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:45,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030690212] [2025-03-09 06:32:45,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:45,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:45,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:45,164 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:45,166 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-09 06:32:45,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-09 06:32:45,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-09 06:32:45,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:45,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:45,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-09 06:32:45,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:45,288 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:45,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:32:45,418 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:45,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030690212] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:32:45,418 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:32:45,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-09 06:32:45,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937371459] [2025-03-09 06:32:45,419 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:32:45,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-09 06:32:45,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:45,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-09 06:32:45,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-09 06:32:45,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:45,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 71 transitions, 498 flow. Second operand has 22 states, 22 states have (on average 15.863636363636363) internal successors, (349), 22 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:45,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:45,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:45,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:46,914 INFO L124 PetriNetUnfolderBase]: 2847/8721 cut-off events. [2025-03-09 06:32:46,914 INFO L125 PetriNetUnfolderBase]: For 32196/32196 co-relation queries the response was YES. [2025-03-09 06:32:46,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27662 conditions, 8721 events. 2847/8721 cut-off events. For 32196/32196 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 75105 event pairs, 320 based on Foata normal form. 454/9159 useless extension candidates. Maximal degree in co-relation 27628. Up to 1262 conditions per place. [2025-03-09 06:32:46,955 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 541 selfloop transitions, 133 changer transitions 0/684 dead transitions. [2025-03-09 06:32:46,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 684 transitions, 5394 flow [2025-03-09 06:32:46,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2025-03-09 06:32:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2025-03-09 06:32:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 1275 transitions. [2025-03-09 06:32:46,959 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6746031746031746 [2025-03-09 06:32:46,959 INFO L175 Difference]: Start difference. First operand has 84 places, 71 transitions, 498 flow. Second operand 54 states and 1275 transitions. [2025-03-09 06:32:46,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 684 transitions, 5394 flow [2025-03-09 06:32:47,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 684 transitions, 5188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:32:47,046 INFO L231 Difference]: Finished difference. Result has 171 places, 189 transitions, 1983 flow [2025-03-09 06:32:47,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=54, PETRI_FLOW=1983, PETRI_PLACES=171, PETRI_TRANSITIONS=189} [2025-03-09 06:32:47,047 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 137 predicate places. [2025-03-09 06:32:47,047 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 189 transitions, 1983 flow [2025-03-09 06:32:47,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 15.863636363636363) internal successors, (349), 22 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:47,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:47,047 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:32:47,054 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-09 06:32:47,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-09 06:32:47,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:47,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:47,253 INFO L85 PathProgramCache]: Analyzing trace with hash -2107779597, now seen corresponding path program 1 times [2025-03-09 06:32:47,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:47,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478424528] [2025-03-09 06:32:47,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:47,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:47,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:32:47,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:32:47,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:47,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:47,488 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:47,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478424528] [2025-03-09 06:32:47,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478424528] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:47,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831432432] [2025-03-09 06:32:47,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:47,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:47,491 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:47,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-09 06:32:47,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:32:47,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:32:47,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:47,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:47,561 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-09 06:32:47,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:47,656 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:47,656 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:32:47,864 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:47,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831432432] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:32:47,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:32:47,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 26 [2025-03-09 06:32:47,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721965075] [2025-03-09 06:32:47,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:32:47,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 06:32:47,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:47,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:32:47,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=511, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:32:47,907 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:47,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 189 transitions, 1983 flow. Second operand has 28 states, 28 states have (on average 16.607142857142858) internal successors, (465), 28 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:47,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:47,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:47,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:32:53,508 INFO L124 PetriNetUnfolderBase]: 10347/32337 cut-off events. [2025-03-09 06:32:53,509 INFO L125 PetriNetUnfolderBase]: For 673066/673066 co-relation queries the response was YES. [2025-03-09 06:32:53,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106278 conditions, 32337 events. 10347/32337 cut-off events. For 673066/673066 co-relation queries the response was YES. Maximal size of possible extension queue 439. Compared 331313 event pairs, 1436 based on Foata normal form. 1087/33397 useless extension candidates. Maximal degree in co-relation 106206. Up to 4786 conditions per place. [2025-03-09 06:32:53,746 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 908 selfloop transitions, 464 changer transitions 0/1382 dead transitions. [2025-03-09 06:32:53,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 1382 transitions, 13012 flow [2025-03-09 06:32:53,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-03-09 06:32:53,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2025-03-09 06:32:53,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 2028 transitions. [2025-03-09 06:32:53,750 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6737541528239203 [2025-03-09 06:32:53,750 INFO L175 Difference]: Start difference. First operand has 171 places, 189 transitions, 1983 flow. Second operand 86 states and 2028 transitions. [2025-03-09 06:32:53,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 1382 transitions, 13012 flow [2025-03-09 06:32:54,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 247 places, 1382 transitions, 11383 flow, removed 794 selfloop flow, removed 9 redundant places. [2025-03-09 06:32:54,172 INFO L231 Difference]: Finished difference. Result has 297 places, 580 transitions, 6240 flow [2025-03-09 06:32:54,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=130, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=6240, PETRI_PLACES=297, PETRI_TRANSITIONS=580} [2025-03-09 06:32:54,173 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 263 predicate places. [2025-03-09 06:32:54,173 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 580 transitions, 6240 flow [2025-03-09 06:32:54,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 16.607142857142858) internal successors, (465), 28 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:54,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:32:54,173 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-09 06:32:54,179 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-09 06:32:54,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-09 06:32:54,375 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread_function_mutexErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:32:54,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:32:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1650669047, now seen corresponding path program 1 times [2025-03-09 06:32:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:32:54,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734252406] [2025-03-09 06:32:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:32:54,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:32:54,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:32:54,391 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:54,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:54,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:32:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734252406] [2025-03-09 06:32:54,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734252406] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:32:54,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010517923] [2025-03-09 06:32:54,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:32:54,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:32:54,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:32:54,760 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:32:54,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-09 06:32:54,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-09 06:32:54,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-09 06:32:54,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:32:54,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:32:54,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-09 06:32:54,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:32:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:54,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:32:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:32:55,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010517923] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:32:55,184 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:32:55,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 32 [2025-03-09 06:32:55,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99807857] [2025-03-09 06:32:55,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:32:55,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-09 06:32:55,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:32:55,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-09 06:32:55,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=314, Invalid=808, Unknown=0, NotChecked=0, Total=1122 [2025-03-09 06:32:55,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:32:55,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 580 transitions, 6240 flow. Second operand has 34 states, 34 states have (on average 16.147058823529413) internal successors, (549), 34 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:32:55,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:32:55,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:32:55,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:33:13,386 INFO L124 PetriNetUnfolderBase]: 24205/75820 cut-off events. [2025-03-09 06:33:13,386 INFO L125 PetriNetUnfolderBase]: For 4098190/4098190 co-relation queries the response was YES. [2025-03-09 06:33:14,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 259822 conditions, 75820 events. 24205/75820 cut-off events. For 4098190/4098190 co-relation queries the response was YES. Maximal size of possible extension queue 916. Compared 910457 event pairs, 2729 based on Foata normal form. 1523/77311 useless extension candidates. Maximal degree in co-relation 259700. Up to 11430 conditions per place. [2025-03-09 06:33:15,045 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 1411 selfloop transitions, 1180 changer transitions 0/2601 dead transitions. [2025-03-09 06:33:15,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 430 places, 2601 transitions, 26975 flow [2025-03-09 06:33:15,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2025-03-09 06:33:15,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2025-03-09 06:33:15,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 3129 transitions. [2025-03-09 06:33:15,050 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6671641791044776 [2025-03-09 06:33:15,050 INFO L175 Difference]: Start difference. First operand has 297 places, 580 transitions, 6240 flow. Second operand 134 states and 3129 transitions. [2025-03-09 06:33:15,050 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 430 places, 2601 transitions, 26975 flow [2025-03-09 06:33:20,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 408 places, 2601 transitions, 25597 flow, removed 650 selfloop flow, removed 22 redundant places. [2025-03-09 06:33:20,375 INFO L231 Difference]: Finished difference. Result has 456 places, 1296 transitions, 15883 flow [2025-03-09 06:33:20,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5458, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=517, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=134, PETRI_FLOW=15883, PETRI_PLACES=456, PETRI_TRANSITIONS=1296} [2025-03-09 06:33:20,376 INFO L279 CegarLoopForPetriNet]: 34 programPoint places, 422 predicate places. [2025-03-09 06:33:20,376 INFO L471 AbstractCegarLoop]: Abstraction has has 456 places, 1296 transitions, 15883 flow [2025-03-09 06:33:20,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 16.147058823529413) internal successors, (549), 34 states have internal predecessors, (549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:20,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:33:20,377 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2025-03-09 06:33:20,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:33:20,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:20,577 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-09 06:33:20,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:33:20,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1965274225, now seen corresponding path program 2 times [2025-03-09 06:33:20,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:33:20,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924120934] [2025-03-09 06:33:20,578 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:20,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:33:20,590 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-09 06:33:20,603 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 06:33:20,605 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:33:20,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:21,105 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:33:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924120934] [2025-03-09 06:33:21,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924120934] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:33:21,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554222492] [2025-03-09 06:33:21,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-09 06:33:21,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:33:21,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:33:21,108 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-09 06:33:21,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-09 06:33:21,169 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-09 06:33:21,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 114 of 114 statements. [2025-03-09 06:33:21,201 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-09 06:33:21,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:33:21,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-09 06:33:21,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:33:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,339 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:33:21,832 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:33:21,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554222492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:33:21,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:33:21,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 42 [2025-03-09 06:33:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717824443] [2025-03-09 06:33:21,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:33:21,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-09 06:33:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:33:21,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-09 06:33:21,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=1351, Unknown=0, NotChecked=0, Total=1892 [2025-03-09 06:33:21,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 13 out of 35 [2025-03-09 06:33:21,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 456 places, 1296 transitions, 15883 flow. Second operand has 44 states, 44 states have (on average 16.386363636363637) internal successors, (721), 44 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:33:21,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:33:21,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 13 of 35 [2025-03-09 06:33:21,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand