./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-match-subst.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-subst.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 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:24:47,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:24:47,964 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:24:47,970 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:24:47,970 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:24:47,991 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:24:47,992 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:24:47,992 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:24:47,993 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:24:47,993 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:24:47,993 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:24:47,994 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:24:47,994 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:24:47,994 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:24:47,994 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:24:47,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:24:47,995 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:24:47,996 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:24:47,996 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:47,997 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:24:47,997 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:24:47,997 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 -> 2c931aeff3bd4feb775048ea000220a43a3b08d8a3667f51cb57a0babc9201aa [2025-03-04 15:24:48,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:24:48,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:24:48,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:24:48,231 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:24:48,231 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:24:48,232 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-04 15:24:49,327 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4243df4/f9bf2603720b4c1685fea36234b7844a/FLAG07f61cb78 [2025-03-04 15:24:49,564 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:24:49,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-subst.wvr.c [2025-03-04 15:24:49,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4243df4/f9bf2603720b4c1685fea36234b7844a/FLAG07f61cb78 [2025-03-04 15:24:49,586 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e4243df4/f9bf2603720b4c1685fea36234b7844a [2025-03-04 15:24:49,588 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:24:49,590 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:24:49,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:49,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:24:49,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:24:49,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20977ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49, skipping insertion in model container [2025-03-04 15:24:49,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,611 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:24:49,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:49,750 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:24:49,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:49,787 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:24:49,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49 WrapperNode [2025-03-04 15:24:49,788 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:49,789 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:49,790 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:24:49,790 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:24:49,794 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:24:49" (1/1) ... [2025-03-04 15:24:49,799 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:24:49" (1/1) ... [2025-03-04 15:24:49,826 INFO L138 Inliner]: procedures = 22, calls = 20, calls flagged for inlining = 13, calls inlined = 23, statements flattened = 285 [2025-03-04 15:24:49,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:49,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:24:49,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:24:49,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:24:49,838 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,838 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,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:24:49,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:24:49" (1/1) ... [2025-03-04 15:24:49,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,875 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,877 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:24:49,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:24:49,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:24:49,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:24:49,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (1/1) ... [2025-03-04 15:24:49,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:49,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:49,914 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:24:49,917 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:24:49,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:24:49,934 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:24:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:24:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:24:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:24:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:24:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:24:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:24:49,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:24:49,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:24:49,936 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:24:49,999 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:24:50,000 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:24:50,364 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:24:50,364 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:24:50,548 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:24:50,548 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:24:50,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:50 BoogieIcfgContainer [2025-03-04 15:24:50,549 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:24:50,550 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:24:50,550 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:24:50,553 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:24:50,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:24:49" (1/3) ... [2025-03-04 15:24:50,553 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea27f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:50, skipping insertion in model container [2025-03-04 15:24:50,553 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:49" (2/3) ... [2025-03-04 15:24:50,554 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ea27f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:50, skipping insertion in model container [2025-03-04 15:24:50,554 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:50" (3/3) ... [2025-03-04 15:24:50,554 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-match-subst.wvr.c [2025-03-04 15:24:50,568 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:24:50,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-match-subst.wvr.c that has 4 procedures, 114 locations, 1 initial locations, 0 loop locations, and 36 error locations. [2025-03-04 15:24:50,570 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:24:50,641 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:24:50,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 123 places, 125 transitions, 271 flow [2025-03-04 15:24:50,725 INFO L124 PetriNetUnfolderBase]: 12/122 cut-off events. [2025-03-04 15:24:50,728 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:24:50,734 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 9. Compared 481 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:24:50,734 INFO L82 GeneralOperation]: Start removeDead. Operand has 123 places, 125 transitions, 271 flow [2025-03-04 15:24:50,739 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 120 transitions, 255 flow [2025-03-04 15:24:50,746 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:24:50,754 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;@306ce377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:24:50,754 INFO L334 AbstractCegarLoop]: Starting to check reachability of 75 error locations. [2025-03-04 15:24:50,759 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:24:50,759 INFO L124 PetriNetUnfolderBase]: 1/10 cut-off events. [2025-03-04 15:24:50,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:24:50,760 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:50,760 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:24:50,760 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:24:50,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:50,766 INFO L85 PathProgramCache]: Analyzing trace with hash 820681514, now seen corresponding path program 1 times [2025-03-04 15:24:50,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:50,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772364221] [2025-03-04 15:24:50,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:50,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:50,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:24:50,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:24:50,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:50,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:50,950 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:24:50,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:50,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772364221] [2025-03-04 15:24:50,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772364221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:50,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:50,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:50,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718770330] [2025-03-04 15:24:50,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:50,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:50,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:50,977 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:50,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:51,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:24:51,035 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:24:51,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:51,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:24:51,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:53,662 INFO L124 PetriNetUnfolderBase]: 23188/40499 cut-off events. [2025-03-04 15:24:53,662 INFO L125 PetriNetUnfolderBase]: For 614/614 co-relation queries the response was YES. [2025-03-04 15:24:53,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71921 conditions, 40499 events. 23188/40499 cut-off events. For 614/614 co-relation queries the response was YES. Maximal size of possible extension queue 1561. Compared 366073 event pairs, 5618 based on Foata normal form. 1256/36348 useless extension candidates. Maximal degree in co-relation 70776. Up to 15193 conditions per place. [2025-03-04 15:24:53,917 INFO L140 encePairwiseOnDemand]: 110/125 looper letters, 104 selfloop transitions, 10 changer transitions 0/180 dead transitions. [2025-03-04 15:24:53,918 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 615 flow [2025-03-04 15:24:53,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:53,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2025-03-04 15:24:53,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.792 [2025-03-04 15:24:53,928 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:24:53,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 615 flow [2025-03-04 15:24:53,937 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:24:53,940 INFO L231 Difference]: Finished difference. Result has 117 places, 124 transitions, 312 flow [2025-03-04 15:24:53,942 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:24:53,944 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, -1 predicate places. [2025-03-04 15:24:53,944 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 124 transitions, 312 flow [2025-03-04 15:24:53,945 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:24:53,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:53,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:24:53,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:24:53,945 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:24:53,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:53,946 INFO L85 PathProgramCache]: Analyzing trace with hash -328676026, now seen corresponding path program 1 times [2025-03-04 15:24:53,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:53,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360169544] [2025-03-04 15:24:53,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:53,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:53,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:24:53,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:24:53,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:53,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:54,032 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:24:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360169544] [2025-03-04 15:24:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360169544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173397975] [2025-03-04 15:24:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:54,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:54,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:54,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:54,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:54,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 125 [2025-03-04 15:24:54,067 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:24:54,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:54,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 125 [2025-03-04 15:24:54,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:55,894 INFO L124 PetriNetUnfolderBase]: 16307/32378 cut-off events. [2025-03-04 15:24:55,895 INFO L125 PetriNetUnfolderBase]: For 6702/7146 co-relation queries the response was YES. [2025-03-04 15:24:55,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59803 conditions, 32378 events. 16307/32378 cut-off events. For 6702/7146 co-relation queries the response was YES. Maximal size of possible extension queue 1335. Compared 322377 event pairs, 7153 based on Foata normal form. 444/28160 useless extension candidates. Maximal degree in co-relation 41611. Up to 11217 conditions per place. [2025-03-04 15:24:56,126 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 71 selfloop transitions, 7 changer transitions 0/152 dead transitions. [2025-03-04 15:24:56,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 152 transitions, 529 flow [2025-03-04 15:24:56,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:56,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:56,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 375 transitions. [2025-03-04 15:24:56,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-04 15:24:56,129 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:24:56,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 152 transitions, 529 flow [2025-03-04 15:24:56,141 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:24:56,143 INFO L231 Difference]: Finished difference. Result has 120 places, 124 transitions, 336 flow [2025-03-04 15:24:56,143 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:24:56,143 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2025-03-04 15:24:56,144 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 124 transitions, 336 flow [2025-03-04 15:24:56,144 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:24:56,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:56,144 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:56,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:24:56,144 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:24:56,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:56,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1599052146, now seen corresponding path program 1 times [2025-03-04 15:24:56,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:56,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611618816] [2025-03-04 15:24:56,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:56,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:56,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:24:56,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:24:56,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:56,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:56,223 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:24:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:56,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611618816] [2025-03-04 15:24:56,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611618816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:56,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:56,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:24:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335702113] [2025-03-04 15:24:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:56,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:56,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:56,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-04 15:24:56,260 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:24:56,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:56,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-04 15:24:56,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:57,835 INFO L124 PetriNetUnfolderBase]: 17524/33929 cut-off events. [2025-03-04 15:24:57,836 INFO L125 PetriNetUnfolderBase]: For 15516/15960 co-relation queries the response was YES. [2025-03-04 15:24:57,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66439 conditions, 33929 events. 17524/33929 cut-off events. For 15516/15960 co-relation queries the response was YES. Maximal size of possible extension queue 1391. Compared 332478 event pairs, 8020 based on Foata normal form. 682/29661 useless extension candidates. Maximal degree in co-relation 47037. Up to 12530 conditions per place. [2025-03-04 15:24:58,004 INFO L140 encePairwiseOnDemand]: 119/125 looper letters, 73 selfloop transitions, 7 changer transitions 0/150 dead transitions. [2025-03-04 15:24:58,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 150 transitions, 549 flow [2025-03-04 15:24:58,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:24:58,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:24:58,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 366 transitions. [2025-03-04 15:24:58,006 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.732 [2025-03-04 15:24:58,006 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:24:58,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 150 transitions, 549 flow [2025-03-04 15:24:58,033 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:24:58,035 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 338 flow [2025-03-04 15:24:58,035 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:24:58,035 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 2 predicate places. [2025-03-04 15:24:58,035 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 338 flow [2025-03-04 15:24:58,036 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:24:58,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:58,036 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:24:58,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:24:58,036 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:24:58,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:58,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1611411506, now seen corresponding path program 1 times [2025-03-04 15:24:58,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:58,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580077956] [2025-03-04 15:24:58,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:58,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:24:58,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:24:58,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:58,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:58,087 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:24:58,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:58,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580077956] [2025-03-04 15:24:58,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580077956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:58,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:58,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:24:58,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896800919] [2025-03-04 15:24:58,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:58,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:24:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:58,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:24:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:24:58,126 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:24:58,126 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:24:58,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:58,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:24:58,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:01,481 INFO L124 PetriNetUnfolderBase]: 34186/59083 cut-off events. [2025-03-04 15:25:01,482 INFO L125 PetriNetUnfolderBase]: For 33490/35381 co-relation queries the response was YES. [2025-03-04 15:25:01,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 123595 conditions, 59083 events. 34186/59083 cut-off events. For 33490/35381 co-relation queries the response was YES. Maximal size of possible extension queue 2211. Compared 562589 event pairs, 8618 based on Foata normal form. 3078/53393 useless extension candidates. Maximal degree in co-relation 63337. Up to 21800 conditions per place. [2025-03-04 15:25:01,767 INFO L140 encePairwiseOnDemand]: 110/125 looper letters, 117 selfloop transitions, 10 changer transitions 0/191 dead transitions. [2025-03-04 15:25:01,767 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 191 transitions, 842 flow [2025-03-04 15:25:01,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:01,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:01,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2025-03-04 15:25:01,768 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.788 [2025-03-04 15:25:01,768 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:01,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 191 transitions, 842 flow [2025-03-04 15:25:01,948 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:01,950 INFO L231 Difference]: Finished difference. Result has 121 places, 127 transitions, 390 flow [2025-03-04 15:25:01,950 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:01,951 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 3 predicate places. [2025-03-04 15:25:01,951 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 127 transitions, 390 flow [2025-03-04 15:25:01,951 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:01,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:01,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:01,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:01,951 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:01,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:01,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1585851719, now seen corresponding path program 1 times [2025-03-04 15:25:01,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:01,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828650340] [2025-03-04 15:25:01,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:01,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:01,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:01,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:01,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:01,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:02,011 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:02,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:02,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828650340] [2025-03-04 15:25:02,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828650340] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:02,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:02,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:02,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321401490] [2025-03-04 15:25:02,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:02,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:02,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:02,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:02,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:02,046 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 125 [2025-03-04 15:25:02,047 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 127 transitions, 390 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:02,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:02,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 125 [2025-03-04 15:25:02,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:04,942 INFO L124 PetriNetUnfolderBase]: 25423/49600 cut-off events. [2025-03-04 15:25:04,942 INFO L125 PetriNetUnfolderBase]: For 30169/31990 co-relation queries the response was YES. [2025-03-04 15:25:05,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106684 conditions, 49600 events. 25423/49600 cut-off events. For 30169/31990 co-relation queries the response was YES. Maximal size of possible extension queue 1916. Compared 518826 event pairs, 8319 based on Foata normal form. 1354/44496 useless extension candidates. Maximal degree in co-relation 39404. Up to 18004 conditions per place. [2025-03-04 15:25:05,232 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 80 selfloop transitions, 7 changer transitions 0/159 dead transitions. [2025-03-04 15:25:05,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 159 transitions, 681 flow [2025-03-04 15:25:05,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:05,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:05,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 374 transitions. [2025-03-04 15:25:05,233 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.748 [2025-03-04 15:25:05,233 INFO L175 Difference]: Start difference. First operand has 121 places, 127 transitions, 390 flow. Second operand 4 states and 374 transitions. [2025-03-04 15:25:05,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 159 transitions, 681 flow [2025-03-04 15:25:05,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 159 transitions, 681 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:05,481 INFO L231 Difference]: Finished difference. Result has 124 places, 127 transitions, 414 flow [2025-03-04 15:25:05,481 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=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=414, PETRI_PLACES=124, PETRI_TRANSITIONS=127} [2025-03-04 15:25:05,482 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 6 predicate places. [2025-03-04 15:25:05,482 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 127 transitions, 414 flow [2025-03-04 15:25:05,482 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:05,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:05,482 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:05,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:05,482 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:05,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1968990856, now seen corresponding path program 1 times [2025-03-04 15:25:05,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:05,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023161155] [2025-03-04 15:25:05,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:05,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:05,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:05,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:05,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:05,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:05,569 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,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023161155] [2025-03-04 15:25:05,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023161155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:05,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:05,570 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:05,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687063151] [2025-03-04 15:25:05,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:05,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:05,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:05,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:05,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:05,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 125 [2025-03-04 15:25:05,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 127 transitions, 414 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:05,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:05,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 125 [2025-03-04 15:25:05,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:09,955 INFO L124 PetriNetUnfolderBase]: 42565/68369 cut-off events. [2025-03-04 15:25:09,955 INFO L125 PetriNetUnfolderBase]: For 50395/53700 co-relation queries the response was YES. [2025-03-04 15:25:10,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164330 conditions, 68369 events. 42565/68369 cut-off events. For 50395/53700 co-relation queries the response was YES. Maximal size of possible extension queue 2381. Compared 604916 event pairs, 10085 based on Foata normal form. 1652/65564 useless extension candidates. Maximal degree in co-relation 65903. Up to 29582 conditions per place. [2025-03-04 15:25:10,380 INFO L140 encePairwiseOnDemand]: 114/125 looper letters, 115 selfloop transitions, 12 changer transitions 0/192 dead transitions. [2025-03-04 15:25:10,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 192 transitions, 910 flow [2025-03-04 15:25:10,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:10,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:10,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 466 transitions. [2025-03-04 15:25:10,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7456 [2025-03-04 15:25:10,382 INFO L175 Difference]: Start difference. First operand has 124 places, 127 transitions, 414 flow. Second operand 5 states and 466 transitions. [2025-03-04 15:25:10,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 192 transitions, 910 flow [2025-03-04 15:25:11,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 192 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:11,046 INFO L231 Difference]: Finished difference. Result has 127 places, 127 transitions, 452 flow [2025-03-04 15:25:11,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=121, 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=452, PETRI_PLACES=127, PETRI_TRANSITIONS=127} [2025-03-04 15:25:11,047 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 9 predicate places. [2025-03-04 15:25:11,047 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 127 transitions, 452 flow [2025-03-04 15:25:11,047 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:11,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:11,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:11,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:11,047 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:11,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:11,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1968991849, now seen corresponding path program 1 times [2025-03-04 15:25:11,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:11,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360225484] [2025-03-04 15:25:11,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:11,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:11,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:25:11,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:25:11,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:11,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:11,086 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,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:11,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360225484] [2025-03-04 15:25:11,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360225484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:11,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:11,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:11,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384530725] [2025-03-04 15:25:11,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:11,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:11,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:11,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:11,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:11,124 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 125 [2025-03-04 15:25:11,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 127 transitions, 452 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:11,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:11,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 125 [2025-03-04 15:25:11,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:15,186 INFO L124 PetriNetUnfolderBase]: 31749/57366 cut-off events. [2025-03-04 15:25:15,187 INFO L125 PetriNetUnfolderBase]: For 60944/63382 co-relation queries the response was YES. [2025-03-04 15:25:15,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140407 conditions, 57366 events. 31749/57366 cut-off events. For 60944/63382 co-relation queries the response was YES. Maximal size of possible extension queue 2127. Compared 568254 event pairs, 9773 based on Foata normal form. 2098/54653 useless extension candidates. Maximal degree in co-relation 53994. Up to 17573 conditions per place. [2025-03-04 15:25:15,517 INFO L140 encePairwiseOnDemand]: 116/125 looper letters, 117 selfloop transitions, 9 changer transitions 0/191 dead transitions. [2025-03-04 15:25:15,518 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 191 transitions, 926 flow [2025-03-04 15:25:15,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:15,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:15,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2025-03-04 15:25:15,519 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.776 [2025-03-04 15:25:15,519 INFO L175 Difference]: Start difference. First operand has 127 places, 127 transitions, 452 flow. Second operand 4 states and 388 transitions. [2025-03-04 15:25:15,519 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 191 transitions, 926 flow [2025-03-04 15:25:16,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 191 transitions, 916 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:16,002 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 448 flow [2025-03-04 15:25:16,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=125, 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=448, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2025-03-04 15:25:16,003 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2025-03-04 15:25:16,003 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 448 flow [2025-03-04 15:25:16,003 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:16,004 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:16,004 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:16,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:25:16,004 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:16,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:16,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1775944777, now seen corresponding path program 1 times [2025-03-04 15:25:16,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:16,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828566782] [2025-03-04 15:25:16,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:16,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:16,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:16,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:16,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:16,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:16,049 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:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:16,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828566782] [2025-03-04 15:25:16,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828566782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:16,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:16,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:16,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715880012] [2025-03-04 15:25:16,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:16,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:16,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:16,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:16,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:16,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-04 15:25:16,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 448 flow. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:16,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:16,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-04 15:25:16,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:19,652 INFO L124 PetriNetUnfolderBase]: 29165/54686 cut-off events. [2025-03-04 15:25:19,653 INFO L125 PetriNetUnfolderBase]: For 77556/81535 co-relation queries the response was YES. [2025-03-04 15:25:19,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 134371 conditions, 54686 events. 29165/54686 cut-off events. For 77556/81535 co-relation queries the response was YES. Maximal size of possible extension queue 2059. Compared 561068 event pairs, 12210 based on Foata normal form. 3360/49502 useless extension candidates. Maximal degree in co-relation 51033. Up to 21779 conditions per place. [2025-03-04 15:25:19,981 INFO L140 encePairwiseOnDemand]: 118/125 looper letters, 88 selfloop transitions, 5 changer transitions 0/158 dead transitions. [2025-03-04 15:25:19,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 158 transitions, 834 flow [2025-03-04 15:25:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 367 transitions. [2025-03-04 15:25:19,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.734 [2025-03-04 15:25:19,983 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 448 flow. Second operand 4 states and 367 transitions. [2025-03-04 15:25:19,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 158 transitions, 834 flow [2025-03-04 15:25:20,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 158 transitions, 822 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:20,170 INFO L231 Difference]: Finished difference. Result has 128 places, 123 transitions, 447 flow [2025-03-04 15:25:20,170 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=125, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=447, PETRI_PLACES=128, PETRI_TRANSITIONS=123} [2025-03-04 15:25:20,171 INFO L279 CegarLoopForPetriNet]: 118 programPoint places, 10 predicate places. [2025-03-04 15:25:20,171 INFO L471 AbstractCegarLoop]: Abstraction has has 128 places, 123 transitions, 447 flow [2025-03-04 15:25:20,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 4 states have internal predecessors, (300), 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:20,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:20,171 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:20,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:20,171 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (and 72 more)] === [2025-03-04 15:25:20,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:20,172 INFO L85 PathProgramCache]: Analyzing trace with hash 1916733138, now seen corresponding path program 1 times [2025-03-04 15:25:20,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:20,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213864310] [2025-03-04 15:25:20,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:20,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:20,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:25:20,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:25:20,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:20,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:20,214 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:20,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:20,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213864310] [2025-03-04 15:25:20,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213864310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:20,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:20,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:20,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581746270] [2025-03-04 15:25:20,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:20,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:20,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:20,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:20,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:20,235 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 125 [2025-03-04 15:25:20,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 123 transitions, 447 flow. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 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:20,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:20,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 125 [2025-03-04 15:25:20,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand