./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-match-trans.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/chl-match-trans.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 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:25:02,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:25:02,647 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:25:02,651 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:25:02,651 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:25:02,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:25:02,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:25:02,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:25:02,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:25:02,673 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:25:02,673 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:25:02,673 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:25:02,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:25:02,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:25:02,674 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:25:02,674 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:25:02,674 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:25:02,675 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:25:02,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:25:02,675 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:25:02,675 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:25:02,675 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:25:02,676 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:02,676 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:25:02,676 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:25:02,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:25:02,677 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 -> 58a3707e98508adde0e15b9d8e43fa1e77573e5478a67cbc9ef6d2cbcb9307e7 [2025-03-04 15:25:02,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:25:02,899 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:25:02,902 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:25:02,903 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:25:02,903 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:25:02,904 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-03-04 15:25:04,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad8b8464/80c2602da58842c7b2494e7c765bc4cc/FLAG635d0c726 [2025-03-04 15:25:04,217 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:25:04,218 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-trans.wvr.c [2025-03-04 15:25:04,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad8b8464/80c2602da58842c7b2494e7c765bc4cc/FLAG635d0c726 [2025-03-04 15:25:04,585 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ad8b8464/80c2602da58842c7b2494e7c765bc4cc [2025-03-04 15:25:04,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:25:04,588 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:25:04,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:04,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:25:04,593 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:25:04,594 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,595 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1574222b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04, skipping insertion in model container [2025-03-04 15:25:04,595 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:25:04,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:04,760 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:25:04,782 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:04,797 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:25:04,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04 WrapperNode [2025-03-04 15:25:04,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:04,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:04,799 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:25:04,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:25:04,804 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:25:04" (1/1) ... [2025-03-04 15:25:04,809 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:25:04" (1/1) ... [2025-03-04 15:25:04,832 INFO L138 Inliner]: procedures = 22, calls = 19, calls flagged for inlining = 12, calls inlined = 22, statements flattened = 281 [2025-03-04 15:25:04,835 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:04,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:25:04,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:25:04,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:25:04,842 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,842 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,849 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,864 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:25:04,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,869 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:25:04,873 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:25:04,873 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:25:04,873 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:25:04,874 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (1/1) ... [2025-03-04 15:25:04,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:04,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:04,906 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:25:04,908 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:25:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:25:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:25:04,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:25:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:25:04,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:25:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:25:04,925 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:25:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:25:04,925 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:25:04,925 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:25:04,927 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:25:05,005 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:25:05,007 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:25:05,352 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:25:05,352 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:25:05,537 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:25:05,538 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:25:05,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:05 BoogieIcfgContainer [2025-03-04 15:25:05,538 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:25:05,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:25:05,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:25:05,543 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:25:05,543 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:25:04" (1/3) ... [2025-03-04 15:25:05,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608b0423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:05, skipping insertion in model container [2025-03-04 15:25:05,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:04" (2/3) ... [2025-03-04 15:25:05,544 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@608b0423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:05, skipping insertion in model container [2025-03-04 15:25:05,544 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:05" (3/3) ... [2025-03-04 15:25:05,545 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-trans.wvr.c [2025-03-04 15:25:05,573 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:25:05,574 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-trans.wvr.c that has 4 procedures, 114 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-03-04 15:25:05,574 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:25:05,648 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:25:05,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 271 flow [2025-03-04 15:25:05,728 INFO L124 PetriNetUnfolderBase]: 12/122 cut-off events. [2025-03-04 15:25:05,731 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:25:05,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135 conditions, 122 events. 12/122 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 496 event pairs, 0 based on Foata normal form. 0/74 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2025-03-04 15:25:05,736 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 125 transitions, 271 flow [2025-03-04 15:25:05,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 120 transitions, 255 flow [2025-03-04 15:25:05,745 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:25:05,752 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;@27b54b75, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:25:05,752 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-03-04 15:25:05,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:25:05,759 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-04 15:25:05,760 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:25:05,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:05,761 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:25:05,761 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:05,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:05,765 INFO L85 PathProgramCache]: Analyzing trace with hash 797160527, now seen corresponding path program 1 times [2025-03-04 15:25:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:05,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093223871] [2025-03-04 15:25:05,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:05,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:25:05,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:25:05,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:05,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:05,964 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:25:05,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:05,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093223871] [2025-03-04 15:25:05,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093223871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:05,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:05,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:05,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383796861] [2025-03-04 15:25:05,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:05,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:05,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:05,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:05,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:06,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:25:06,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 120 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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:25:06,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:06,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:25:06,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:09,043 INFO L124 PetriNetUnfolderBase]: 22977/40643 cut-off events. [2025-03-04 15:25:09,043 INFO L125 PetriNetUnfolderBase]: For 616/616 co-relation queries the response was YES. [2025-03-04 15:25:09,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71770 conditions, 40643 events. 22977/40643 cut-off events. For 616/616 co-relation queries the response was YES. Maximal size of possible extension queue 1565. Compared 372558 event pairs, 5595 based on Foata normal form. 1256/36511 useless extension candidates. Maximal degree in co-relation 70631. Up to 15182 conditions per place. [2025-03-04 15:25:09,352 INFO L140 encePairwiseOnDemand]: 110/125 looper letters, 104 selfloop transitions, 10 changer transitions 0/180 dead transitions. [2025-03-04 15:25:09,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 615 flow [2025-03-04 15:25:09,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:09,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2025-03-04 15:25:09,366 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.792 [2025-03-04 15:25:09,367 INFO L175 Difference]: Start difference. First operand has 118 places, 120 transitions, 255 flow. Second operand 4 states and 396 transitions. [2025-03-04 15:25:09,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 615 flow [2025-03-04 15:25:09,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 180 transitions, 600 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:09,384 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 312 flow [2025-03-04 15:25:09,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=312, PETRI_PLACES=117, PETRI_TRANSITIONS=124} [2025-03-04 15:25:09,389 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-03-04 15:25:09,390 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 312 flow [2025-03-04 15:25:09,390 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.25) internal successors, (281), 4 states have internal predecessors, (281), 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:25:09,390 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:09,390 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:09,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:25:09,391 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:09,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:09,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1057826639, now seen corresponding path program 1 times [2025-03-04 15:25:09,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:09,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524850729] [2025-03-04 15:25:09,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:09,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:09,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:09,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:09,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:09,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:09,474 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:25:09,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:09,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524850729] [2025-03-04 15:25:09,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524850729] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:09,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:09,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:09,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954111123] [2025-03-04 15:25:09,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:09,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:09,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:09,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:09,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:09,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 125 [2025-03-04 15:25:09,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 124 transitions, 312 flow. Second operand has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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:25:09,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:09,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 125 [2025-03-04 15:25:09,509 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:11,246 INFO L124 PetriNetUnfolderBase]: 16111/32538 cut-off events. [2025-03-04 15:25:11,247 INFO L125 PetriNetUnfolderBase]: For 6521/6961 co-relation queries the response was YES. [2025-03-04 15:25:11,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59557 conditions, 32538 events. 16111/32538 cut-off events. For 6521/6961 co-relation queries the response was YES. Maximal size of possible extension queue 1341. Compared 328393 event pairs, 7188 based on Foata normal form. 440/28340 useless extension candidates. Maximal degree in co-relation 40757. Up to 11144 conditions per place. [2025-03-04 15:25:11,447 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 71 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2025-03-04 15:25:11,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 152 transitions, 529 flow [2025-03-04 15:25:11,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:11,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:11,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2025-03-04 15:25:11,450 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 15:25:11,451 INFO L175 Difference]: Start difference. First operand has 117 places, 124 transitions, 312 flow. Second operand 4 states and 375 transitions. [2025-03-04 15:25:11,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 152 transitions, 529 flow [2025-03-04 15:25:11,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 152 transitions, 529 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:11,469 INFO L231 Difference]: Finished difference. Result has 120 places, 124 transitions, 336 flow [2025-03-04 15:25:11,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=336, PETRI_PLACES=120, PETRI_TRANSITIONS=124} [2025-03-04 15:25:11,470 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2025-03-04 15:25:11,470 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 124 transitions, 336 flow [2025-03-04 15:25:11,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.0) internal successors, (304), 4 states have internal predecessors, (304), 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:25:11,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:11,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:11,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:25:11,471 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:11,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:11,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1567082611, now seen corresponding path program 1 times [2025-03-04 15:25:11,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:11,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-03-04 15:25:11,474 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:11,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:11,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:11,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:11,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:11,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:11,535 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:25:11,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:11,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738879007] [2025-03-04 15:25:11,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738879007] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:11,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:11,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:11,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482643965] [2025-03-04 15:25:11,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:11,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:11,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:11,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:11,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:11,581 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-04 15:25:11,582 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 124 transitions, 336 flow. Second operand has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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:25:11,582 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:11,582 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-04 15:25:11,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:13,510 INFO L124 PetriNetUnfolderBase]: 17315/34084 cut-off events. [2025-03-04 15:25:13,510 INFO L125 PetriNetUnfolderBase]: For 14939/15379 co-relation queries the response was YES. [2025-03-04 15:25:13,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66107 conditions, 34084 events. 17315/34084 cut-off events. For 14939/15379 co-relation queries the response was YES. Maximal size of possible extension queue 1393. Compared 338920 event pairs, 8085 based on Foata normal form. 678/29841 useless extension candidates. Maximal degree in co-relation 45918. Up to 12312 conditions per place. [2025-03-04 15:25:13,694 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 73 selfloop transitions, 7 changer transitions 0/150 dead transitions. [2025-03-04 15:25:13,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 150 transitions, 549 flow [2025-03-04 15:25:13,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:13,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2025-03-04 15:25:13,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.732 [2025-03-04 15:25:13,697 INFO L175 Difference]: Start difference. First operand has 120 places, 124 transitions, 336 flow. Second operand 4 states and 366 transitions. [2025-03-04 15:25:13,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 150 transitions, 549 flow [2025-03-04 15:25:13,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 150 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:13,727 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 338 flow [2025-03-04 15:25:13,728 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=338, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2025-03-04 15:25:13,728 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2025-03-04 15:25:13,728 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 338 flow [2025-03-04 15:25:13,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.25) internal successors, (297), 4 states have internal predecessors, (297), 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:25:13,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:13,728 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:13,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:25:13,729 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:13,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:13,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1548318186, now seen corresponding path program 1 times [2025-03-04 15:25:13,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:13,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-04 15:25:13,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:13,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:13,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:13,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:13,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:13,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:13,790 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:25:13,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:13,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724961754] [2025-03-04 15:25:13,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724961754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:13,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:13,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:13,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683958304] [2025-03-04 15:25:13,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:13,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:13,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:13,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:13,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:13,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:25:13,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 338 flow. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:25:13,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:13,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:25:13,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:16,977 INFO L124 PetriNetUnfolderBase]: 32473/59201 cut-off events. [2025-03-04 15:25:16,977 INFO L125 PetriNetUnfolderBase]: For 31281/33056 co-relation queries the response was YES. [2025-03-04 15:25:17,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120002 conditions, 59201 events. 32473/59201 cut-off events. For 31281/33056 co-relation queries the response was YES. Maximal size of possible extension queue 2268. Compared 593992 event pairs, 7411 based on Foata normal form. 3000/53681 useless extension candidates. Maximal degree in co-relation 62631. Up to 21672 conditions per place. [2025-03-04 15:25:17,368 INFO L140 encePairwiseOnDemand]: 110/125 looper letters, 117 selfloop transitions, 10 changer transitions 0/191 dead transitions. [2025-03-04 15:25:17,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 191 transitions, 842 flow [2025-03-04 15:25:17,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:17,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:17,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2025-03-04 15:25:17,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788 [2025-03-04 15:25:17,370 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 338 flow. Second operand 4 states and 394 transitions. [2025-03-04 15:25:17,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 191 transitions, 842 flow [2025-03-04 15:25:17,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 191 transitions, 816 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:17,499 INFO L231 Difference]: Finished difference. Result has 121 places, 127 transitions, 390 flow [2025-03-04 15:25:17,500 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=390, PETRI_PLACES=121, PETRI_TRANSITIONS=127} [2025-03-04 15:25:17,500 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 3 predicate places. [2025-03-04 15:25:17,500 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 127 transitions, 390 flow [2025-03-04 15:25:17,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 4 states have internal predecessors, (283), 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:25:17,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:17,500 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:17,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:17,501 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:17,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:17,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1334920499, now seen corresponding path program 1 times [2025-03-04 15:25:17,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:17,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005595857] [2025-03-04 15:25:17,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:17,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:17,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:17,576 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:25:17,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:17,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005595857] [2025-03-04 15:25:17,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005595857] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:17,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:17,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:17,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568305986] [2025-03-04 15:25:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:17,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:17,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:17,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:17,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:17,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 125 [2025-03-04 15:25:17,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 390 flow. Second operand has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:25:17,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:17,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 125 [2025-03-04 15:25:17,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:21,570 INFO L124 PetriNetUnfolderBase]: 37479/68636 cut-off events. [2025-03-04 15:25:21,570 INFO L125 PetriNetUnfolderBase]: For 31736/34575 co-relation queries the response was YES. [2025-03-04 15:25:21,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145808 conditions, 68636 events. 37479/68636 cut-off events. For 31736/34575 co-relation queries the response was YES. Maximal size of possible extension queue 2575. Compared 698163 event pairs, 13778 based on Foata normal form. 1379/62676 useless extension candidates. Maximal degree in co-relation 99923. Up to 26921 conditions per place. [2025-03-04 15:25:22,059 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 112 selfloop transitions, 12 changer transitions 0/190 dead transitions. [2025-03-04 15:25:22,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 190 transitions, 838 flow [2025-03-04 15:25:22,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:22,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2025-03-04 15:25:22,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7456 [2025-03-04 15:25:22,061 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 390 flow. Second operand 5 states and 466 transitions. [2025-03-04 15:25:22,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 190 transitions, 838 flow [2025-03-04 15:25:22,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 190 transitions, 838 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:22,218 INFO L231 Difference]: Finished difference. Result has 126 places, 127 transitions, 436 flow [2025-03-04 15:25:22,218 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=388, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=436, PETRI_PLACES=126, PETRI_TRANSITIONS=127} [2025-03-04 15:25:22,219 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 8 predicate places. [2025-03-04 15:25:22,219 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 127 transitions, 436 flow [2025-03-04 15:25:22,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.4) internal successors, (362), 5 states have internal predecessors, (362), 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:25:22,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:22,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:22,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:22,219 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:22,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:22,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1334921492, now seen corresponding path program 1 times [2025-03-04 15:25:22,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:22,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135659908] [2025-03-04 15:25:22,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:22,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:22,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:22,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:22,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:22,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:22,267 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:25:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:22,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135659908] [2025-03-04 15:25:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135659908] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:22,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:22,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:22,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605671552] [2025-03-04 15:25:22,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:22,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:22,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:22,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:22,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:25:22,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 127 transitions, 436 flow. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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:25:22,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:22,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:25:22,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:25,662 INFO L124 PetriNetUnfolderBase]: 28726/53425 cut-off events. [2025-03-04 15:25:25,663 INFO L125 PetriNetUnfolderBase]: For 46192/48500 co-relation queries the response was YES. [2025-03-04 15:25:25,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124786 conditions, 53425 events. 28726/53425 cut-off events. For 46192/48500 co-relation queries the response was YES. Maximal size of possible extension queue 1989. Compared 539220 event pairs, 8210 based on Foata normal form. 1966/50689 useless extension candidates. Maximal degree in co-relation 51107. Up to 14980 conditions per place. [2025-03-04 15:25:26,042 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 114 selfloop transitions, 9 changer transitions 0/189 dead transitions. [2025-03-04 15:25:26,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 189 transitions, 872 flow [2025-03-04 15:25:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2025-03-04 15:25:26,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776 [2025-03-04 15:25:26,044 INFO L175 Difference]: Start difference. First operand has 126 places, 127 transitions, 436 flow. Second operand 4 states and 388 transitions. [2025-03-04 15:25:26,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 189 transitions, 872 flow [2025-03-04 15:25:26,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 189 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:26,693 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 432 flow [2025-03-04 15:25:26,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=432, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2025-03-04 15:25:26,694 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2025-03-04 15:25:26,694 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 432 flow [2025-03-04 15:25:26,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 4 states have internal predecessors, (282), 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:25:26,694 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:26,694 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:26,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:26,694 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:26,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash 753224347, now seen corresponding path program 1 times [2025-03-04 15:25:26,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:26,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-04 15:25:26,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:26,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:26,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:26,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:26,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:26,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:26,739 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:25:26,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:26,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969092408] [2025-03-04 15:25:26,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969092408] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:26,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:26,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:26,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438685752] [2025-03-04 15:25:26,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:26,740 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:26,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:26,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:26,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:26,759 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 125 [2025-03-04 15:25:26,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 432 flow. Second operand has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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:25:26,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:26,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 125 [2025-03-04 15:25:26,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:29,650 INFO L124 PetriNetUnfolderBase]: 24316/48277 cut-off events. [2025-03-04 15:25:29,650 INFO L125 PetriNetUnfolderBase]: For 54300/56349 co-relation queries the response was YES. [2025-03-04 15:25:29,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111491 conditions, 48277 events. 24316/48277 cut-off events. For 54300/56349 co-relation queries the response was YES. Maximal size of possible extension queue 1908. Compared 508243 event pairs, 7788 based on Foata normal form. 1308/43923 useless extension candidates. Maximal degree in co-relation 41022. Up to 18028 conditions per place. [2025-03-04 15:25:29,888 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 80 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2025-03-04 15:25:29,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 157 transitions, 759 flow [2025-03-04 15:25:29,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:29,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:29,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2025-03-04 15:25:29,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748 [2025-03-04 15:25:29,890 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 432 flow. Second operand 4 states and 374 transitions. [2025-03-04 15:25:29,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 157 transitions, 759 flow [2025-03-04 15:25:30,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 157 transitions, 747 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:30,083 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 449 flow [2025-03-04 15:25:30,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=423, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2025-03-04 15:25:30,085 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 11 predicate places. [2025-03-04 15:25:30,085 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 449 flow [2025-03-04 15:25:30,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 76.5) internal successors, (306), 4 states have internal predecessors, (306), 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:25:30,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:30,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:30,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:25:30,085 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:30,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:30,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1567136682, now seen corresponding path program 1 times [2025-03-04 15:25:30,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:30,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387415500] [2025-03-04 15:25:30,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:30,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:30,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:30,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:30,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:30,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:30,161 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:25:30,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:30,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387415500] [2025-03-04 15:25:30,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387415500] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:30,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:25:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507979789] [2025-03-04 15:25:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:30,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:30,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:30,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:30,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:30,218 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 125 [2025-03-04 15:25:30,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 125 transitions, 449 flow. Second operand has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 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:25:30,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:30,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 125 [2025-03-04 15:25:30,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:34,812 INFO L124 PetriNetUnfolderBase]: 43001/69321 cut-off events. [2025-03-04 15:25:34,812 INFO L125 PetriNetUnfolderBase]: For 76998/80527 co-relation queries the response was YES. [2025-03-04 15:25:34,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173574 conditions, 69321 events. 43001/69321 cut-off events. For 76998/80527 co-relation queries the response was YES. Maximal size of possible extension queue 2477. Compared 617341 event pairs, 12285 based on Foata normal form. 3525/67591 useless extension candidates. Maximal degree in co-relation 65838. Up to 22820 conditions per place. [2025-03-04 15:25:35,227 INFO L140 encePairwiseOnDemand]: 112/125 looper letters, 212 selfloop transitions, 13 changer transitions 0/287 dead transitions. [2025-03-04 15:25:35,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 287 transitions, 1505 flow [2025-03-04 15:25:35,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:25:35,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:25:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 713 transitions. [2025-03-04 15:25:35,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.713 [2025-03-04 15:25:35,230 INFO L175 Difference]: Start difference. First operand has 129 places, 125 transitions, 449 flow. Second operand 8 states and 713 transitions. [2025-03-04 15:25:35,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 287 transitions, 1505 flow [2025-03-04 15:25:35,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 287 transitions, 1472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:35,563 INFO L231 Difference]: Finished difference. Result has 137 places, 127 transitions, 498 flow [2025-03-04 15:25:35,563 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=498, PETRI_PLACES=137, PETRI_TRANSITIONS=127} [2025-03-04 15:25:35,564 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 19 predicate places. [2025-03-04 15:25:35,564 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 127 transitions, 498 flow [2025-03-04 15:25:35,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 66.16666666666667) internal successors, (397), 6 states have internal predecessors, (397), 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:25:35,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:35,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:35,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:35,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:35,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:35,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1730486757, now seen corresponding path program 1 times [2025-03-04 15:25:35,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:35,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-04 15:25:35,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:35,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:35,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:35,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:35,571 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:35,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:35,599 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:25:35,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:35,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216378467] [2025-03-04 15:25:35,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216378467] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:35,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:35,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:35,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636526696] [2025-03-04 15:25:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:35,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:35,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:35,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:35,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:25:35,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 127 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 71.25) internal successors, (285), 4 states have internal predecessors, (285), 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:25:35,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:35,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:25:35,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand