./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/test-easy11.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/test-easy11.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash dd59a2dab1e1a10d8308eb629ebc6f779430a45291e09beb1ad6d6fe62d16e94 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:31:08,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:31:08,547 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:31:08,551 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:31:08,551 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:31:08,565 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:31:08,565 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:31:08,565 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:31:08,566 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:31:08,566 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:31:08,566 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:31:08,566 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:31:08,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:31:08,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:31:08,566 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:31:08,569 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:31:08,569 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:31:08,570 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:31:08,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:31:08,571 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:31:08,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:31:08,571 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 -> dd59a2dab1e1a10d8308eb629ebc6f779430a45291e09beb1ad6d6fe62d16e94 [2025-03-04 15:31:08,793 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:31:08,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:31:08,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:31:08,803 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:31:08,803 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:31:08,804 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/test-easy11.wvr.c [2025-03-04 15:31:09,924 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94a77ce5/5a8b951b20f14f0dbeb096aecde0641c/FLAG063a67de0 [2025-03-04 15:31:10,099 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:31:10,099 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/test-easy11.wvr.c [2025-03-04 15:31:10,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94a77ce5/5a8b951b20f14f0dbeb096aecde0641c/FLAG063a67de0 [2025-03-04 15:31:10,143 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f94a77ce5/5a8b951b20f14f0dbeb096aecde0641c [2025-03-04 15:31:10,147 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:31:10,148 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:31:10,151 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:31:10,151 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:31:10,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:31:10,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,158 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba7706c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10, skipping insertion in model container [2025-03-04 15:31:10,158 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:31:10,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:31:10,296 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:31:10,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:31:10,323 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:31:10,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10 WrapperNode [2025-03-04 15:31:10,324 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:31:10,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:31:10,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:31:10,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:31:10,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,344 INFO L138 Inliner]: procedures = 18, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 43 [2025-03-04 15:31:10,345 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:31:10,345 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:31:10,345 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:31:10,345 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:31:10,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,353 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,364 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-04 15:31:10,364 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,364 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,366 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,367 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,367 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:31:10,369 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:31:10,369 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:31:10,369 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:31:10,371 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (1/1) ... [2025-03-04 15:31:10,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:31:10,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:10,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:31:10,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:31:10,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:31:10,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:31:10,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:31:10,418 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:31:10,418 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:31:10,418 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:31:10,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:31:10,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:31:10,420 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:31:10,482 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:31:10,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:31:10,611 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:31:10,611 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:31:10,687 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:31:10,688 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:31:10,688 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:10 BoogieIcfgContainer [2025-03-04 15:31:10,689 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:31:10,691 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:31:10,692 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:31:10,695 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:31:10,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:31:10" (1/3) ... [2025-03-04 15:31:10,696 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328acc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:31:10, skipping insertion in model container [2025-03-04 15:31:10,696 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:31:10" (2/3) ... [2025-03-04 15:31:10,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@328acc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:31:10, skipping insertion in model container [2025-03-04 15:31:10,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:31:10" (3/3) ... [2025-03-04 15:31:10,698 INFO L128 eAbstractionObserver]: Analyzing ICFG test-easy11.wvr.c [2025-03-04 15:31:10,709 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:31:10,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test-easy11.wvr.c that has 3 procedures, 31 locations, 1 initial locations, 2 loop locations, and 8 error locations. [2025-03-04 15:31:10,711 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:31:10,746 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:31:10,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 37 places, 32 transitions, 78 flow [2025-03-04 15:31:10,800 INFO L124 PetriNetUnfolderBase]: 2/30 cut-off events. [2025-03-04 15:31:10,802 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:31:10,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39 conditions, 30 events. 2/30 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 80 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-03-04 15:31:10,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 37 places, 32 transitions, 78 flow [2025-03-04 15:31:10,806 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 33 places, 28 transitions, 65 flow [2025-03-04 15:31:10,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:31:10,829 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;@42aff7d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:31:10,829 INFO L334 AbstractCegarLoop]: Starting to check reachability of 18 error locations. [2025-03-04 15:31:10,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:31:10,837 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:31:10,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:31:10,837 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:10,838 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:31:10,838 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:10,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:10,843 INFO L85 PathProgramCache]: Analyzing trace with hash 210847816, now seen corresponding path program 1 times [2025-03-04 15:31:10,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:10,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113719452] [2025-03-04 15:31:10,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:10,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:10,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:31:10,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:31:10,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:10,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113719452] [2025-03-04 15:31:11,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113719452] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:11,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976121979] [2025-03-04 15:31:11,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:11,047 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:11,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:31:11,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 28 transitions, 65 flow. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:31:11,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:11,201 INFO L124 PetriNetUnfolderBase]: 173/330 cut-off events. [2025-03-04 15:31:11,201 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 15:31:11,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 330 events. 173/330 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 1462 event pairs, 42 based on Foata normal form. 0/253 useless extension candidates. Maximal degree in co-relation 609. Up to 151 conditions per place. [2025-03-04 15:31:11,205 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 38 selfloop transitions, 5 changer transitions 2/52 dead transitions. [2025-03-04 15:31:11,205 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 52 transitions, 209 flow [2025-03-04 15:31:11,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:11,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 82 transitions. [2025-03-04 15:31:11,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.640625 [2025-03-04 15:31:11,215 INFO L175 Difference]: Start difference. First operand has 33 places, 28 transitions, 65 flow. Second operand 4 states and 82 transitions. [2025-03-04 15:31:11,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 52 transitions, 209 flow [2025-03-04 15:31:11,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 52 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:11,222 INFO L231 Difference]: Finished difference. Result has 35 places, 30 transitions, 84 flow [2025-03-04 15:31:11,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=35, PETRI_TRANSITIONS=30} [2025-03-04 15:31:11,227 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 2 predicate places. [2025-03-04 15:31:11,228 INFO L471 AbstractCegarLoop]: Abstraction has has 35 places, 30 transitions, 84 flow [2025-03-04 15:31:11,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:31:11,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:31:11,228 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:11,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,228 INFO L85 PathProgramCache]: Analyzing trace with hash 210847817, now seen corresponding path program 1 times [2025-03-04 15:31:11,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680493559] [2025-03-04 15:31:11,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:11,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:31:11,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:31:11,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:11,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:11,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680493559] [2025-03-04 15:31:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680493559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64634628] [2025-03-04 15:31:11,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:11,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:11,315 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-03-04 15:31:11,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 30 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-03-04 15:31:11,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:11,422 INFO L124 PetriNetUnfolderBase]: 173/349 cut-off events. [2025-03-04 15:31:11,423 INFO L125 PetriNetUnfolderBase]: For 39/48 co-relation queries the response was YES. [2025-03-04 15:31:11,424 INFO L83 FinitePrefix]: Finished finitePrefix Result has 765 conditions, 349 events. 173/349 cut-off events. For 39/48 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 1646 event pairs, 34 based on Foata normal form. 21/339 useless extension candidates. Maximal degree in co-relation 514. Up to 139 conditions per place. [2025-03-04 15:31:11,426 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 35 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2025-03-04 15:31:11,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 54 transitions, 235 flow [2025-03-04 15:31:11,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:11,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:11,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 84 transitions. [2025-03-04 15:31:11,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.65625 [2025-03-04 15:31:11,428 INFO L175 Difference]: Start difference. First operand has 35 places, 30 transitions, 84 flow. Second operand 4 states and 84 transitions. [2025-03-04 15:31:11,428 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 54 transitions, 235 flow [2025-03-04 15:31:11,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 54 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:11,429 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 139 flow [2025-03-04 15:31:11,429 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=139, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-03-04 15:31:11,430 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2025-03-04 15:31:11,430 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 139 flow [2025-03-04 15:31:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,430 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:31:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:31:11,431 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:11,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,431 INFO L85 PathProgramCache]: Analyzing trace with hash 210847851, now seen corresponding path program 1 times [2025-03-04 15:31:11,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474414176] [2025-03-04 15:31:11,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:11,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:31:11,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:31:11,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:11,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:11,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474414176] [2025-03-04 15:31:11,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474414176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:11,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640546778] [2025-03-04 15:31:11,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:11,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:11,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:11,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 15:31:11,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 139 flow. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 15:31:11,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:11,609 INFO L124 PetriNetUnfolderBase]: 232/410 cut-off events. [2025-03-04 15:31:11,609 INFO L125 PetriNetUnfolderBase]: For 210/214 co-relation queries the response was YES. [2025-03-04 15:31:11,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 410 events. 232/410 cut-off events. For 210/214 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 1854 event pairs, 36 based on Foata normal form. 20/407 useless extension candidates. Maximal degree in co-relation 958. Up to 271 conditions per place. [2025-03-04 15:31:11,612 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 43 selfloop transitions, 7 changer transitions 0/55 dead transitions. [2025-03-04 15:31:11,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 55 transitions, 291 flow [2025-03-04 15:31:11,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:11,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2025-03-04 15:31:11,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4875 [2025-03-04 15:31:11,615 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 139 flow. Second operand 5 states and 78 transitions. [2025-03-04 15:31:11,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 55 transitions, 291 flow [2025-03-04 15:31:11,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 55 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:11,619 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 144 flow [2025-03-04 15:31:11,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2025-03-04 15:31:11,622 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-04 15:31:11,622 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 144 flow [2025-03-04 15:31:11,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:31:11,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:31:11,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:11,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2053651036, now seen corresponding path program 1 times [2025-03-04 15:31:11,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982619330] [2025-03-04 15:31:11,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:11,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,628 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:31:11,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:31:11,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:11,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:11,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982619330] [2025-03-04 15:31:11,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982619330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:11,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281236603] [2025-03-04 15:31:11,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:31:11,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:31:11,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:31:11,664 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:11,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,664 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:11,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:11,719 INFO L124 PetriNetUnfolderBase]: 173/344 cut-off events. [2025-03-04 15:31:11,720 INFO L125 PetriNetUnfolderBase]: For 376/396 co-relation queries the response was YES. [2025-03-04 15:31:11,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 918 conditions, 344 events. 173/344 cut-off events. For 376/396 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 1607 event pairs, 97 based on Foata normal form. 36/352 useless extension candidates. Maximal degree in co-relation 558. Up to 235 conditions per place. [2025-03-04 15:31:11,722 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 33 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2025-03-04 15:31:11,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 44 transitions, 242 flow [2025-03-04 15:31:11,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:31:11,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:31:11,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 15:31:11,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5729166666666666 [2025-03-04 15:31:11,723 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 144 flow. Second operand 3 states and 55 transitions. [2025-03-04 15:31:11,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 44 transitions, 242 flow [2025-03-04 15:31:11,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 228 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:11,726 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 136 flow [2025-03-04 15:31:11,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-03-04 15:31:11,726 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 5 predicate places. [2025-03-04 15:31:11,726 INFO L471 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 136 flow [2025-03-04 15:31:11,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,726 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:11,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:31:11,727 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:11,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,727 INFO L85 PathProgramCache]: Analyzing trace with hash 758323542, now seen corresponding path program 1 times [2025-03-04 15:31:11,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904167872] [2025-03-04 15:31:11,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:11,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:31:11,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:31:11,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:11,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:11,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904167872] [2025-03-04 15:31:11,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904167872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:11,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110542438] [2025-03-04 15:31:11,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:11,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:11,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:11,787 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:31:11,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:31:11,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:11,869 INFO L124 PetriNetUnfolderBase]: 178/332 cut-off events. [2025-03-04 15:31:11,869 INFO L125 PetriNetUnfolderBase]: For 321/341 co-relation queries the response was YES. [2025-03-04 15:31:11,869 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 332 events. 178/332 cut-off events. For 321/341 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1379 event pairs, 51 based on Foata normal form. 20/320 useless extension candidates. Maximal degree in co-relation 497. Up to 149 conditions per place. [2025-03-04 15:31:11,871 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 36 selfloop transitions, 10 changer transitions 0/52 dead transitions. [2025-03-04 15:31:11,871 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 52 transitions, 302 flow [2025-03-04 15:31:11,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:11,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-03-04 15:31:11,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:31:11,872 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 136 flow. Second operand 4 states and 76 transitions. [2025-03-04 15:31:11,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 52 transitions, 302 flow [2025-03-04 15:31:11,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 52 transitions, 286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:11,874 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 177 flow [2025-03-04 15:31:11,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2025-03-04 15:31:11,874 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 8 predicate places. [2025-03-04 15:31:11,874 INFO L471 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 177 flow [2025-03-04 15:31:11,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:11,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:11,874 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:31:11,875 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:11,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:11,875 INFO L85 PathProgramCache]: Analyzing trace with hash 758323543, now seen corresponding path program 1 times [2025-03-04 15:31:11,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:11,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112449541] [2025-03-04 15:31:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:11,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:11,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:31:11,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:31:11,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:11,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:11,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:11,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:11,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112449541] [2025-03-04 15:31:11,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112449541] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:11,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:11,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:11,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351220109] [2025-03-04 15:31:11,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:11,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:31:11,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:11,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:31:11,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:31:11,921 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 10 out of 32 [2025-03-04 15:31:11,921 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 177 flow. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:11,921 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:11,921 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 10 of 32 [2025-03-04 15:31:11,921 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,006 INFO L124 PetriNetUnfolderBase]: 195/380 cut-off events. [2025-03-04 15:31:12,006 INFO L125 PetriNetUnfolderBase]: For 431/451 co-relation queries the response was YES. [2025-03-04 15:31:12,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1127 conditions, 380 events. 195/380 cut-off events. For 431/451 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 1683 event pairs, 54 based on Foata normal form. 30/394 useless extension candidates. Maximal degree in co-relation 615. Up to 161 conditions per place. [2025-03-04 15:31:12,009 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 33 selfloop transitions, 20 changer transitions 0/61 dead transitions. [2025-03-04 15:31:12,009 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 61 transitions, 409 flow [2025-03-04 15:31:12,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:31:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:31:12,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2025-03-04 15:31:12,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.625 [2025-03-04 15:31:12,010 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 177 flow. Second operand 4 states and 80 transitions. [2025-03-04 15:31:12,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 61 transitions, 409 flow [2025-03-04 15:31:12,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 61 transitions, 392 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:12,012 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 309 flow [2025-03-04 15:31:12,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=309, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2025-03-04 15:31:12,013 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2025-03-04 15:31:12,013 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 309 flow [2025-03-04 15:31:12,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,013 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,013 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:31:12,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:12,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,016 INFO L85 PathProgramCache]: Analyzing trace with hash 758323577, now seen corresponding path program 1 times [2025-03-04 15:31:12,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56972468] [2025-03-04 15:31:12,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:31:12,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:31:12,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:12,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56972468] [2025-03-04 15:31:12,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56972468] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:12,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:12,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:12,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154133110] [2025-03-04 15:31:12,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:12,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:12,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:12,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:12,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:12,070 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 15:31:12,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 309 flow. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:12,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 15:31:12,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,162 INFO L124 PetriNetUnfolderBase]: 254/428 cut-off events. [2025-03-04 15:31:12,162 INFO L125 PetriNetUnfolderBase]: For 653/685 co-relation queries the response was YES. [2025-03-04 15:31:12,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506 conditions, 428 events. 254/428 cut-off events. For 653/685 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1687 event pairs, 22 based on Foata normal form. 47/473 useless extension candidates. Maximal degree in co-relation 830. Up to 262 conditions per place. [2025-03-04 15:31:12,166 INFO L140 encePairwiseOnDemand]: 27/32 looper letters, 56 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2025-03-04 15:31:12,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 67 transitions, 543 flow [2025-03-04 15:31:12,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:12,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2025-03-04 15:31:12,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4625 [2025-03-04 15:31:12,168 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 309 flow. Second operand 5 states and 74 transitions. [2025-03-04 15:31:12,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 67 transitions, 543 flow [2025-03-04 15:31:12,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 67 transitions, 522 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:12,172 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 304 flow [2025-03-04 15:31:12,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=304, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2025-03-04 15:31:12,173 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2025-03-04 15:31:12,173 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 304 flow [2025-03-04 15:31:12,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:31:12,173 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:12,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2126317864, now seen corresponding path program 1 times [2025-03-04 15:31:12,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523351400] [2025-03-04 15:31:12,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:31:12,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:31:12,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:12,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523351400] [2025-03-04 15:31:12,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523351400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:12,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:12,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:12,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334868403] [2025-03-04 15:31:12,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:12,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:12,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:12,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:12,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:12,248 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:12,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 304 flow. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:12,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:12,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,338 INFO L124 PetriNetUnfolderBase]: 174/329 cut-off events. [2025-03-04 15:31:12,338 INFO L125 PetriNetUnfolderBase]: For 695/717 co-relation queries the response was YES. [2025-03-04 15:31:12,339 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1144 conditions, 329 events. 174/329 cut-off events. For 695/717 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1348 event pairs, 35 based on Foata normal form. 34/362 useless extension candidates. Maximal degree in co-relation 867. Up to 157 conditions per place. [2025-03-04 15:31:12,340 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 42 selfloop transitions, 24 changer transitions 0/73 dead transitions. [2025-03-04 15:31:12,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 73 transitions, 582 flow [2025-03-04 15:31:12,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:12,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:12,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-03-04 15:31:12,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55625 [2025-03-04 15:31:12,341 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 304 flow. Second operand 5 states and 89 transitions. [2025-03-04 15:31:12,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 73 transitions, 582 flow [2025-03-04 15:31:12,342 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 73 transitions, 550 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:12,343 INFO L231 Difference]: Finished difference. Result has 49 places, 52 transitions, 408 flow [2025-03-04 15:31:12,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=290, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=49, PETRI_TRANSITIONS=52} [2025-03-04 15:31:12,344 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2025-03-04 15:31:12,344 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 52 transitions, 408 flow [2025-03-04 15:31:12,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,346 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:31:12,346 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:12,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,346 INFO L85 PathProgramCache]: Analyzing trace with hash 2033194593, now seen corresponding path program 1 times [2025-03-04 15:31:12,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475720579] [2025-03-04 15:31:12,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:31:12,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:31:12,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:12,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475720579] [2025-03-04 15:31:12,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475720579] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:12,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:12,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:31:12,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949134082] [2025-03-04 15:31:12,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:12,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:31:12,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:12,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:31:12,371 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:31:12,375 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:12,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 52 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:12,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:12,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,427 INFO L124 PetriNetUnfolderBase]: 174/314 cut-off events. [2025-03-04 15:31:12,427 INFO L125 PetriNetUnfolderBase]: For 1020/1040 co-relation queries the response was YES. [2025-03-04 15:31:12,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1256 conditions, 314 events. 174/314 cut-off events. For 1020/1040 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1219 event pairs, 76 based on Foata normal form. 33/345 useless extension candidates. Maximal degree in co-relation 823. Up to 233 conditions per place. [2025-03-04 15:31:12,429 INFO L140 encePairwiseOnDemand]: 29/32 looper letters, 50 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2025-03-04 15:31:12,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 60 transitions, 578 flow [2025-03-04 15:31:12,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:31:12,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:31:12,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2025-03-04 15:31:12,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5416666666666666 [2025-03-04 15:31:12,429 INFO L175 Difference]: Start difference. First operand has 49 places, 52 transitions, 408 flow. Second operand 3 states and 52 transitions. [2025-03-04 15:31:12,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 60 transitions, 578 flow [2025-03-04 15:31:12,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 555 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:12,431 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 393 flow [2025-03-04 15:31:12,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=393, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2025-03-04 15:31:12,432 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2025-03-04 15:31:12,432 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 393 flow [2025-03-04 15:31:12,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,432 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:31:12,432 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:12,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1941299316, now seen corresponding path program 1 times [2025-03-04 15:31:12,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708283202] [2025-03-04 15:31:12,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:12,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:12,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:12,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708283202] [2025-03-04 15:31:12,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708283202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:12,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:12,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:12,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518402786] [2025-03-04 15:31:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:12,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:12,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:12,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:12,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:12,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:31:12,505 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,505 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:12,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:31:12,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,657 INFO L124 PetriNetUnfolderBase]: 256/477 cut-off events. [2025-03-04 15:31:12,657 INFO L125 PetriNetUnfolderBase]: For 1123/1133 co-relation queries the response was YES. [2025-03-04 15:31:12,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1711 conditions, 477 events. 256/477 cut-off events. For 1123/1133 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2117 event pairs, 30 based on Foata normal form. 15/492 useless extension candidates. Maximal degree in co-relation 1033. Up to 140 conditions per place. [2025-03-04 15:31:12,660 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 51 selfloop transitions, 37 changer transitions 0/92 dead transitions. [2025-03-04 15:31:12,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 747 flow [2025-03-04 15:31:12,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:31:12,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:31:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 158 transitions. [2025-03-04 15:31:12,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486111111111112 [2025-03-04 15:31:12,661 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 393 flow. Second operand 9 states and 158 transitions. [2025-03-04 15:31:12,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 747 flow [2025-03-04 15:31:12,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 92 transitions, 723 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:12,664 INFO L231 Difference]: Finished difference. Result has 57 places, 61 transitions, 535 flow [2025-03-04 15:31:12,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=535, PETRI_PLACES=57, PETRI_TRANSITIONS=61} [2025-03-04 15:31:12,665 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 24 predicate places. [2025-03-04 15:31:12,665 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 61 transitions, 535 flow [2025-03-04 15:31:12,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:12,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,665 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:31:12,665 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:12,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,665 INFO L85 PathProgramCache]: Analyzing trace with hash -636298681, now seen corresponding path program 1 times [2025-03-04 15:31:12,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076625580] [2025-03-04 15:31:12,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:12,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:12,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:12,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:12,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076625580] [2025-03-04 15:31:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076625580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:12,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:12,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:12,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040001346] [2025-03-04 15:31:12,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:12,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:12,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:12,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:12,719 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:12,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 61 transitions, 535 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:12,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:12,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:12,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:12,880 INFO L124 PetriNetUnfolderBase]: 329/568 cut-off events. [2025-03-04 15:31:12,881 INFO L125 PetriNetUnfolderBase]: For 1989/1989 co-relation queries the response was YES. [2025-03-04 15:31:12,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2290 conditions, 568 events. 329/568 cut-off events. For 1989/1989 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2409 event pairs, 62 based on Foata normal form. 10/577 useless extension candidates. Maximal degree in co-relation 1796. Up to 256 conditions per place. [2025-03-04 15:31:12,884 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 61 selfloop transitions, 38 changer transitions 0/101 dead transitions. [2025-03-04 15:31:12,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 101 transitions, 1034 flow [2025-03-04 15:31:12,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:12,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 123 transitions. [2025-03-04 15:31:12,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48046875 [2025-03-04 15:31:12,885 INFO L175 Difference]: Start difference. First operand has 57 places, 61 transitions, 535 flow. Second operand 8 states and 123 transitions. [2025-03-04 15:31:12,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 101 transitions, 1034 flow [2025-03-04 15:31:12,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 894 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:12,890 INFO L231 Difference]: Finished difference. Result has 61 places, 77 transitions, 698 flow [2025-03-04 15:31:12,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=698, PETRI_PLACES=61, PETRI_TRANSITIONS=77} [2025-03-04 15:31:12,891 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2025-03-04 15:31:12,891 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 77 transitions, 698 flow [2025-03-04 15:31:12,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:12,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:12,891 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:12,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:31:12,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:12,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:12,892 INFO L85 PathProgramCache]: Analyzing trace with hash -624071021, now seen corresponding path program 2 times [2025-03-04 15:31:12,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:12,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711786772] [2025-03-04 15:31:12,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:12,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:12,895 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:12,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:12,897 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:12,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:12,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:12,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:12,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711786772] [2025-03-04 15:31:12,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711786772] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:12,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:12,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:12,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164487141] [2025-03-04 15:31:12,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:12,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:12,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:12,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:12,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:12,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:12,939 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 77 transitions, 698 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:12,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:12,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:12,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:13,066 INFO L124 PetriNetUnfolderBase]: 341/608 cut-off events. [2025-03-04 15:31:13,067 INFO L125 PetriNetUnfolderBase]: For 1701/1701 co-relation queries the response was YES. [2025-03-04 15:31:13,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2487 conditions, 608 events. 341/608 cut-off events. For 1701/1701 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 2616 event pairs, 74 based on Foata normal form. 10/617 useless extension candidates. Maximal degree in co-relation 2077. Up to 200 conditions per place. [2025-03-04 15:31:13,070 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 59 selfloop transitions, 42 changer transitions 0/103 dead transitions. [2025-03-04 15:31:13,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 103 transitions, 1060 flow [2025-03-04 15:31:13,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:13,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:13,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 121 transitions. [2025-03-04 15:31:13,071 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47265625 [2025-03-04 15:31:13,071 INFO L175 Difference]: Start difference. First operand has 61 places, 77 transitions, 698 flow. Second operand 8 states and 121 transitions. [2025-03-04 15:31:13,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 103 transitions, 1060 flow [2025-03-04 15:31:13,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 1011 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:13,078 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 846 flow [2025-03-04 15:31:13,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=846, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2025-03-04 15:31:13,080 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 36 predicate places. [2025-03-04 15:31:13,080 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 846 flow [2025-03-04 15:31:13,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,080 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:13,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:13,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:31:13,081 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:13,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:13,081 INFO L85 PathProgramCache]: Analyzing trace with hash -633331960, now seen corresponding path program 2 times [2025-03-04 15:31:13,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:13,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479003111] [2025-03-04 15:31:13,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:13,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:13,085 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:13,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:13,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:13,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:13,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:13,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:13,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479003111] [2025-03-04 15:31:13,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479003111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:13,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:13,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:13,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550575003] [2025-03-04 15:31:13,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:13,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:13,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:13,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:13,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:13,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:31:13,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 846 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:13,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:13,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:31:13,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:13,328 INFO L124 PetriNetUnfolderBase]: 348/649 cut-off events. [2025-03-04 15:31:13,328 INFO L125 PetriNetUnfolderBase]: For 2768/2782 co-relation queries the response was YES. [2025-03-04 15:31:13,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2894 conditions, 649 events. 348/649 cut-off events. For 2768/2782 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3133 event pairs, 36 based on Foata normal form. 25/666 useless extension candidates. Maximal degree in co-relation 2487. Up to 300 conditions per place. [2025-03-04 15:31:13,332 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 59 selfloop transitions, 56 changer transitions 2/122 dead transitions. [2025-03-04 15:31:13,332 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 122 transitions, 1397 flow [2025-03-04 15:31:13,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:13,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 144 transitions. [2025-03-04 15:31:13,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5625 [2025-03-04 15:31:13,333 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 846 flow. Second operand 8 states and 144 transitions. [2025-03-04 15:31:13,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 122 transitions, 1397 flow [2025-03-04 15:31:13,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 122 transitions, 1351 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:13,340 INFO L231 Difference]: Finished difference. Result has 76 places, 90 transitions, 1082 flow [2025-03-04 15:31:13,340 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=807, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1082, PETRI_PLACES=76, PETRI_TRANSITIONS=90} [2025-03-04 15:31:13,341 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 43 predicate places. [2025-03-04 15:31:13,341 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 90 transitions, 1082 flow [2025-03-04 15:31:13,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:13,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:13,341 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:13,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:31:13,341 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:13,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:13,342 INFO L85 PathProgramCache]: Analyzing trace with hash -636305191, now seen corresponding path program 3 times [2025-03-04 15:31:13,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:13,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453954236] [2025-03-04 15:31:13,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:13,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:13,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:13,347 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:13,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:31:13,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:13,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:13,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:13,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453954236] [2025-03-04 15:31:13,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453954236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:13,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:13,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:13,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418230253] [2025-03-04 15:31:13,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:13,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:13,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:13,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:13,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:13,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:13,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 90 transitions, 1082 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:13,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:13,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:13,529 INFO L124 PetriNetUnfolderBase]: 379/673 cut-off events. [2025-03-04 15:31:13,529 INFO L125 PetriNetUnfolderBase]: For 3358/3362 co-relation queries the response was YES. [2025-03-04 15:31:13,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3186 conditions, 673 events. 379/673 cut-off events. For 3358/3362 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3056 event pairs, 67 based on Foata normal form. 20/692 useless extension candidates. Maximal degree in co-relation 2895. Up to 172 conditions per place. [2025-03-04 15:31:13,533 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 62 selfloop transitions, 47 changer transitions 0/111 dead transitions. [2025-03-04 15:31:13,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 1384 flow [2025-03-04 15:31:13,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:13,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:13,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 119 transitions. [2025-03-04 15:31:13,534 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46484375 [2025-03-04 15:31:13,534 INFO L175 Difference]: Start difference. First operand has 76 places, 90 transitions, 1082 flow. Second operand 8 states and 119 transitions. [2025-03-04 15:31:13,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 1384 flow [2025-03-04 15:31:13,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 111 transitions, 1147 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-04 15:31:13,545 INFO L231 Difference]: Finished difference. Result has 72 places, 86 transitions, 913 flow [2025-03-04 15:31:13,545 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=913, PETRI_PLACES=72, PETRI_TRANSITIONS=86} [2025-03-04 15:31:13,547 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 39 predicate places. [2025-03-04 15:31:13,547 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 86 transitions, 913 flow [2025-03-04 15:31:13,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,547 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:13,547 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:13,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:31:13,547 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:13,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:13,548 INFO L85 PathProgramCache]: Analyzing trace with hash -322605960, now seen corresponding path program 3 times [2025-03-04 15:31:13,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:13,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-03-04 15:31:13,548 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:13,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:13,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:13,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:13,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:31:13,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:13,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:13,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:13,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624547478] [2025-03-04 15:31:13,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624547478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:13,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:13,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862830757] [2025-03-04 15:31:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:13,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:13,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:13,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:13,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:13,613 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:13,613 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 86 transitions, 913 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,613 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:13,613 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:13,613 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:13,754 INFO L124 PetriNetUnfolderBase]: 413/760 cut-off events. [2025-03-04 15:31:13,754 INFO L125 PetriNetUnfolderBase]: For 2434/2438 co-relation queries the response was YES. [2025-03-04 15:31:13,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3359 conditions, 760 events. 413/760 cut-off events. For 2434/2438 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 3674 event pairs, 91 based on Foata normal form. 19/778 useless extension candidates. Maximal degree in co-relation 3061. Up to 360 conditions per place. [2025-03-04 15:31:13,758 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 59 selfloop transitions, 49 changer transitions 3/113 dead transitions. [2025-03-04 15:31:13,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 1322 flow [2025-03-04 15:31:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:13,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 106 transitions. [2025-03-04 15:31:13,759 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5520833333333334 [2025-03-04 15:31:13,759 INFO L175 Difference]: Start difference. First operand has 72 places, 86 transitions, 913 flow. Second operand 6 states and 106 transitions. [2025-03-04 15:31:13,759 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 1322 flow [2025-03-04 15:31:13,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 113 transitions, 1223 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:31:13,765 INFO L231 Difference]: Finished difference. Result has 73 places, 89 transitions, 969 flow [2025-03-04 15:31:13,765 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=832, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=44, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=969, PETRI_PLACES=73, PETRI_TRANSITIONS=89} [2025-03-04 15:31:13,766 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2025-03-04 15:31:13,766 INFO L471 AbstractCegarLoop]: Abstraction has has 73 places, 89 transitions, 969 flow [2025-03-04 15:31:13,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:13,766 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:13,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:31:13,766 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:13,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:13,766 INFO L85 PathProgramCache]: Analyzing trace with hash -633325121, now seen corresponding path program 1 times [2025-03-04 15:31:13,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:13,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457259480] [2025-03-04 15:31:13,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:13,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:13,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:13,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:13,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:13,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:13,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457259480] [2025-03-04 15:31:13,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457259480] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:13,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:13,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:13,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297459240] [2025-03-04 15:31:13,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:13,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:13,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:13,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:13,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:13,826 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:13,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 89 transitions, 969 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:13,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:13,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:13,968 INFO L124 PetriNetUnfolderBase]: 415/754 cut-off events. [2025-03-04 15:31:13,968 INFO L125 PetriNetUnfolderBase]: For 2550/2558 co-relation queries the response was YES. [2025-03-04 15:31:13,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3407 conditions, 754 events. 415/754 cut-off events. For 2550/2558 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3626 event pairs, 109 based on Foata normal form. 6/759 useless extension candidates. Maximal degree in co-relation 3083. Up to 328 conditions per place. [2025-03-04 15:31:13,973 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 63 selfloop transitions, 46 changer transitions 0/111 dead transitions. [2025-03-04 15:31:13,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 111 transitions, 1320 flow [2025-03-04 15:31:13,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:13,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:13,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 98 transitions. [2025-03-04 15:31:13,974 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5104166666666666 [2025-03-04 15:31:13,974 INFO L175 Difference]: Start difference. First operand has 73 places, 89 transitions, 969 flow. Second operand 6 states and 98 transitions. [2025-03-04 15:31:13,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 111 transitions, 1320 flow [2025-03-04 15:31:13,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 111 transitions, 1233 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:13,983 INFO L231 Difference]: Finished difference. Result has 78 places, 92 transitions, 1066 flow [2025-03-04 15:31:13,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=894, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1066, PETRI_PLACES=78, PETRI_TRANSITIONS=92} [2025-03-04 15:31:13,984 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 45 predicate places. [2025-03-04 15:31:13,984 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 92 transitions, 1066 flow [2025-03-04 15:31:13,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:13,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:13,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:13,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:31:13,984 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:13,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:13,984 INFO L85 PathProgramCache]: Analyzing trace with hash -624070690, now seen corresponding path program 1 times [2025-03-04 15:31:13,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:13,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-03-04 15:31:13,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:13,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:13,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:13,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:13,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:13,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:14,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:14,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:14,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193747357] [2025-03-04 15:31:14,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193747357] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:14,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:14,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:14,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691569973] [2025-03-04 15:31:14,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:14,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:14,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:14,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:14,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 92 transitions, 1066 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:14,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:14,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:14,184 INFO L124 PetriNetUnfolderBase]: 431/795 cut-off events. [2025-03-04 15:31:14,184 INFO L125 PetriNetUnfolderBase]: For 3106/3114 co-relation queries the response was YES. [2025-03-04 15:31:14,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3516 conditions, 795 events. 431/795 cut-off events. For 3106/3114 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3903 event pairs, 76 based on Foata normal form. 16/811 useless extension candidates. Maximal degree in co-relation 3226. Up to 389 conditions per place. [2025-03-04 15:31:14,188 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 66 selfloop transitions, 51 changer transitions 2/121 dead transitions. [2025-03-04 15:31:14,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 1484 flow [2025-03-04 15:31:14,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:14,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 109 transitions. [2025-03-04 15:31:14,190 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5677083333333334 [2025-03-04 15:31:14,190 INFO L175 Difference]: Start difference. First operand has 78 places, 92 transitions, 1066 flow. Second operand 6 states and 109 transitions. [2025-03-04 15:31:14,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 1484 flow [2025-03-04 15:31:14,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 1462 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:14,200 INFO L231 Difference]: Finished difference. Result has 84 places, 93 transitions, 1195 flow [2025-03-04 15:31:14,200 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1049, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1195, PETRI_PLACES=84, PETRI_TRANSITIONS=93} [2025-03-04 15:31:14,201 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-03-04 15:31:14,201 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 93 transitions, 1195 flow [2025-03-04 15:31:14,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:14,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:14,201 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:14,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:31:14,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:14,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:14,202 INFO L85 PathProgramCache]: Analyzing trace with hash -311557230, now seen corresponding path program 2 times [2025-03-04 15:31:14,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:14,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507133351] [2025-03-04 15:31:14,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:14,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:14,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:14,209 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:14,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:14,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:14,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:14,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507133351] [2025-03-04 15:31:14,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507133351] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:14,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:14,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:14,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1950888092] [2025-03-04 15:31:14,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:14,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:14,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:14,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:31:14,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 93 transitions, 1195 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:14,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,274 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:31:14,274 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:14,433 INFO L124 PetriNetUnfolderBase]: 393/752 cut-off events. [2025-03-04 15:31:14,433 INFO L125 PetriNetUnfolderBase]: For 4453/4487 co-relation queries the response was YES. [2025-03-04 15:31:14,435 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3490 conditions, 752 events. 393/752 cut-off events. For 4453/4487 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 3848 event pairs, 54 based on Foata normal form. 30/777 useless extension candidates. Maximal degree in co-relation 3188. Up to 399 conditions per place. [2025-03-04 15:31:14,437 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 57 selfloop transitions, 57 changer transitions 3/123 dead transitions. [2025-03-04 15:31:14,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 123 transitions, 1600 flow [2025-03-04 15:31:14,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:14,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:14,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 142 transitions. [2025-03-04 15:31:14,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5546875 [2025-03-04 15:31:14,438 INFO L175 Difference]: Start difference. First operand has 84 places, 93 transitions, 1195 flow. Second operand 8 states and 142 transitions. [2025-03-04 15:31:14,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 123 transitions, 1600 flow [2025-03-04 15:31:14,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 123 transitions, 1531 flow, removed 5 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:14,449 INFO L231 Difference]: Finished difference. Result has 90 places, 94 transitions, 1288 flow [2025-03-04 15:31:14,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1128, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1288, PETRI_PLACES=90, PETRI_TRANSITIONS=94} [2025-03-04 15:31:14,449 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 57 predicate places. [2025-03-04 15:31:14,449 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 94 transitions, 1288 flow [2025-03-04 15:31:14,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:14,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:14,449 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:14,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:31:14,450 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:14,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:14,450 INFO L85 PathProgramCache]: Analyzing trace with hash -311557231, now seen corresponding path program 2 times [2025-03-04 15:31:14,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:14,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141305779] [2025-03-04 15:31:14,450 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:14,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:14,453 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:14,454 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:14,454 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:14,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:14,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141305779] [2025-03-04 15:31:14,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141305779] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:14,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:14,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:14,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63382561] [2025-03-04 15:31:14,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:14,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:14,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:14,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:14,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 94 transitions, 1288 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:14,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:14,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:14,613 INFO L124 PetriNetUnfolderBase]: 447/832 cut-off events. [2025-03-04 15:31:14,613 INFO L125 PetriNetUnfolderBase]: For 5215/5215 co-relation queries the response was YES. [2025-03-04 15:31:14,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3949 conditions, 832 events. 447/832 cut-off events. For 5215/5215 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 4143 event pairs, 111 based on Foata normal form. 12/843 useless extension candidates. Maximal degree in co-relation 3655. Up to 431 conditions per place. [2025-03-04 15:31:14,618 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 66 selfloop transitions, 42 changer transitions 2/112 dead transitions. [2025-03-04 15:31:14,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 112 transitions, 1637 flow [2025-03-04 15:31:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:14,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2025-03-04 15:31:14,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4947916666666667 [2025-03-04 15:31:14,619 INFO L175 Difference]: Start difference. First operand has 90 places, 94 transitions, 1288 flow. Second operand 6 states and 95 transitions. [2025-03-04 15:31:14,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 112 transitions, 1637 flow [2025-03-04 15:31:14,631 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 112 transitions, 1493 flow, removed 6 selfloop flow, removed 7 redundant places. [2025-03-04 15:31:14,633 INFO L231 Difference]: Finished difference. Result has 90 places, 93 transitions, 1267 flow [2025-03-04 15:31:14,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1163, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1267, PETRI_PLACES=90, PETRI_TRANSITIONS=93} [2025-03-04 15:31:14,634 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 57 predicate places. [2025-03-04 15:31:14,634 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 93 transitions, 1267 flow [2025-03-04 15:31:14,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:14,634 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:14,634 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:14,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:31:14,634 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:14,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:14,635 INFO L85 PathProgramCache]: Analyzing trace with hash -322268041, now seen corresponding path program 3 times [2025-03-04 15:31:14,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:14,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967200282] [2025-03-04 15:31:14,635 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:14,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:14,639 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:14,642 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:14,642 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:31:14,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:14,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:14,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:14,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967200282] [2025-03-04 15:31:14,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967200282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:14,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:14,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:14,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277961658] [2025-03-04 15:31:14,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:14,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:14,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:14,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:14,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 93 transitions, 1267 flow. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:14,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:14,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:14,787 INFO L124 PetriNetUnfolderBase]: 431/804 cut-off events. [2025-03-04 15:31:14,787 INFO L125 PetriNetUnfolderBase]: For 5018/5018 co-relation queries the response was YES. [2025-03-04 15:31:14,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3734 conditions, 804 events. 431/804 cut-off events. For 5018/5018 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3991 event pairs, 103 based on Foata normal form. 12/815 useless extension candidates. Maximal degree in co-relation 3525. Up to 303 conditions per place. [2025-03-04 15:31:14,791 INFO L140 encePairwiseOnDemand]: 25/32 looper letters, 64 selfloop transitions, 41 changer transitions 0/107 dead transitions. [2025-03-04 15:31:14,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 107 transitions, 1541 flow [2025-03-04 15:31:14,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:14,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:14,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 91 transitions. [2025-03-04 15:31:14,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4739583333333333 [2025-03-04 15:31:14,793 INFO L175 Difference]: Start difference. First operand has 90 places, 93 transitions, 1267 flow. Second operand 6 states and 91 transitions. [2025-03-04 15:31:14,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 107 transitions, 1541 flow [2025-03-04 15:31:14,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 107 transitions, 1294 flow, removed 4 selfloop flow, removed 10 redundant places. [2025-03-04 15:31:14,807 INFO L231 Difference]: Finished difference. Result has 84 places, 90 transitions, 1074 flow [2025-03-04 15:31:14,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1074, PETRI_PLACES=84, PETRI_TRANSITIONS=90} [2025-03-04 15:31:14,808 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 51 predicate places. [2025-03-04 15:31:14,808 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 90 transitions, 1074 flow [2025-03-04 15:31:14,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 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-04 15:31:14,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:14,809 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:14,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:31:14,809 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:14,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:14,809 INFO L85 PathProgramCache]: Analyzing trace with hash -310108155, now seen corresponding path program 1 times [2025-03-04 15:31:14,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:14,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250403048] [2025-03-04 15:31:14,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:14,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:14,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:14,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:14,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:14,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:14,846 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:14,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:14,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250403048] [2025-03-04 15:31:14,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250403048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:14,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:14,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:31:14,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604090721] [2025-03-04 15:31:14,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:14,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:14,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:14,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:14,854 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 90 transitions, 1074 flow. Second operand has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:14,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:14,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:14,927 INFO L124 PetriNetUnfolderBase]: 284/575 cut-off events. [2025-03-04 15:31:14,927 INFO L125 PetriNetUnfolderBase]: For 3018/3038 co-relation queries the response was YES. [2025-03-04 15:31:14,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2628 conditions, 575 events. 284/575 cut-off events. For 3018/3038 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 2986 event pairs, 42 based on Foata normal form. 16/585 useless extension candidates. Maximal degree in co-relation 2443. Up to 345 conditions per place. [2025-03-04 15:31:14,932 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 51 selfloop transitions, 42 changer transitions 0/101 dead transitions. [2025-03-04 15:31:14,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 101 transitions, 1315 flow [2025-03-04 15:31:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:14,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:14,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2025-03-04 15:31:14,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:31:14,934 INFO L175 Difference]: Start difference. First operand has 84 places, 90 transitions, 1074 flow. Second operand 5 states and 80 transitions. [2025-03-04 15:31:14,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 101 transitions, 1315 flow [2025-03-04 15:31:14,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 101 transitions, 1215 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 15:31:14,942 INFO L231 Difference]: Finished difference. Result has 79 places, 86 transitions, 1042 flow [2025-03-04 15:31:14,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=839, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1042, PETRI_PLACES=79, PETRI_TRANSITIONS=86} [2025-03-04 15:31:14,943 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2025-03-04 15:31:14,943 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 86 transitions, 1042 flow [2025-03-04 15:31:14,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.6) internal successors, (48), 5 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:14,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:14,943 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:14,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:31:14,943 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:14,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:14,944 INFO L85 PathProgramCache]: Analyzing trace with hash -311082000, now seen corresponding path program 3 times [2025-03-04 15:31:14,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:14,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603512431] [2025-03-04 15:31:14,944 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:14,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:14,947 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:31:14,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:31:14,950 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:31:14,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:14,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:14,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:14,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603512431] [2025-03-04 15:31:14,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603512431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:14,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:14,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:31:14,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741635466] [2025-03-04 15:31:14,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:14,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:31:14,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:14,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:31:14,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:14,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 9 out of 32 [2025-03-04 15:31:14,996 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 86 transitions, 1042 flow. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:14,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:14,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 9 of 32 [2025-03-04 15:31:14,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:15,120 INFO L124 PetriNetUnfolderBase]: 379/741 cut-off events. [2025-03-04 15:31:15,121 INFO L125 PetriNetUnfolderBase]: For 3099/3115 co-relation queries the response was YES. [2025-03-04 15:31:15,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3244 conditions, 741 events. 379/741 cut-off events. For 3099/3115 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 3944 event pairs, 48 based on Foata normal form. 8/746 useless extension candidates. Maximal degree in co-relation 2989. Up to 345 conditions per place. [2025-03-04 15:31:15,125 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 55 selfloop transitions, 53 changer transitions 1/114 dead transitions. [2025-03-04 15:31:15,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 114 transitions, 1415 flow [2025-03-04 15:31:15,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:15,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 136 transitions. [2025-03-04 15:31:15,126 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.53125 [2025-03-04 15:31:15,126 INFO L175 Difference]: Start difference. First operand has 79 places, 86 transitions, 1042 flow. Second operand 8 states and 136 transitions. [2025-03-04 15:31:15,126 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 114 transitions, 1415 flow [2025-03-04 15:31:15,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 114 transitions, 1380 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:15,134 INFO L231 Difference]: Finished difference. Result has 87 places, 88 transitions, 1144 flow [2025-03-04 15:31:15,134 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1007, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=51, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1144, PETRI_PLACES=87, PETRI_TRANSITIONS=88} [2025-03-04 15:31:15,134 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 54 predicate places. [2025-03-04 15:31:15,134 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 88 transitions, 1144 flow [2025-03-04 15:31:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,135 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:15,135 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:15,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:31:15,135 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:15,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:15,135 INFO L85 PathProgramCache]: Analyzing trace with hash -2045118613, now seen corresponding path program 1 times [2025-03-04 15:31:15,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:15,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59763786] [2025-03-04 15:31:15,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:15,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:15,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:15,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:15,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:15,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:15,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59763786] [2025-03-04 15:31:15,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59763786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:15,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935069880] [2025-03-04 15:31:15,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:15,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:15,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-04 15:31:15,170 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-04 15:31:15,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:15,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:15,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:15,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:15,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,241 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:15,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935069880] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:15,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:31:15,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-04 15:31:15,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880689273] [2025-03-04 15:31:15,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:15,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:15,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:15,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:15,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:15,275 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:15,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 88 transitions, 1144 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:15,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:15,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:15,410 INFO L124 PetriNetUnfolderBase]: 480/913 cut-off events. [2025-03-04 15:31:15,411 INFO L125 PetriNetUnfolderBase]: For 4161/4161 co-relation queries the response was YES. [2025-03-04 15:31:15,412 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4021 conditions, 913 events. 480/913 cut-off events. For 4161/4161 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4796 event pairs, 50 based on Foata normal form. 13/926 useless extension candidates. Maximal degree in co-relation 3802. Up to 346 conditions per place. [2025-03-04 15:31:15,414 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 107 selfloop transitions, 33 changer transitions 0/142 dead transitions. [2025-03-04 15:31:15,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 142 transitions, 1806 flow [2025-03-04 15:31:15,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:31:15,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:31:15,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 118 transitions. [2025-03-04 15:31:15,416 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5267857142857143 [2025-03-04 15:31:15,416 INFO L175 Difference]: Start difference. First operand has 87 places, 88 transitions, 1144 flow. Second operand 7 states and 118 transitions. [2025-03-04 15:31:15,416 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 142 transitions, 1806 flow [2025-03-04 15:31:15,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 142 transitions, 1679 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:15,424 INFO L231 Difference]: Finished difference. Result has 91 places, 105 transitions, 1298 flow [2025-03-04 15:31:15,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1045, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1298, PETRI_PLACES=91, PETRI_TRANSITIONS=105} [2025-03-04 15:31:15,425 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 58 predicate places. [2025-03-04 15:31:15,425 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 105 transitions, 1298 flow [2025-03-04 15:31:15,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:15,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:15,432 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-04 15:31:15,625 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,SelfDestructingSolverStorable22 [2025-03-04 15:31:15,626 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:15,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:15,626 INFO L85 PathProgramCache]: Analyzing trace with hash 31309578, now seen corresponding path program 1 times [2025-03-04 15:31:15,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:15,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669175164] [2025-03-04 15:31:15,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:15,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:15,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:15,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:15,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:15,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669175164] [2025-03-04 15:31:15,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669175164] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:15,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337709480] [2025-03-04 15:31:15,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:15,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:15,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:15,658 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-04 15:31:15,659 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-04 15:31:15,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:15,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:15,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:15,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:15,691 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:15,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:15,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:15,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:15,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337709480] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:15,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:31:15,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 6 [2025-03-04 15:31:15,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095494205] [2025-03-04 15:31:15,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:15,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:15,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:15,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:15,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:31:15,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:15,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 105 transitions, 1298 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:15,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:15,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:15,845 INFO L124 PetriNetUnfolderBase]: 523/996 cut-off events. [2025-03-04 15:31:15,845 INFO L125 PetriNetUnfolderBase]: For 4947/4951 co-relation queries the response was YES. [2025-03-04 15:31:15,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4591 conditions, 996 events. 523/996 cut-off events. For 4947/4951 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5222 event pairs, 60 based on Foata normal form. 16/1012 useless extension candidates. Maximal degree in co-relation 4293. Up to 392 conditions per place. [2025-03-04 15:31:15,849 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 112 selfloop transitions, 43 changer transitions 0/157 dead transitions. [2025-03-04 15:31:15,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 157 transitions, 2016 flow [2025-03-04 15:31:15,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:31:15,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:31:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-03-04 15:31:15,850 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2025-03-04 15:31:15,850 INFO L175 Difference]: Start difference. First operand has 91 places, 105 transitions, 1298 flow. Second operand 7 states and 115 transitions. [2025-03-04 15:31:15,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 157 transitions, 2016 flow [2025-03-04 15:31:15,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 157 transitions, 1973 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:15,863 INFO L231 Difference]: Finished difference. Result has 99 places, 124 transitions, 1600 flow [2025-03-04 15:31:15,863 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1269, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1600, PETRI_PLACES=99, PETRI_TRANSITIONS=124} [2025-03-04 15:31:15,863 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 66 predicate places. [2025-03-04 15:31:15,863 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 124 transitions, 1600 flow [2025-03-04 15:31:15,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:15,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:15,863 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:15,869 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-04 15:31:16,064 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,SelfDestructingSolverStorable23 [2025-03-04 15:31:16,064 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:16,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1928140258, now seen corresponding path program 2 times [2025-03-04 15:31:16,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789816398] [2025-03-04 15:31:16,064 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:16,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,067 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:16,070 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:16,070 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:16,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789816398] [2025-03-04 15:31:16,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789816398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:16,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915205750] [2025-03-04 15:31:16,129 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:16,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:16,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:16,131 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-04 15:31:16,132 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-04 15:31:16,153 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:16,161 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:16,161 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:16,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:16,162 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,187 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:31:16,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915205750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:16,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:31:16,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-03-04 15:31:16,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145625381] [2025-03-04 15:31:16,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:16,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:16,189 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:31:16,191 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:16,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 124 transitions, 1600 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:16,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:16,338 INFO L124 PetriNetUnfolderBase]: 547/1032 cut-off events. [2025-03-04 15:31:16,338 INFO L125 PetriNetUnfolderBase]: For 6233/6233 co-relation queries the response was YES. [2025-03-04 15:31:16,341 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5153 conditions, 1032 events. 547/1032 cut-off events. For 6233/6233 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 5475 event pairs, 77 based on Foata normal form. 12/1044 useless extension candidates. Maximal degree in co-relation 4885. Up to 272 conditions per place. [2025-03-04 15:31:16,344 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 145 selfloop transitions, 31 changer transitions 8/186 dead transitions. [2025-03-04 15:31:16,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 186 transitions, 2546 flow [2025-03-04 15:31:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:31:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:31:16,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 120 transitions. [2025-03-04 15:31:16,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5357142857142857 [2025-03-04 15:31:16,345 INFO L175 Difference]: Start difference. First operand has 99 places, 124 transitions, 1600 flow. Second operand 7 states and 120 transitions. [2025-03-04 15:31:16,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 186 transitions, 2546 flow [2025-03-04 15:31:16,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 186 transitions, 2503 flow, removed 16 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:16,361 INFO L231 Difference]: Finished difference. Result has 108 places, 138 transitions, 1828 flow [2025-03-04 15:31:16,361 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1559, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1828, PETRI_PLACES=108, PETRI_TRANSITIONS=138} [2025-03-04 15:31:16,362 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 75 predicate places. [2025-03-04 15:31:16,362 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 138 transitions, 1828 flow [2025-03-04 15:31:16,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:16,362 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:16,368 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-04 15:31:16,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:16,563 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:16,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,563 INFO L85 PathProgramCache]: Analyzing trace with hash -574701994, now seen corresponding path program 3 times [2025-03-04 15:31:16,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067037766] [2025-03-04 15:31:16,563 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:16,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,566 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:16,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:16,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:31:16,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067037766] [2025-03-04 15:31:16,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067037766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:16,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:16,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:31:16,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143869850] [2025-03-04 15:31:16,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:16,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:16,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:16,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:16,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 138 transitions, 1828 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:16,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:16,794 INFO L124 PetriNetUnfolderBase]: 602/1158 cut-off events. [2025-03-04 15:31:16,794 INFO L125 PetriNetUnfolderBase]: For 8103/8103 co-relation queries the response was YES. [2025-03-04 15:31:16,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6064 conditions, 1158 events. 602/1158 cut-off events. For 8103/8103 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 6467 event pairs, 148 based on Foata normal form. 12/1170 useless extension candidates. Maximal degree in co-relation 5841. Up to 431 conditions per place. [2025-03-04 15:31:16,800 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 150 selfloop transitions, 66 changer transitions 4/222 dead transitions. [2025-03-04 15:31:16,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 222 transitions, 3104 flow [2025-03-04 15:31:16,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 152 transitions. [2025-03-04 15:31:16,801 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.59375 [2025-03-04 15:31:16,801 INFO L175 Difference]: Start difference. First operand has 108 places, 138 transitions, 1828 flow. Second operand 8 states and 152 transitions. [2025-03-04 15:31:16,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 222 transitions, 3104 flow [2025-03-04 15:31:16,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 222 transitions, 3056 flow, removed 19 selfloop flow, removed 2 redundant places. [2025-03-04 15:31:16,820 INFO L231 Difference]: Finished difference. Result has 117 places, 159 transitions, 2306 flow [2025-03-04 15:31:16,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=1810, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=2306, PETRI_PLACES=117, PETRI_TRANSITIONS=159} [2025-03-04 15:31:16,821 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 84 predicate places. [2025-03-04 15:31:16,821 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 159 transitions, 2306 flow [2025-03-04 15:31:16,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:16,821 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:16,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:31:16,821 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:16,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:16,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1599698645, now seen corresponding path program 1 times [2025-03-04 15:31:16,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:16,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485248426] [2025-03-04 15:31:16,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:16,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:16,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:16,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:16,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485248426] [2025-03-04 15:31:16,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485248426] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:16,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [908786364] [2025-03-04 15:31:16,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:16,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:16,846 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-04 15:31:16,847 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-04 15:31:16,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:31:16,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:16,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:16,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:16,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:16,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:16,883 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:16,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:16,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [908786364] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:16,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:31:16,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-04 15:31:16,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661795700] [2025-03-04 15:31:16,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:16,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:16,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:16,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:16,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:31:16,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:16,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 159 transitions, 2306 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:16,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:16,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:16,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:17,081 INFO L124 PetriNetUnfolderBase]: 723/1411 cut-off events. [2025-03-04 15:31:17,081 INFO L125 PetriNetUnfolderBase]: For 10814/10818 co-relation queries the response was YES. [2025-03-04 15:31:17,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7750 conditions, 1411 events. 723/1411 cut-off events. For 10814/10818 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 8412 event pairs, 86 based on Foata normal form. 17/1428 useless extension candidates. Maximal degree in co-relation 7281. Up to 428 conditions per place. [2025-03-04 15:31:17,089 INFO L140 encePairwiseOnDemand]: 23/32 looper letters, 142 selfloop transitions, 86 changer transitions 2/232 dead transitions. [2025-03-04 15:31:17,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 232 transitions, 3582 flow [2025-03-04 15:31:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:17,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-03-04 15:31:17,090 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-04 15:31:17,090 INFO L175 Difference]: Start difference. First operand has 117 places, 159 transitions, 2306 flow. Second operand 6 states and 118 transitions. [2025-03-04 15:31:17,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 232 transitions, 3582 flow [2025-03-04 15:31:17,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 232 transitions, 3503 flow, removed 23 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:17,115 INFO L231 Difference]: Finished difference. Result has 126 places, 183 transitions, 2893 flow [2025-03-04 15:31:17,115 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2238, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2893, PETRI_PLACES=126, PETRI_TRANSITIONS=183} [2025-03-04 15:31:17,115 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 93 predicate places. [2025-03-04 15:31:17,115 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 183 transitions, 2893 flow [2025-03-04 15:31:17,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,116 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:17,116 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:17,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:17,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-03-04 15:31:17,316 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:17,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:17,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1432880647, now seen corresponding path program 2 times [2025-03-04 15:31:17,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:17,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170539157] [2025-03-04 15:31:17,317 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:17,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:17,319 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:17,321 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:17,321 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:17,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170539157] [2025-03-04 15:31:17,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170539157] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:17,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619596523] [2025-03-04 15:31:17,394 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:17,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:17,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:17,396 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-04 15:31:17,397 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-04 15:31:17,422 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:17,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:17,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:17,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:17,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,455 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:31:17,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619596523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:17,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:31:17,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-03-04 15:31:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991091923] [2025-03-04 15:31:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:17,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:17,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:17,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:17,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:31:17,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:17,458 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 183 transitions, 2893 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:17,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:17,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:17,644 INFO L124 PetriNetUnfolderBase]: 693/1340 cut-off events. [2025-03-04 15:31:17,644 INFO L125 PetriNetUnfolderBase]: For 12827/12827 co-relation queries the response was YES. [2025-03-04 15:31:17,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7922 conditions, 1340 events. 693/1340 cut-off events. For 12827/12827 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 7817 event pairs, 99 based on Foata normal form. 6/1346 useless extension candidates. Maximal degree in co-relation 7715. Up to 337 conditions per place. [2025-03-04 15:31:17,650 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 156 selfloop transitions, 62 changer transitions 7/227 dead transitions. [2025-03-04 15:31:17,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 227 transitions, 3718 flow [2025-03-04 15:31:17,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:17,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:17,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 140 transitions. [2025-03-04 15:31:17,651 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.546875 [2025-03-04 15:31:17,651 INFO L175 Difference]: Start difference. First operand has 126 places, 183 transitions, 2893 flow. Second operand 8 states and 140 transitions. [2025-03-04 15:31:17,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 227 transitions, 3718 flow [2025-03-04 15:31:17,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 227 transitions, 3663 flow, removed 9 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:17,676 INFO L231 Difference]: Finished difference. Result has 135 places, 186 transitions, 3072 flow [2025-03-04 15:31:17,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2736, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3072, PETRI_PLACES=135, PETRI_TRANSITIONS=186} [2025-03-04 15:31:17,677 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 102 predicate places. [2025-03-04 15:31:17,677 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 186 transitions, 3072 flow [2025-03-04 15:31:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:17,677 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:17,684 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:31:17,882 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,SelfDestructingSolverStorable27 [2025-03-04 15:31:17,882 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:17,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:17,882 INFO L85 PathProgramCache]: Analyzing trace with hash 2014898084, now seen corresponding path program 4 times [2025-03-04 15:31:17,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:17,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198095093] [2025-03-04 15:31:17,882 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:31:17,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:17,885 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:17,887 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:17,887 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:31:17,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:17,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:17,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198095093] [2025-03-04 15:31:17,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198095093] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:17,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:17,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:31:17,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937627445] [2025-03-04 15:31:17,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:17,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:17,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:17,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:17,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:17,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:17,920 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 186 transitions, 3072 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:17,920 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:17,920 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:17,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:18,086 INFO L124 PetriNetUnfolderBase]: 635/1219 cut-off events. [2025-03-04 15:31:18,087 INFO L125 PetriNetUnfolderBase]: For 13774/13774 co-relation queries the response was YES. [2025-03-04 15:31:18,090 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7470 conditions, 1219 events. 635/1219 cut-off events. For 13774/13774 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 6842 event pairs, 191 based on Foata normal form. 7/1226 useless extension candidates. Maximal degree in co-relation 7130. Up to 625 conditions per place. [2025-03-04 15:31:18,093 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 163 selfloop transitions, 29 changer transitions 8/202 dead transitions. [2025-03-04 15:31:18,094 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 202 transitions, 3536 flow [2025-03-04 15:31:18,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:31:18,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:31:18,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2025-03-04 15:31:18,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.55625 [2025-03-04 15:31:18,095 INFO L175 Difference]: Start difference. First operand has 135 places, 186 transitions, 3072 flow. Second operand 5 states and 89 transitions. [2025-03-04 15:31:18,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 202 transitions, 3536 flow [2025-03-04 15:31:18,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 202 transitions, 3475 flow, removed 11 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:18,122 INFO L231 Difference]: Finished difference. Result has 136 places, 178 transitions, 2930 flow [2025-03-04 15:31:18,122 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2910, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=151, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2930, PETRI_PLACES=136, PETRI_TRANSITIONS=178} [2025-03-04 15:31:18,123 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 103 predicate places. [2025-03-04 15:31:18,123 INFO L471 AbstractCegarLoop]: Abstraction has has 136 places, 178 transitions, 2930 flow [2025-03-04 15:31:18,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,123 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:18,123 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:18,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 15:31:18,124 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:18,124 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:18,124 INFO L85 PathProgramCache]: Analyzing trace with hash -500558388, now seen corresponding path program 5 times [2025-03-04 15:31:18,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:18,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285871292] [2025-03-04 15:31:18,124 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:31:18,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:18,127 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:18,130 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:18,130 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:18,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:18,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:18,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285871292] [2025-03-04 15:31:18,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285871292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:18,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176782419] [2025-03-04 15:31:18,153 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:31:18,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:18,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:18,155 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-04 15:31:18,156 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-04 15:31:18,177 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:18,185 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:18,185 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:18,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:18,186 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:18,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:18,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,195 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:18,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176782419] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:18,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:31:18,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 7 [2025-03-04 15:31:18,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039468672] [2025-03-04 15:31:18,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:18,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:18,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:18,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:18,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:31:18,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:18,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 178 transitions, 2930 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:18,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:18,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:18,398 INFO L124 PetriNetUnfolderBase]: 641/1262 cut-off events. [2025-03-04 15:31:18,398 INFO L125 PetriNetUnfolderBase]: For 14235/14235 co-relation queries the response was YES. [2025-03-04 15:31:18,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7566 conditions, 1262 events. 641/1262 cut-off events. For 14235/14235 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7211 event pairs, 81 based on Foata normal form. 12/1274 useless extension candidates. Maximal degree in co-relation 7333. Up to 348 conditions per place. [2025-03-04 15:31:18,405 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 138 selfloop transitions, 99 changer transitions 5/244 dead transitions. [2025-03-04 15:31:18,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 244 transitions, 4200 flow [2025-03-04 15:31:18,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:18,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:18,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2025-03-04 15:31:18,406 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6145833333333334 [2025-03-04 15:31:18,406 INFO L175 Difference]: Start difference. First operand has 136 places, 178 transitions, 2930 flow. Second operand 6 states and 118 transitions. [2025-03-04 15:31:18,406 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 244 transitions, 4200 flow [2025-03-04 15:31:18,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 244 transitions, 4130 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:18,435 INFO L231 Difference]: Finished difference. Result has 137 places, 201 transitions, 3571 flow [2025-03-04 15:31:18,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2750, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3571, PETRI_PLACES=137, PETRI_TRANSITIONS=201} [2025-03-04 15:31:18,436 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 104 predicate places. [2025-03-04 15:31:18,436 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 201 transitions, 3571 flow [2025-03-04 15:31:18,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:18,436 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:18,442 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-04 15:31:18,640 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:18,640 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1997905759, now seen corresponding path program 3 times [2025-03-04 15:31:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:18,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961399041] [2025-03-04 15:31:18,641 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:18,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:18,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:18,645 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:18,645 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:31:18,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:18,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961399041] [2025-03-04 15:31:18,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961399041] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:18,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690221560] [2025-03-04 15:31:18,700 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:18,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:18,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:18,701 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-04 15:31:18,703 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-04 15:31:18,727 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:18,734 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:18,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:31:18,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:18,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:18,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,762 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:18,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:18,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690221560] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:18,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-04 15:31:18,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 5] total 13 [2025-03-04 15:31:18,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260737870] [2025-03-04 15:31:18,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:18,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:18,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:18,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:18,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2025-03-04 15:31:18,806 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:18,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 201 transitions, 3571 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:18,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:18,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:18,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:18,983 INFO L124 PetriNetUnfolderBase]: 561/1113 cut-off events. [2025-03-04 15:31:18,984 INFO L125 PetriNetUnfolderBase]: For 15201/15201 co-relation queries the response was YES. [2025-03-04 15:31:18,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7146 conditions, 1113 events. 561/1113 cut-off events. For 15201/15201 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 6187 event pairs, 106 based on Foata normal form. 13/1125 useless extension candidates. Maximal degree in co-relation 6840. Up to 408 conditions per place. [2025-03-04 15:31:18,991 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 153 selfloop transitions, 75 changer transitions 1/231 dead transitions. [2025-03-04 15:31:18,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 231 transitions, 4243 flow [2025-03-04 15:31:18,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:31:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:31:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2025-03-04 15:31:18,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.609375 [2025-03-04 15:31:18,992 INFO L175 Difference]: Start difference. First operand has 137 places, 201 transitions, 3571 flow. Second operand 6 states and 117 transitions. [2025-03-04 15:31:18,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 231 transitions, 4243 flow [2025-03-04 15:31:19,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 231 transitions, 4180 flow, removed 14 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:19,026 INFO L231 Difference]: Finished difference. Result has 141 places, 197 transitions, 3724 flow [2025-03-04 15:31:19,026 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3308, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3724, PETRI_PLACES=141, PETRI_TRANSITIONS=197} [2025-03-04 15:31:19,027 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 108 predicate places. [2025-03-04 15:31:19,027 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 197 transitions, 3724 flow [2025-03-04 15:31:19,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:19,027 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:19,027 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:19,038 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:19,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:19,228 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:19,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:19,228 INFO L85 PathProgramCache]: Analyzing trace with hash -157342505, now seen corresponding path program 4 times [2025-03-04 15:31:19,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:19,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340143135] [2025-03-04 15:31:19,228 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:31:19,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:19,231 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:19,233 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:19,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:31:19,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:19,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340143135] [2025-03-04 15:31:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340143135] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:31:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957468919] [2025-03-04 15:31:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:19,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:19,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:19,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:19,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:19,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:19,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 197 transitions, 3724 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:19,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:19,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:19,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:19,403 INFO L124 PetriNetUnfolderBase]: 552/1097 cut-off events. [2025-03-04 15:31:19,403 INFO L125 PetriNetUnfolderBase]: For 17467/17467 co-relation queries the response was YES. [2025-03-04 15:31:19,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7347 conditions, 1097 events. 552/1097 cut-off events. For 17467/17467 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6104 event pairs, 91 based on Foata normal form. 10/1106 useless extension candidates. Maximal degree in co-relation 6890. Up to 375 conditions per place. [2025-03-04 15:31:19,409 INFO L140 encePairwiseOnDemand]: 26/32 looper letters, 176 selfloop transitions, 36 changer transitions 5/219 dead transitions. [2025-03-04 15:31:19,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 219 transitions, 4323 flow [2025-03-04 15:31:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:31:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:31:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 115 transitions. [2025-03-04 15:31:19,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5133928571428571 [2025-03-04 15:31:19,410 INFO L175 Difference]: Start difference. First operand has 141 places, 197 transitions, 3724 flow. Second operand 7 states and 115 transitions. [2025-03-04 15:31:19,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 219 transitions, 4323 flow [2025-03-04 15:31:19,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 219 transitions, 4268 flow, removed 8 selfloop flow, removed 1 redundant places. [2025-03-04 15:31:19,441 INFO L231 Difference]: Finished difference. Result has 147 places, 193 transitions, 3663 flow [2025-03-04 15:31:19,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3651, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3663, PETRI_PLACES=147, PETRI_TRANSITIONS=193} [2025-03-04 15:31:19,442 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 114 predicate places. [2025-03-04 15:31:19,442 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 193 transitions, 3663 flow [2025-03-04 15:31:19,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:19,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:19,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:19,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-04 15:31:19,442 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:19,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1831087761, now seen corresponding path program 5 times [2025-03-04 15:31:19,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:19,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459738833] [2025-03-04 15:31:19,443 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:31:19,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:19,445 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:19,446 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:19,446 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:19,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:19,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:19,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:19,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459738833] [2025-03-04 15:31:19,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459738833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:19,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:19,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:31:19,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173763850] [2025-03-04 15:31:19,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:19,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:19,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:19,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:19,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:31:19,468 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:19,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 193 transitions, 3663 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:19,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:19,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:19,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:19,654 INFO L124 PetriNetUnfolderBase]: 493/965 cut-off events. [2025-03-04 15:31:19,655 INFO L125 PetriNetUnfolderBase]: For 16207/16207 co-relation queries the response was YES. [2025-03-04 15:31:19,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6601 conditions, 965 events. 493/965 cut-off events. For 16207/16207 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5102 event pairs, 79 based on Foata normal form. 6/970 useless extension candidates. Maximal degree in co-relation 6281. Up to 338 conditions per place. [2025-03-04 15:31:19,661 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 140 selfloop transitions, 55 changer transitions 3/200 dead transitions. [2025-03-04 15:31:19,661 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 200 transitions, 3935 flow [2025-03-04 15:31:19,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:31:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:31:19,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 127 transitions. [2025-03-04 15:31:19,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49609375 [2025-03-04 15:31:19,662 INFO L175 Difference]: Start difference. First operand has 147 places, 193 transitions, 3663 flow. Second operand 8 states and 127 transitions. [2025-03-04 15:31:19,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 200 transitions, 3935 flow [2025-03-04 15:31:19,692 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 200 transitions, 3788 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:19,694 INFO L231 Difference]: Finished difference. Result has 149 places, 179 transitions, 3380 flow [2025-03-04 15:31:19,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3292, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=55, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3380, PETRI_PLACES=149, PETRI_TRANSITIONS=179} [2025-03-04 15:31:19,695 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 116 predicate places. [2025-03-04 15:31:19,695 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 179 transitions, 3380 flow [2025-03-04 15:31:19,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:19,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:19,695 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:19,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-04 15:31:19,695 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:19,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:19,695 INFO L85 PathProgramCache]: Analyzing trace with hash 1616690970, now seen corresponding path program 6 times [2025-03-04 15:31:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214123188] [2025-03-04 15:31:19,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:31:19,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:19,699 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:19,701 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:19,701 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 15:31:19,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214123188] [2025-03-04 15:31:19,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214123188] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:19,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [368474337] [2025-03-04 15:31:19,760 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:31:19,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:19,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:19,761 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-04 15:31:19,763 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-04 15:31:19,784 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 13 statements into 2 equivalence classes. [2025-03-04 15:31:19,791 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:31:19,792 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 15:31:19,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:19,792 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:31:19,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:19,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:19,817 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:31:19,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [368474337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:19,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:31:19,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 11 [2025-03-04 15:31:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328442107] [2025-03-04 15:31:19,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:19,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:31:19,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:19,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:31:19,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:31:19,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:19,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 179 transitions, 3380 flow. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:19,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:19,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:19,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:19,977 INFO L124 PetriNetUnfolderBase]: 442/866 cut-off events. [2025-03-04 15:31:19,977 INFO L125 PetriNetUnfolderBase]: For 15004/15004 co-relation queries the response was YES. [2025-03-04 15:31:19,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5968 conditions, 866 events. 442/866 cut-off events. For 15004/15004 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 4425 event pairs, 69 based on Foata normal form. 7/872 useless extension candidates. Maximal degree in co-relation 5887. Up to 287 conditions per place. [2025-03-04 15:31:19,982 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 125 selfloop transitions, 50 changer transitions 5/182 dead transitions. [2025-03-04 15:31:19,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 182 transitions, 3578 flow [2025-03-04 15:31:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:31:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:31:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-03-04 15:31:19,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.48660714285714285 [2025-03-04 15:31:19,983 INFO L175 Difference]: Start difference. First operand has 149 places, 179 transitions, 3380 flow. Second operand 7 states and 109 transitions. [2025-03-04 15:31:19,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 182 transitions, 3578 flow [2025-03-04 15:31:20,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 182 transitions, 3443 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-03-04 15:31:20,011 INFO L231 Difference]: Finished difference. Result has 142 places, 165 transitions, 3111 flow [2025-03-04 15:31:20,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=2944, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3111, PETRI_PLACES=142, PETRI_TRANSITIONS=165} [2025-03-04 15:31:20,011 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 109 predicate places. [2025-03-04 15:31:20,011 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 165 transitions, 3111 flow [2025-03-04 15:31:20,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:20,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:20,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:20,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:31:20,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-03-04 15:31:20,212 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:20,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:20,212 INFO L85 PathProgramCache]: Analyzing trace with hash 256305277, now seen corresponding path program 1 times [2025-03-04 15:31:20,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:20,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713452349] [2025-03-04 15:31:20,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:20,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:20,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:20,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:20,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:20,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:20,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:20,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:20,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713452349] [2025-03-04 15:31:20,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713452349] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:20,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80032925] [2025-03-04 15:31:20,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:20,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:20,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:20,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:20,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:31:20,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:20,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:20,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:20,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:20,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:31:20,321 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:20,434 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:20,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:20,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:20,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80032925] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:20,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:20,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:31:20,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140302463] [2025-03-04 15:31:20,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:20,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:31:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:20,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:31:20,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=557, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:31:20,678 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-03-04 15:31:20,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 165 transitions, 3111 flow. Second operand has 26 states, 26 states have (on average 6.5) internal successors, (169), 26 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:20,678 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:20,678 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-03-04 15:31:20,679 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:22,583 INFO L124 PetriNetUnfolderBase]: 1153/2275 cut-off events. [2025-03-04 15:31:22,583 INFO L125 PetriNetUnfolderBase]: For 37296/37316 co-relation queries the response was YES. [2025-03-04 15:31:22,589 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15701 conditions, 2275 events. 1153/2275 cut-off events. For 37296/37316 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 14916 event pairs, 54 based on Foata normal form. 68/2337 useless extension candidates. Maximal degree in co-relation 15083. Up to 440 conditions per place. [2025-03-04 15:31:22,596 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 180 selfloop transitions, 357 changer transitions 7/554 dead transitions. [2025-03-04 15:31:22,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 554 transitions, 9613 flow [2025-03-04 15:31:22,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-03-04 15:31:22,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2025-03-04 15:31:22,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 717 transitions. [2025-03-04 15:31:22,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2948190789473684 [2025-03-04 15:31:22,599 INFO L175 Difference]: Start difference. First operand has 142 places, 165 transitions, 3111 flow. Second operand 76 states and 717 transitions. [2025-03-04 15:31:22,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 554 transitions, 9613 flow [2025-03-04 15:31:22,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 554 transitions, 9384 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:31:22,677 INFO L231 Difference]: Finished difference. Result has 217 places, 412 transitions, 8561 flow [2025-03-04 15:31:22,677 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=3006, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=123, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=76, PETRI_FLOW=8561, PETRI_PLACES=217, PETRI_TRANSITIONS=412} [2025-03-04 15:31:22,678 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 184 predicate places. [2025-03-04 15:31:22,678 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 412 transitions, 8561 flow [2025-03-04 15:31:22,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.5) internal successors, (169), 26 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:22,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:22,678 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:22,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:22,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 15:31:22,881 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:22,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:22,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1715565361, now seen corresponding path program 1 times [2025-03-04 15:31:22,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:22,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610798395] [2025-03-04 15:31:22,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:22,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:22,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:22,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:22,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:22,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:22,955 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:22,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610798395] [2025-03-04 15:31:22,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610798395] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:22,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072519813] [2025-03-04 15:31:22,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:31:22,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:22,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:22,957 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:22,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:31:22,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:22,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:22,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:31:22,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:22,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:31:22,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:23,095 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:23,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072519813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:23,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:31:23,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564659695] [2025-03-04 15:31:23,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:23,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:31:23,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:23,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:31:23,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:31:23,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2025-03-04 15:31:23,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 412 transitions, 8561 flow. Second operand has 26 states, 26 states have (on average 5.615384615384615) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:23,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:23,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2025-03-04 15:31:23,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:24,665 INFO L124 PetriNetUnfolderBase]: 1328/2592 cut-off events. [2025-03-04 15:31:24,665 INFO L125 PetriNetUnfolderBase]: For 44201/44201 co-relation queries the response was YES. [2025-03-04 15:31:24,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18663 conditions, 2592 events. 1328/2592 cut-off events. For 44201/44201 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16887 event pairs, 106 based on Foata normal form. 56/2648 useless extension candidates. Maximal degree in co-relation 18062. Up to 682 conditions per place. [2025-03-04 15:31:24,681 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 208 selfloop transitions, 329 changer transitions 18/557 dead transitions. [2025-03-04 15:31:24,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 557 transitions, 10981 flow [2025-03-04 15:31:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-04 15:31:24,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2025-03-04 15:31:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 521 transitions. [2025-03-04 15:31:24,684 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29602272727272727 [2025-03-04 15:31:24,684 INFO L175 Difference]: Start difference. First operand has 217 places, 412 transitions, 8561 flow. Second operand 55 states and 521 transitions. [2025-03-04 15:31:24,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 557 transitions, 10981 flow [2025-03-04 15:31:24,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 262 places, 557 transitions, 10022 flow, removed 135 selfloop flow, removed 9 redundant places. [2025-03-04 15:31:24,804 INFO L231 Difference]: Finished difference. Result has 268 places, 423 transitions, 8638 flow [2025-03-04 15:31:24,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=7630, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=308, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=55, PETRI_FLOW=8638, PETRI_PLACES=268, PETRI_TRANSITIONS=423} [2025-03-04 15:31:24,804 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 235 predicate places. [2025-03-04 15:31:24,804 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 423 transitions, 8638 flow [2025-03-04 15:31:24,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.615384615384615) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:24,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:24,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:24,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:25,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 15:31:25,005 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:25,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:25,005 INFO L85 PathProgramCache]: Analyzing trace with hash -935700865, now seen corresponding path program 2 times [2025-03-04 15:31:25,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:25,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-03-04 15:31:25,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:25,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:25,007 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:25,009 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:25,009 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:25,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:25,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:25,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:25,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581900342] [2025-03-04 15:31:25,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581900342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:25,081 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:25,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:31:25,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284527676] [2025-03-04 15:31:25,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:25,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:31:25,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:25,082 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:31:25,082 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:31:25,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:25,137 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 423 transitions, 8638 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:25,137 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:25,137 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:25,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:25,593 INFO L124 PetriNetUnfolderBase]: 1341/2664 cut-off events. [2025-03-04 15:31:25,593 INFO L125 PetriNetUnfolderBase]: For 45276/45276 co-relation queries the response was YES. [2025-03-04 15:31:25,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19699 conditions, 2664 events. 1341/2664 cut-off events. For 45276/45276 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 17914 event pairs, 207 based on Foata normal form. 16/2665 useless extension candidates. Maximal degree in co-relation 19193. Up to 1395 conditions per place. [2025-03-04 15:31:25,609 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 187 selfloop transitions, 287 changer transitions 3/509 dead transitions. [2025-03-04 15:31:25,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 509 transitions, 11031 flow [2025-03-04 15:31:25,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:31:25,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:31:25,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 225 transitions. [2025-03-04 15:31:25,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.439453125 [2025-03-04 15:31:25,610 INFO L175 Difference]: Start difference. First operand has 268 places, 423 transitions, 8638 flow. Second operand 16 states and 225 transitions. [2025-03-04 15:31:25,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 509 transitions, 11031 flow [2025-03-04 15:31:25,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 509 transitions, 10625 flow, removed 17 selfloop flow, removed 30 redundant places. [2025-03-04 15:31:25,771 INFO L231 Difference]: Finished difference. Result has 258 places, 475 transitions, 10146 flow [2025-03-04 15:31:25,771 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=8273, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=236, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=10146, PETRI_PLACES=258, PETRI_TRANSITIONS=475} [2025-03-04 15:31:25,771 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 225 predicate places. [2025-03-04 15:31:25,771 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 475 transitions, 10146 flow [2025-03-04 15:31:25,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:25,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:25,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:25,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-04 15:31:25,771 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:25,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:25,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1790871857, now seen corresponding path program 3 times [2025-03-04 15:31:25,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:25,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069315239] [2025-03-04 15:31:25,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:25,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:25,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:25,775 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:25,775 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 15:31:25,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:25,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:25,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069315239] [2025-03-04 15:31:25,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069315239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:25,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:25,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:31:25,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193700913] [2025-03-04 15:31:25,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:25,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:31:25,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:25,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:31:25,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:31:25,911 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:25,911 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 475 transitions, 10146 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:25,911 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:25,911 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:25,911 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:26,421 INFO L124 PetriNetUnfolderBase]: 1410/2802 cut-off events. [2025-03-04 15:31:26,421 INFO L125 PetriNetUnfolderBase]: For 51699/51699 co-relation queries the response was YES. [2025-03-04 15:31:26,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21489 conditions, 2802 events. 1410/2802 cut-off events. For 51699/51699 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 19011 event pairs, 222 based on Foata normal form. 16/2803 useless extension candidates. Maximal degree in co-relation 20973. Up to 1449 conditions per place. [2025-03-04 15:31:26,439 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 196 selfloop transitions, 304 changer transitions 3/535 dead transitions. [2025-03-04 15:31:26,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 535 transitions, 12127 flow [2025-03-04 15:31:26,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-04 15:31:26,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-03-04 15:31:26,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 197 transitions. [2025-03-04 15:31:26,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.43973214285714285 [2025-03-04 15:31:26,440 INFO L175 Difference]: Start difference. First operand has 258 places, 475 transitions, 10146 flow. Second operand 14 states and 197 transitions. [2025-03-04 15:31:26,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 535 transitions, 12127 flow [2025-03-04 15:31:26,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 535 transitions, 11950 flow, removed 14 selfloop flow, removed 3 redundant places. [2025-03-04 15:31:26,631 INFO L231 Difference]: Finished difference. Result has 272 places, 503 transitions, 11468 flow [2025-03-04 15:31:26,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=9981, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=475, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=276, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=11468, PETRI_PLACES=272, PETRI_TRANSITIONS=503} [2025-03-04 15:31:26,632 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 239 predicate places. [2025-03-04 15:31:26,632 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 503 transitions, 11468 flow [2025-03-04 15:31:26,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:26,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:26,632 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:26,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 15:31:26,632 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:26,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:26,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1379888849, now seen corresponding path program 4 times [2025-03-04 15:31:26,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:26,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-03-04 15:31:26,632 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:31:26,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:26,634 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:26,636 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:26,636 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:31:26,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:26,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:26,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:26,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438087861] [2025-03-04 15:31:26,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438087861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:26,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451999072] [2025-03-04 15:31:26,729 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:31:26,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:26,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:26,731 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:26,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:31:26,755 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:26,762 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:26,762 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:31:26,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:26,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:31:26,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:26,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:26,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:26,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:26,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451999072] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:26,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:26,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:31:26,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509586622] [2025-03-04 15:31:26,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:26,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:31:26,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:26,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:31:26,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:31:27,049 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2025-03-04 15:31:27,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 503 transitions, 11468 flow. Second operand has 26 states, 26 states have (on average 5.615384615384615) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:27,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:27,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2025-03-04 15:31:27,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:28,929 INFO L124 PetriNetUnfolderBase]: 3531/6695 cut-off events. [2025-03-04 15:31:28,929 INFO L125 PetriNetUnfolderBase]: For 131632/131632 co-relation queries the response was YES. [2025-03-04 15:31:28,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52642 conditions, 6695 events. 3531/6695 cut-off events. For 131632/131632 co-relation queries the response was YES. Maximal size of possible extension queue 415. Compared 50684 event pairs, 243 based on Foata normal form. 48/6743 useless extension candidates. Maximal degree in co-relation 52179. Up to 1327 conditions per place. [2025-03-04 15:31:28,975 INFO L140 encePairwiseOnDemand]: 19/32 looper letters, 394 selfloop transitions, 907 changer transitions 13/1316 dead transitions. [2025-03-04 15:31:28,975 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 1316 transitions, 30790 flow [2025-03-04 15:31:28,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-03-04 15:31:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2025-03-04 15:31:28,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 525 transitions. [2025-03-04 15:31:28,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29296875 [2025-03-04 15:31:28,977 INFO L175 Difference]: Start difference. First operand has 272 places, 503 transitions, 11468 flow. Second operand 56 states and 525 transitions. [2025-03-04 15:31:28,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 1316 transitions, 30790 flow [2025-03-04 15:31:29,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 1316 transitions, 30431 flow, removed 17 selfloop flow, removed 6 redundant places. [2025-03-04 15:31:29,782 INFO L231 Difference]: Finished difference. Result has 343 places, 1098 transitions, 27971 flow [2025-03-04 15:31:29,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=11245, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=375, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=56, PETRI_FLOW=27971, PETRI_PLACES=343, PETRI_TRANSITIONS=1098} [2025-03-04 15:31:29,783 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 310 predicate places. [2025-03-04 15:31:29,783 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 1098 transitions, 27971 flow [2025-03-04 15:31:29,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.615384615384615) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:29,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:29,783 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:29,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:29,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2025-03-04 15:31:29,984 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:29,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:29,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1790872187, now seen corresponding path program 2 times [2025-03-04 15:31:29,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:29,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897766364] [2025-03-04 15:31:29,984 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:31:29,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:29,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:31:29,988 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:29,988 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:31:29,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:30,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:30,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897766364] [2025-03-04 15:31:30,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897766364] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:30,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:31:30,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:31:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393328281] [2025-03-04 15:31:30,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:30,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:31:30,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:30,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:31:30,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:31:30,131 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 32 [2025-03-04 15:31:30,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 1098 transitions, 27971 flow. Second operand has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:30,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:30,132 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 32 [2025-03-04 15:31:30,132 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:31,862 INFO L124 PetriNetUnfolderBase]: 3288/6453 cut-off events. [2025-03-04 15:31:31,862 INFO L125 PetriNetUnfolderBase]: For 170637/170685 co-relation queries the response was YES. [2025-03-04 15:31:31,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55943 conditions, 6453 events. 3288/6453 cut-off events. For 170637/170685 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 50546 event pairs, 580 based on Foata normal form. 26/6469 useless extension candidates. Maximal degree in co-relation 55501. Up to 3386 conditions per place. [2025-03-04 15:31:31,914 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 534 selfloop transitions, 551 changer transitions 4/1124 dead transitions. [2025-03-04 15:31:31,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 1124 transitions, 30420 flow [2025-03-04 15:31:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:31:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:31:31,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 185 transitions. [2025-03-04 15:31:31,915 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44471153846153844 [2025-03-04 15:31:31,915 INFO L175 Difference]: Start difference. First operand has 343 places, 1098 transitions, 27971 flow. Second operand 13 states and 185 transitions. [2025-03-04 15:31:31,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 1124 transitions, 30420 flow [2025-03-04 15:31:33,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 1124 transitions, 29739 flow, removed 277 selfloop flow, removed 4 redundant places. [2025-03-04 15:31:33,182 INFO L231 Difference]: Finished difference. Result has 354 places, 1103 transitions, 28971 flow [2025-03-04 15:31:33,183 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27290, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1098, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=543, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=28971, PETRI_PLACES=354, PETRI_TRANSITIONS=1103} [2025-03-04 15:31:33,183 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 321 predicate places. [2025-03-04 15:31:33,184 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 1103 transitions, 28971 flow [2025-03-04 15:31:33,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.3) internal successors, (93), 10 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:33,184 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:33,184 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:33,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-03-04 15:31:33,184 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:33,184 INFO L85 PathProgramCache]: Analyzing trace with hash 918406709, now seen corresponding path program 3 times [2025-03-04 15:31:33,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:33,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962009944] [2025-03-04 15:31:33,184 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:33,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:33,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:33,189 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:33,189 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:31:33,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:33,256 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:33,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962009944] [2025-03-04 15:31:33,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962009944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:33,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1252283608] [2025-03-04 15:31:33,256 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 15:31:33,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:33,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:33,258 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:33,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:31:33,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:33,288 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:33,288 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-04 15:31:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:33,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:31:33,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:33,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:33,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:33,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1252283608] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:33,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:33,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:31:33,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12191414] [2025-03-04 15:31:33,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:33,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:31:33,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:33,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:31:33,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=564, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:31:33,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-03-04 15:31:33,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 1103 transitions, 28971 flow. Second operand has 26 states, 26 states have (on average 6.5) internal successors, (169), 26 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:33,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:33,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-03-04 15:31:33,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:36,438 INFO L124 PetriNetUnfolderBase]: 4737/9444 cut-off events. [2025-03-04 15:31:36,438 INFO L125 PetriNetUnfolderBase]: For 258101/258202 co-relation queries the response was YES. [2025-03-04 15:31:36,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82527 conditions, 9444 events. 4737/9444 cut-off events. For 258101/258202 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 78523 event pairs, 421 based on Foata normal form. 171/9609 useless extension candidates. Maximal degree in co-relation 81958. Up to 2154 conditions per place. [2025-03-04 15:31:36,551 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 404 selfloop transitions, 1226 changer transitions 16/1681 dead transitions. [2025-03-04 15:31:36,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1681 transitions, 46046 flow [2025-03-04 15:31:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2025-03-04 15:31:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2025-03-04 15:31:36,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 363 transitions. [2025-03-04 15:31:36,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3336397058823529 [2025-03-04 15:31:36,553 INFO L175 Difference]: Start difference. First operand has 354 places, 1103 transitions, 28971 flow. Second operand 34 states and 363 transitions. [2025-03-04 15:31:36,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1681 transitions, 46046 flow [2025-03-04 15:31:39,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 378 places, 1681 transitions, 44710 flow, removed 16 selfloop flow, removed 9 redundant places. [2025-03-04 15:31:39,739 INFO L231 Difference]: Finished difference. Result has 390 places, 1553 transitions, 43618 flow [2025-03-04 15:31:39,740 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=27989, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=796, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=43618, PETRI_PLACES=390, PETRI_TRANSITIONS=1553} [2025-03-04 15:31:39,741 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 357 predicate places. [2025-03-04 15:31:39,741 INFO L471 AbstractCegarLoop]: Abstraction has has 390 places, 1553 transitions, 43618 flow [2025-03-04 15:31:39,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 6.5) internal successors, (169), 26 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:39,741 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:39,741 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:39,747 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-04 15:31:39,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:39,946 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:39,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:39,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1574735221, now seen corresponding path program 4 times [2025-03-04 15:31:39,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:39,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352348505] [2025-03-04 15:31:39,946 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:31:39,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:39,948 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:39,950 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:39,950 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:31:39,950 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:40,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352348505] [2025-03-04 15:31:40,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352348505] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:40,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1095107180] [2025-03-04 15:31:40,028 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 15:31:40,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:40,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:40,030 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:40,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:31:40,056 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:40,064 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:40,065 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-04 15:31:40,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:40,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:31:40,066 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:40,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:40,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:31:40,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:40,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1095107180] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:31:40,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:31:40,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:31:40,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357566246] [2025-03-04 15:31:40,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:31:40,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:31:40,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:40,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:31:40,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:31:40,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 32 [2025-03-04 15:31:40,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 1553 transitions, 43618 flow. Second operand has 26 states, 26 states have (on average 5.615384615384615) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:40,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:40,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 32 [2025-03-04 15:31:40,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:31:46,613 INFO L124 PetriNetUnfolderBase]: 8771/17089 cut-off events. [2025-03-04 15:31:46,613 INFO L125 PetriNetUnfolderBase]: For 468433/468437 co-relation queries the response was YES. [2025-03-04 15:31:46,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149475 conditions, 17089 events. 8771/17089 cut-off events. For 468433/468437 co-relation queries the response was YES. Maximal size of possible extension queue 826. Compared 151189 event pairs, 671 based on Foata normal form. 184/17273 useless extension candidates. Maximal degree in co-relation 148976. Up to 3349 conditions per place. [2025-03-04 15:31:46,969 INFO L140 encePairwiseOnDemand]: 20/32 looper letters, 701 selfloop transitions, 2004 changer transitions 48/2755 dead transitions. [2025-03-04 15:31:46,969 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 459 places, 2755 transitions, 79419 flow [2025-03-04 15:31:46,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-03-04 15:31:46,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-03-04 15:31:46,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 654 transitions. [2025-03-04 15:31:46,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.29196428571428573 [2025-03-04 15:31:46,971 INFO L175 Difference]: Start difference. First operand has 390 places, 1553 transitions, 43618 flow. Second operand 70 states and 654 transitions. [2025-03-04 15:31:46,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 459 places, 2755 transitions, 79419 flow [2025-03-04 15:31:55,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 2755 transitions, 77834 flow, removed 113 selfloop flow, removed 8 redundant places. [2025-03-04 15:31:55,585 INFO L231 Difference]: Finished difference. Result has 473 places, 2432 transitions, 73318 flow [2025-03-04 15:31:55,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=42523, PETRI_DIFFERENCE_MINUEND_PLACES=382, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1553, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1224, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=73318, PETRI_PLACES=473, PETRI_TRANSITIONS=2432} [2025-03-04 15:31:55,587 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 440 predicate places. [2025-03-04 15:31:55,587 INFO L471 AbstractCegarLoop]: Abstraction has has 473 places, 2432 transitions, 73318 flow [2025-03-04 15:31:55,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.615384615384615) internal successors, (146), 26 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:55,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:31:55,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:31:55,593 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-03-04 15:31:55,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2025-03-04 15:31:55,788 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:31:55,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:31:55,788 INFO L85 PathProgramCache]: Analyzing trace with hash -804247677, now seen corresponding path program 5 times [2025-03-04 15:31:55,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:31:55,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226669371] [2025-03-04 15:31:55,788 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:31:55,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:31:55,791 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:55,793 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:55,793 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:55,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:31:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226669371] [2025-03-04 15:31:55,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226669371] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:31:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927020686] [2025-03-04 15:31:55,864 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:31:55,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:31:55,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:31:55,867 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:31:55,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:31:55,890 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:31:55,897 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:31:55,897 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:31:55,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:31:55,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-04 15:31:55,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:31:55,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:31:55,963 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:31:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927020686] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:31:55,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:31:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 14 [2025-03-04 15:31:55,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449846860] [2025-03-04 15:31:55,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:31:55,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:31:55,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:31:55,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:31:55,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-03-04 15:31:55,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 32 [2025-03-04 15:31:55,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 473 places, 2432 transitions, 73318 flow. Second operand has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:31:55,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:31:55,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 32 [2025-03-04 15:31:55,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:02,086 INFO L124 PetriNetUnfolderBase]: 7413/15622 cut-off events. [2025-03-04 15:32:02,086 INFO L125 PetriNetUnfolderBase]: For 576732/576780 co-relation queries the response was YES. [2025-03-04 15:32:02,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 155208 conditions, 15622 events. 7413/15622 cut-off events. For 576732/576780 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 148369 event pairs, 892 based on Foata normal form. 186/15672 useless extension candidates. Maximal degree in co-relation 154607. Up to 5031 conditions per place. [2025-03-04 15:32:02,556 INFO L140 encePairwiseOnDemand]: 24/32 looper letters, 423 selfloop transitions, 2059 changer transitions 42/2609 dead transitions. [2025-03-04 15:32:02,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 2609 transitions, 83444 flow [2025-03-04 15:32:02,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:32:02,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:32:02,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 135 transitions. [2025-03-04 15:32:02,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3835227272727273 [2025-03-04 15:32:02,558 INFO L175 Difference]: Start difference. First operand has 473 places, 2432 transitions, 73318 flow. Second operand 11 states and 135 transitions. [2025-03-04 15:32:02,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 2609 transitions, 83444 flow [2025-03-04 15:32:12,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 469 places, 2609 transitions, 82267 flow, removed 288 selfloop flow, removed 13 redundant places. [2025-03-04 15:32:12,593 INFO L231 Difference]: Finished difference. Result has 470 places, 2525 transitions, 79801 flow [2025-03-04 15:32:12,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=72167, PETRI_DIFFERENCE_MINUEND_PLACES=459, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2429, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1927, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=79801, PETRI_PLACES=470, PETRI_TRANSITIONS=2525} [2025-03-04 15:32:12,595 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 437 predicate places. [2025-03-04 15:32:12,595 INFO L471 AbstractCegarLoop]: Abstraction has has 470 places, 2525 transitions, 79801 flow [2025-03-04 15:32:12,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.5) internal successors, (60), 8 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:12,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:12,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:12,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-04 15:32:12,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:12,798 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:32:12,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:12,798 INFO L85 PathProgramCache]: Analyzing trace with hash -22200585, now seen corresponding path program 6 times [2025-03-04 15:32:12,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:12,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940536261] [2025-03-04 15:32:12,798 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:32:12,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:12,800 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:12,801 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:12,801 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-03-04 15:32:12,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940536261] [2025-03-04 15:32:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940536261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:12,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:12,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:32:12,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807394889] [2025-03-04 15:32:12,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:32:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:12,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:32:12,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:32:12,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 15:32:12,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 470 places, 2525 transitions, 79801 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:12,930 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:12,930 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 15:32:12,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:20,590 INFO L124 PetriNetUnfolderBase]: 7957/16242 cut-off events. [2025-03-04 15:32:20,590 INFO L125 PetriNetUnfolderBase]: For 578828/578828 co-relation queries the response was YES. [2025-03-04 15:32:20,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158877 conditions, 16242 events. 7957/16242 cut-off events. For 578828/578828 co-relation queries the response was YES. Maximal size of possible extension queue 818. Compared 149478 event pairs, 1195 based on Foata normal form. 4/16216 useless extension candidates. Maximal degree in co-relation 158361. Up to 9041 conditions per place. [2025-03-04 15:32:20,764 INFO L140 encePairwiseOnDemand]: 22/32 looper letters, 1304 selfloop transitions, 1220 changer transitions 3/2560 dead transitions. [2025-03-04 15:32:20,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 2560 transitions, 85297 flow [2025-03-04 15:32:20,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-04 15:32:20,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-03-04 15:32:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 217 transitions. [2025-03-04 15:32:20,765 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39889705882352944 [2025-03-04 15:32:20,765 INFO L175 Difference]: Start difference. First operand has 470 places, 2525 transitions, 79801 flow. Second operand 17 states and 217 transitions. [2025-03-04 15:32:20,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 2560 transitions, 85297 flow [2025-03-04 15:32:30,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 479 places, 2560 transitions, 83811 flow, removed 45 selfloop flow, removed 7 redundant places. [2025-03-04 15:32:30,437 INFO L231 Difference]: Finished difference. Result has 482 places, 2529 transitions, 80975 flow [2025-03-04 15:32:30,439 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=78324, PETRI_DIFFERENCE_MINUEND_PLACES=463, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1213, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=80975, PETRI_PLACES=482, PETRI_TRANSITIONS=2529} [2025-03-04 15:32:30,439 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 449 predicate places. [2025-03-04 15:32:30,440 INFO L471 AbstractCegarLoop]: Abstraction has has 482 places, 2529 transitions, 80975 flow [2025-03-04 15:32:30,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:30,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:30,440 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:30,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-03-04 15:32:30,440 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:32:30,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:30,440 INFO L85 PathProgramCache]: Analyzing trace with hash 599626223, now seen corresponding path program 5 times [2025-03-04 15:32:30,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:30,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-03-04 15:32:30,441 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 15:32:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:30,443 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:32:30,444 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:30,444 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:32:30,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:30,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:30,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:30,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356672035] [2025-03-04 15:32:30,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356672035] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:32:30,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:32:30,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:32:30,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666117323] [2025-03-04 15:32:30,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:32:30,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:32:30,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:30,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:32:30,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:32:30,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 32 [2025-03-04 15:32:30,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 482 places, 2529 transitions, 80975 flow. Second operand has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:30,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:30,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 32 [2025-03-04 15:32:30,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:32:37,264 INFO L124 PetriNetUnfolderBase]: 8177/16591 cut-off events. [2025-03-04 15:32:37,265 INFO L125 PetriNetUnfolderBase]: For 604245/604299 co-relation queries the response was YES. [2025-03-04 15:32:37,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161548 conditions, 16591 events. 8177/16591 cut-off events. For 604245/604299 co-relation queries the response was YES. Maximal size of possible extension queue 820. Compared 152005 event pairs, 1304 based on Foata normal form. 7/16582 useless extension candidates. Maximal degree in co-relation 160951. Up to 9518 conditions per place. [2025-03-04 15:32:37,437 INFO L140 encePairwiseOnDemand]: 21/32 looper letters, 1133 selfloop transitions, 1399 changer transitions 0/2583 dead transitions. [2025-03-04 15:32:37,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 500 places, 2583 transitions, 86852 flow [2025-03-04 15:32:37,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-04 15:32:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-04 15:32:37,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 237 transitions. [2025-03-04 15:32:37,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.38980263157894735 [2025-03-04 15:32:37,438 INFO L175 Difference]: Start difference. First operand has 482 places, 2529 transitions, 80975 flow. Second operand 19 states and 237 transitions. [2025-03-04 15:32:37,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 500 places, 2583 transitions, 86852 flow [2025-03-04 15:32:47,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 492 places, 2583 transitions, 84676 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-03-04 15:32:47,096 INFO L231 Difference]: Finished difference. Result has 495 places, 2550 transitions, 82236 flow [2025-03-04 15:32:47,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=32, PETRI_DIFFERENCE_MINUEND_FLOW=78822, PETRI_DIFFERENCE_MINUEND_PLACES=474, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=2529, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1381, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=82236, PETRI_PLACES=495, PETRI_TRANSITIONS=2550} [2025-03-04 15:32:47,098 INFO L279 CegarLoopForPetriNet]: 33 programPoint places, 462 predicate places. [2025-03-04 15:32:47,098 INFO L471 AbstractCegarLoop]: Abstraction has has 495 places, 2550 transitions, 82236 flow [2025-03-04 15:32:47,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.3) internal successors, (83), 10 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:47,099 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:32:47,099 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:32:47,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-03-04 15:32:47,099 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 15 more)] === [2025-03-04 15:32:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:32:47,099 INFO L85 PathProgramCache]: Analyzing trace with hash 377981183, now seen corresponding path program 6 times [2025-03-04 15:32:47,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:32:47,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-04 15:32:47,099 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:32:47,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:32:47,102 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:32:47,103 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:47,104 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 15:32:47,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:47,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:32:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459864890] [2025-03-04 15:32:47,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459864890] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:32:47,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370203438] [2025-03-04 15:32:47,157 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-04 15:32:47,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:32:47,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:32:47,159 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:32:47,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:32:47,181 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:32:47,188 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:32:47,188 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-04 15:32:47,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:32:47,189 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:32:47,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:32:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:47,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:32:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:32:47,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370203438] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:32:47,384 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:32:47,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2025-03-04 15:32:47,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730985960] [2025-03-04 15:32:47,385 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:32:47,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-04 15:32:47,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:32:47,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-04 15:32:47,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2025-03-04 15:32:47,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 5 out of 32 [2025-03-04 15:32:47,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 495 places, 2550 transitions, 82236 flow. Second operand has 26 states, 26 states have (on average 6.5) internal successors, (169), 26 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:32:47,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:32:47,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 5 of 32 [2025-03-04 15:32:47,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand