./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-collitem-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-collitem-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 e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:24:02,327 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:24:02,381 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:02,385 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:24:02,385 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:24:02,406 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:24:02,407 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:24:02,407 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:24:02,408 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:24:02,408 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:24:02,408 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:24:02,409 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:24:02,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:24:02,409 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:24:02,409 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:24:02,410 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:24:02,410 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:02,410 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:24:02,410 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:24:02,411 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:24:02,411 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 -> e60e484eb5ab810972130a1d83dccbab591b96ac9007b9b56059ed6674807329 [2025-03-04 15:24:02,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:24:02,635 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:24:02,637 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:24:02,640 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:24:02,640 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:24:02,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-03-04 15:24:03,835 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b76f6a1/978ad161b0b7467a99315c9b0ba1ae0a/FLAG325c8e145 [2025-03-04 15:24:04,042 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:24:04,043 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-collitem-subst.wvr.c [2025-03-04 15:24:04,049 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b76f6a1/978ad161b0b7467a99315c9b0ba1ae0a/FLAG325c8e145 [2025-03-04 15:24:04,398 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9b76f6a1/978ad161b0b7467a99315c9b0ba1ae0a [2025-03-04 15:24:04,400 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:24:04,401 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:24:04,403 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:04,403 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:24:04,406 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:24:04,407 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:04" (1/1) ... [2025-03-04 15:24:04,408 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d463407 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:04, skipping insertion in model container [2025-03-04 15:24:04,408 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:24:04" (1/1) ... [2025-03-04 15:24:04,421 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:24:04,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:04,565 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:24:04,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:24:04,602 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:24:04,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:04 WrapperNode [2025-03-04 15:24:04,603 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:24:04,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:04,605 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:24:04,605 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:24:04,609 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:04" (1/1) ... [2025-03-04 15:24:04,618 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:04" (1/1) ... [2025-03-04 15:24:04,646 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 19, calls inlined = 41, statements flattened = 519 [2025-03-04 15:24:04,650 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:24:04,650 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:24:04,650 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:24:04,650 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:24:04,660 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:04" (1/1) ... [2025-03-04 15:24:04,660 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:04" (1/1) ... [2025-03-04 15:24:04,666 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:04" (1/1) ... [2025-03-04 15:24:04,691 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:04,691 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:04" (1/1) ... [2025-03-04 15:24:04,692 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:04" (1/1) ... [2025-03-04 15:24:04,704 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:04" (1/1) ... [2025-03-04 15:24:04,708 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:04" (1/1) ... [2025-03-04 15:24:04,709 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:04" (1/1) ... [2025-03-04 15:24:04,710 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:04" (1/1) ... [2025-03-04 15:24:04,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:24:04,717 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:24:04,717 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:24:04,717 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:24:04,718 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:04" (1/1) ... [2025-03-04 15:24:04,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:24:04,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:24:04,748 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:04,750 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:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:24:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:24:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:24:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:24:04,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:24:04,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-04 15:24:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-04 15:24:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:24:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-04 15:24:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-04 15:24:04,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:24:04,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:24:04,771 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:04,846 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:24:04,847 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:24:05,490 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:24:05,490 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:24:06,726 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:24:06,727 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:24:06,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:06 BoogieIcfgContainer [2025-03-04 15:24:06,728 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:24:06,730 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:24:06,730 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:24:06,734 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:24:06,734 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:24:04" (1/3) ... [2025-03-04 15:24:06,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a834fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:06, skipping insertion in model container [2025-03-04 15:24:06,735 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:24:04" (2/3) ... [2025-03-04 15:24:06,735 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a834fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:24:06, skipping insertion in model container [2025-03-04 15:24:06,736 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:06" (3/3) ... [2025-03-04 15:24:06,737 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-collitem-subst.wvr.c [2025-03-04 15:24:06,749 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:24:06,751 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-collitem-subst.wvr.c that has 4 procedures, 96 locations, 1 initial locations, 0 loop locations, and 72 error locations. [2025-03-04 15:24:06,751 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:24:07,466 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-04 15:24:07,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 105 places, 95 transitions, 211 flow [2025-03-04 15:24:07,598 INFO L124 PetriNetUnfolderBase]: 0/92 cut-off events. [2025-03-04 15:24:07,602 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 15:24:07,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 105 conditions, 92 events. 0/92 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 497 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2025-03-04 15:24:07,604 INFO L82 GeneralOperation]: Start removeDead. Operand has 105 places, 95 transitions, 211 flow [2025-03-04 15:24:07,610 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 100 places, 90 transitions, 195 flow [2025-03-04 15:24:07,616 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:24:07,624 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;@3a9163cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:24:07,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 147 error locations. [2025-03-04 15:24:07,628 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:24:07,629 INFO L124 PetriNetUnfolderBase]: 0/4 cut-off events. [2025-03-04 15:24:07,629 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:24:07,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:07,630 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:07,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:07,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:07,635 INFO L85 PathProgramCache]: Analyzing trace with hash 57433304, now seen corresponding path program 1 times [2025-03-04 15:24:07,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:07,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-04 15:24:07,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:07,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:07,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:07,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:07,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:07,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:07,878 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:07,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428772396] [2025-03-04 15:24:07,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428772396] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:07,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:07,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:07,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089991735] [2025-03-04 15:24:07,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:07,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 15:24:07,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:07,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 15:24:07,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 15:24:07,905 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:07,906 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 90 transitions, 195 flow. Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:07,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:07,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:07,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:22,038 INFO L124 PetriNetUnfolderBase]: 34236/49456 cut-off events. [2025-03-04 15:24:22,039 INFO L125 PetriNetUnfolderBase]: For 474/474 co-relation queries the response was YES. [2025-03-04 15:24:22,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99698 conditions, 49456 events. 34236/49456 cut-off events. For 474/474 co-relation queries the response was YES. Maximal size of possible extension queue 11172. Compared 431200 event pairs, 34236 based on Foata normal form. 0/12909 useless extension candidates. Maximal degree in co-relation 97143. Up to 49096 conditions per place. [2025-03-04 15:24:22,304 INFO L140 encePairwiseOnDemand]: 71/95 looper letters, 63 selfloop transitions, 0 changer transitions 0/66 dead transitions. [2025-03-04 15:24:22,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 66 transitions, 273 flow [2025-03-04 15:24:22,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 15:24:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-04 15:24:22,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 99 transitions. [2025-03-04 15:24:22,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210526315789473 [2025-03-04 15:24:22,314 INFO L175 Difference]: Start difference. First operand has 100 places, 90 transitions, 195 flow. Second operand 2 states and 99 transitions. [2025-03-04 15:24:22,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 66 transitions, 273 flow [2025-03-04 15:24:22,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 66 transitions, 264 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:24:22,610 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 138 flow [2025-03-04 15:24:22,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=138, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2025-03-04 15:24:22,614 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-03-04 15:24:22,614 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 138 flow [2025-03-04 15:24:22,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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:22,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:22,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:22,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:24:22,614 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:22,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:22,615 INFO L85 PathProgramCache]: Analyzing trace with hash 57433311, now seen corresponding path program 1 times [2025-03-04 15:24:22,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:22,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862064910] [2025-03-04 15:24:22,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:22,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:22,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:22,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:22,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:22,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:22,701 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:22,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:22,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862064910] [2025-03-04 15:24:22,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862064910] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:22,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:22,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:22,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110211159] [2025-03-04 15:24:22,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:22,702 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:22,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:22,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:22,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:22,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:22,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:22,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:22,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:22,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:34,279 INFO L124 PetriNetUnfolderBase]: 30757/44492 cut-off events. [2025-03-04 15:24:34,280 INFO L125 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-03-04 15:24:34,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89348 conditions, 44492 events. 30757/44492 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 9959. Compared 384001 event pairs, 30757 based on Foata normal form. 0/11822 useless extension candidates. Maximal degree in co-relation 89345. Up to 44150 conditions per place. [2025-03-04 15:24:34,466 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 60 selfloop transitions, 1 changer transitions 0/64 dead transitions. [2025-03-04 15:24:34,466 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 64 transitions, 256 flow [2025-03-04 15:24:34,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:34,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:34,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2025-03-04 15:24:34,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.28421052631578947 [2025-03-04 15:24:34,469 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 138 flow. Second operand 3 states and 81 transitions. [2025-03-04 15:24:34,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 64 transitions, 256 flow [2025-03-04 15:24:34,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 64 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:24:34,471 INFO L231 Difference]: Finished difference. Result has 72 places, 64 transitions, 136 flow [2025-03-04 15:24:34,472 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=136, PETRI_PLACES=72, PETRI_TRANSITIONS=64} [2025-03-04 15:24:34,473 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -28 predicate places. [2025-03-04 15:24:34,473 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 64 transitions, 136 flow [2025-03-04 15:24:34,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:34,473 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:34,473 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:34,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:24:34,473 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:34,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:34,474 INFO L85 PathProgramCache]: Analyzing trace with hash 57433312, now seen corresponding path program 1 times [2025-03-04 15:24:34,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:34,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506182563] [2025-03-04 15:24:34,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:34,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:34,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:34,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:34,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:34,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:34,575 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:34,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506182563] [2025-03-04 15:24:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506182563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:34,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549453840] [2025-03-04 15:24:34,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:34,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:34,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:34,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:34,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:34,577 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:34,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 64 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:34,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:34,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:34,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:43,920 INFO L124 PetriNetUnfolderBase]: 27464/39790 cut-off events. [2025-03-04 15:24:43,920 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 15:24:43,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79926 conditions, 39790 events. 27464/39790 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 8817. Compared 340198 event pairs, 27464 based on Foata normal form. 0/10781 useless extension candidates. Maximal degree in co-relation 79922. Up to 39467 conditions per place. [2025-03-04 15:24:44,055 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 58 selfloop transitions, 1 changer transitions 0/62 dead transitions. [2025-03-04 15:24:44,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 62 transitions, 250 flow [2025-03-04 15:24:44,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:44,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:44,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 79 transitions. [2025-03-04 15:24:44,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2771929824561403 [2025-03-04 15:24:44,059 INFO L175 Difference]: Start difference. First operand has 72 places, 64 transitions, 136 flow. Second operand 3 states and 79 transitions. [2025-03-04 15:24:44,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 62 transitions, 250 flow [2025-03-04 15:24:44,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 62 transitions, 249 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:44,060 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 133 flow [2025-03-04 15:24:44,060 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2025-03-04 15:24:44,061 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -29 predicate places. [2025-03-04 15:24:44,061 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 133 flow [2025-03-04 15:24:44,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:44,061 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:44,061 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:44,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:24:44,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:44,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:44,061 INFO L85 PathProgramCache]: Analyzing trace with hash 57433314, now seen corresponding path program 1 times [2025-03-04 15:24:44,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:44,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-03-04 15:24:44,062 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:44,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:44,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:44,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:44,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:44,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:44,203 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:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36089725] [2025-03-04 15:24:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36089725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:44,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:44,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:44,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90730295] [2025-03-04 15:24:44,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:44,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:44,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:44,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:44,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:44,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:44,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:44,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:44,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:44,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:52,362 INFO L124 PetriNetUnfolderBase]: 24456/35468 cut-off events. [2025-03-04 15:24:52,362 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2025-03-04 15:24:52,393 INFO L83 FinitePrefix]: Finished finitePrefix Result has 71247 conditions, 35468 events. 24456/35468 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 7804. Compared 299309 event pairs, 24456 based on Foata normal form. 0/9777 useless extension candidates. Maximal degree in co-relation 71243. Up to 35180 conditions per place. [2025-03-04 15:24:52,494 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 56 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2025-03-04 15:24:52,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 243 flow [2025-03-04 15:24:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:52,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2025-03-04 15:24:52,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.27017543859649124 [2025-03-04 15:24:52,496 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 133 flow. Second operand 3 states and 77 transitions. [2025-03-04 15:24:52,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 243 flow [2025-03-04 15:24:52,496 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 60 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:52,497 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 130 flow [2025-03-04 15:24:52,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-03-04 15:24:52,498 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -30 predicate places. [2025-03-04 15:24:52,498 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 130 flow [2025-03-04 15:24:52,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:52,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:52,498 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:52,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:24:52,498 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:52,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:52,499 INFO L85 PathProgramCache]: Analyzing trace with hash 57433315, now seen corresponding path program 1 times [2025-03-04 15:24:52,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:52,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-04 15:24:52,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:52,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:24:52,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:24:52,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:24:52,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:24:52,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:24:52,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:24:52,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:24:52,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041368720] [2025-03-04 15:24:52,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041368720] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:24:52,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:24:52,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:24:52,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121928790] [2025-03-04 15:24:52,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:24:52,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:24:52,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:24:52,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:24:52,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:24:52,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:24:52,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:52,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:24:52,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:24:52,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:24:59,892 INFO L124 PetriNetUnfolderBase]: 21622/31394 cut-off events. [2025-03-04 15:24:59,893 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 15:24:59,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63066 conditions, 31394 events. 21622/31394 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 6854. Compared 262062 event pairs, 21622 based on Foata normal form. 0/8821 useless extension candidates. Maximal degree in co-relation 63062. Up to 31139 conditions per place. [2025-03-04 15:24:59,986 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 54 selfloop transitions, 1 changer transitions 0/58 dead transitions. [2025-03-04 15:24:59,987 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 58 transitions, 236 flow [2025-03-04 15:24:59,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:24:59,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:24:59,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2025-03-04 15:24:59,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2631578947368421 [2025-03-04 15:24:59,988 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 130 flow. Second operand 3 states and 75 transitions. [2025-03-04 15:24:59,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 58 transitions, 236 flow [2025-03-04 15:24:59,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 58 transitions, 235 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:24:59,989 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 127 flow [2025-03-04 15:24:59,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=127, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2025-03-04 15:24:59,994 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -31 predicate places. [2025-03-04 15:24:59,994 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 127 flow [2025-03-04 15:24:59,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:59,994 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:24:59,994 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:24:59,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:24:59,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:24:59,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:24:59,994 INFO L85 PathProgramCache]: Analyzing trace with hash 57433317, now seen corresponding path program 1 times [2025-03-04 15:24:59,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:24:59,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152628492] [2025-03-04 15:24:59,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:24:59,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:00,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:00,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:00,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:00,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:00,040 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:00,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:00,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152628492] [2025-03-04 15:25:00,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152628492] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:00,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:00,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:00,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662336981] [2025-03-04 15:25:00,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:00,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:00,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:00,041 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:00,041 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:00,042 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:00,042 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 127 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:00,042 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:00,042 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:00,042 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:06,504 INFO L124 PetriNetUnfolderBase]: 19015/27662 cut-off events. [2025-03-04 15:25:06,504 INFO L125 PetriNetUnfolderBase]: For 32/32 co-relation queries the response was YES. [2025-03-04 15:25:06,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55585 conditions, 27662 events. 19015/27662 cut-off events. For 32/32 co-relation queries the response was YES. Maximal size of possible extension queue 5965. Compared 229611 event pairs, 19015 based on Foata normal form. 0/7958 useless extension candidates. Maximal degree in co-relation 55581. Up to 27424 conditions per place. [2025-03-04 15:25:06,616 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 52 selfloop transitions, 1 changer transitions 0/56 dead transitions. [2025-03-04 15:25:06,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 56 transitions, 229 flow [2025-03-04 15:25:06,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:06,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 73 transitions. [2025-03-04 15:25:06,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.256140350877193 [2025-03-04 15:25:06,617 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 127 flow. Second operand 3 states and 73 transitions. [2025-03-04 15:25:06,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 56 transitions, 229 flow [2025-03-04 15:25:06,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 56 transitions, 228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:06,618 INFO L231 Difference]: Finished difference. Result has 68 places, 56 transitions, 124 flow [2025-03-04 15:25:06,618 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=68, PETRI_TRANSITIONS=56} [2025-03-04 15:25:06,618 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -32 predicate places. [2025-03-04 15:25:06,618 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 56 transitions, 124 flow [2025-03-04 15:25:06,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,619 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:06,619 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:06,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:06,619 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:06,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:06,619 INFO L85 PathProgramCache]: Analyzing trace with hash 57433318, now seen corresponding path program 1 times [2025-03-04 15:25:06,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:06,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70195152] [2025-03-04 15:25:06,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:06,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:06,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:06,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:06,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:06,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:06,671 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:06,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:06,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70195152] [2025-03-04 15:25:06,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70195152] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:06,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:06,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:06,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036489536] [2025-03-04 15:25:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:06,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:06,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:06,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:06,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:06,672 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:06,673 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,673 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:06,673 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:06,673 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:12,339 INFO L124 PetriNetUnfolderBase]: 16574/24164 cut-off events. [2025-03-04 15:25:12,339 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-03-04 15:25:12,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48572 conditions, 24164 events. 16574/24164 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 5139. Compared 197555 event pairs, 16574 based on Foata normal form. 0/7137 useless extension candidates. Maximal degree in co-relation 48568. Up to 23943 conditions per place. [2025-03-04 15:25:12,422 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 50 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2025-03-04 15:25:12,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 54 transitions, 222 flow [2025-03-04 15:25:12,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:12,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2025-03-04 15:25:12,424 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24912280701754386 [2025-03-04 15:25:12,424 INFO L175 Difference]: Start difference. First operand has 68 places, 56 transitions, 124 flow. Second operand 3 states and 71 transitions. [2025-03-04 15:25:12,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 54 transitions, 222 flow [2025-03-04 15:25:12,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 54 transitions, 221 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:12,425 INFO L231 Difference]: Finished difference. Result has 67 places, 54 transitions, 121 flow [2025-03-04 15:25:12,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=121, PETRI_PLACES=67, PETRI_TRANSITIONS=54} [2025-03-04 15:25:12,425 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -33 predicate places. [2025-03-04 15:25:12,425 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 54 transitions, 121 flow [2025-03-04 15:25:12,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:12,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:12,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:12,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:25:12,425 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:12,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:12,426 INFO L85 PathProgramCache]: Analyzing trace with hash 57433320, now seen corresponding path program 1 times [2025-03-04 15:25:12,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:12,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-03-04 15:25:12,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:12,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:12,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:12,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:12,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:12,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:12,490 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:12,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:12,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18989616] [2025-03-04 15:25:12,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18989616] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:12,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:12,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:12,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545701428] [2025-03-04 15:25:12,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:12,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:12,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:12,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:12,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:12,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:12,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 54 transitions, 121 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:12,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:12,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:12,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:17,328 INFO L124 PetriNetUnfolderBase]: 14374/20990 cut-off events. [2025-03-04 15:25:17,328 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2025-03-04 15:25:17,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42195 conditions, 20990 events. 14374/20990 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 4418. Compared 169636 event pairs, 14374 based on Foata normal form. 0/6353 useless extension candidates. Maximal degree in co-relation 42191. Up to 20798 conditions per place. [2025-03-04 15:25:17,395 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 48 selfloop transitions, 1 changer transitions 0/52 dead transitions. [2025-03-04 15:25:17,395 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 52 transitions, 215 flow [2025-03-04 15:25:17,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:17,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:17,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2025-03-04 15:25:17,396 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.24210526315789474 [2025-03-04 15:25:17,396 INFO L175 Difference]: Start difference. First operand has 67 places, 54 transitions, 121 flow. Second operand 3 states and 69 transitions. [2025-03-04 15:25:17,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 52 transitions, 215 flow [2025-03-04 15:25:17,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 52 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:17,397 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 118 flow [2025-03-04 15:25:17,397 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2025-03-04 15:25:17,398 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -34 predicate places. [2025-03-04 15:25:17,398 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 118 flow [2025-03-04 15:25:17,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:17,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:17,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:25:17,398 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:17,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:17,399 INFO L85 PathProgramCache]: Analyzing trace with hash 57433321, now seen corresponding path program 1 times [2025-03-04 15:25:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-03-04 15:25:17,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:17,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:17,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:17,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:17,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:17,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:17,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:17,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:17,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081204727] [2025-03-04 15:25:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081204727] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:17,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520943906] [2025-03-04 15:25:17,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:17,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:17,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:17,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:17,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:17,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:17,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:17,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:21,670 INFO L124 PetriNetUnfolderBase]: 12328/18036 cut-off events. [2025-03-04 15:25:21,670 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2025-03-04 15:25:21,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36260 conditions, 18036 events. 12328/18036 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 3752. Compared 143527 event pairs, 12328 based on Foata normal form. 0/5613 useless extension candidates. Maximal degree in co-relation 36256. Up to 17871 conditions per place. [2025-03-04 15:25:21,722 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 46 selfloop transitions, 1 changer transitions 0/50 dead transitions. [2025-03-04 15:25:21,722 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 50 transitions, 208 flow [2025-03-04 15:25:21,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:21,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:21,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2025-03-04 15:25:21,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.23508771929824562 [2025-03-04 15:25:21,723 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 118 flow. Second operand 3 states and 67 transitions. [2025-03-04 15:25:21,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 50 transitions, 208 flow [2025-03-04 15:25:21,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 50 transitions, 207 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:21,724 INFO L231 Difference]: Finished difference. Result has 65 places, 50 transitions, 115 flow [2025-03-04 15:25:21,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=65, PETRI_TRANSITIONS=50} [2025-03-04 15:25:21,724 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -35 predicate places. [2025-03-04 15:25:21,724 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 50 transitions, 115 flow [2025-03-04 15:25:21,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:21,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:21,724 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:21,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:25:21,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:21,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:21,725 INFO L85 PathProgramCache]: Analyzing trace with hash 57433323, now seen corresponding path program 1 times [2025-03-04 15:25:21,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:21,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869140436] [2025-03-04 15:25:21,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:21,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:21,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:21,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:21,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:21,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:21,763 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:21,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:21,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869140436] [2025-03-04 15:25:21,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869140436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:21,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:21,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:21,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276932676] [2025-03-04 15:25:21,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:21,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:21,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:21,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:21,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:21,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:21,764 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 50 transitions, 115 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:21,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:21,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:21,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:25,141 INFO L124 PetriNetUnfolderBase]: 10473/15368 cut-off events. [2025-03-04 15:25:25,142 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 15:25:25,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30909 conditions, 15368 events. 10473/15368 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 3139. Compared 120722 event pairs, 10473 based on Foata normal form. 0/4950 useless extension candidates. Maximal degree in co-relation 30905. Up to 15218 conditions per place. [2025-03-04 15:25:25,184 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 44 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2025-03-04 15:25:25,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 48 transitions, 201 flow [2025-03-04 15:25:25,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:25,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:25,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-03-04 15:25:25,185 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22807017543859648 [2025-03-04 15:25:25,185 INFO L175 Difference]: Start difference. First operand has 65 places, 50 transitions, 115 flow. Second operand 3 states and 65 transitions. [2025-03-04 15:25:25,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 48 transitions, 201 flow [2025-03-04 15:25:25,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 48 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:25,186 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 112 flow [2025-03-04 15:25:25,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2025-03-04 15:25:25,186 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -36 predicate places. [2025-03-04 15:25:25,186 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 112 flow [2025-03-04 15:25:25,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:25,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:25,186 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:25,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:25,186 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:25,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:25,187 INFO L85 PathProgramCache]: Analyzing trace with hash 57433324, now seen corresponding path program 1 times [2025-03-04 15:25:25,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:25,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-03-04 15:25:25,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:25,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:25,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:25,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:25,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:25,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:25,225 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:25,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:25,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430551352] [2025-03-04 15:25:25,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430551352] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:25,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:25,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904731264] [2025-03-04 15:25:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:25,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:25,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:25,226 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:25,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:25,226 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:25,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:25,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:25,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:25,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:27,919 INFO L124 PetriNetUnfolderBase]: 8764/12906 cut-off events. [2025-03-04 15:25:27,919 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:25:27,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25970 conditions, 12906 events. 8764/12906 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 2581. Compared 99606 event pairs, 8764 based on Foata normal form. 0/4325 useless extension candidates. Maximal degree in co-relation 25966. Up to 12771 conditions per place. [2025-03-04 15:25:27,955 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 42 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2025-03-04 15:25:27,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 46 transitions, 194 flow [2025-03-04 15:25:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:27,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-04 15:25:27,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.22105263157894736 [2025-03-04 15:25:27,956 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 112 flow. Second operand 3 states and 63 transitions. [2025-03-04 15:25:27,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 46 transitions, 194 flow [2025-03-04 15:25:27,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:27,957 INFO L231 Difference]: Finished difference. Result has 63 places, 46 transitions, 109 flow [2025-03-04 15:25:27,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=109, PETRI_PLACES=63, PETRI_TRANSITIONS=46} [2025-03-04 15:25:27,958 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -37 predicate places. [2025-03-04 15:25:27,958 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 46 transitions, 109 flow [2025-03-04 15:25:27,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:27,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:27,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:27,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:25:27,958 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:27,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:27,958 INFO L85 PathProgramCache]: Analyzing trace with hash 57433326, now seen corresponding path program 1 times [2025-03-04 15:25:27,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:27,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-04 15:25:27,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:27,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:27,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:27,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:27,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:27,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:28,025 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:28,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:28,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920541131] [2025-03-04 15:25:28,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920541131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:28,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:28,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:28,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665776012] [2025-03-04 15:25:28,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:28,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:28,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:28,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:28,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:28,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:28,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 46 transitions, 109 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:28,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:28,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:28,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:30,052 INFO L124 PetriNetUnfolderBase]: 7252/10712 cut-off events. [2025-03-04 15:25:30,052 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 15:25:30,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21559 conditions, 10712 events. 7252/10712 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 2104. Compared 81114 event pairs, 7252 based on Foata normal form. 0/3737 useless extension candidates. Maximal degree in co-relation 21555. Up to 10600 conditions per place. [2025-03-04 15:25:30,086 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 40 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2025-03-04 15:25:30,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 44 transitions, 187 flow [2025-03-04 15:25:30,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 61 transitions. [2025-03-04 15:25:30,087 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.21403508771929824 [2025-03-04 15:25:30,087 INFO L175 Difference]: Start difference. First operand has 63 places, 46 transitions, 109 flow. Second operand 3 states and 61 transitions. [2025-03-04 15:25:30,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 44 transitions, 187 flow [2025-03-04 15:25:30,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 44 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:30,088 INFO L231 Difference]: Finished difference. Result has 62 places, 44 transitions, 106 flow [2025-03-04 15:25:30,088 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=62, PETRI_TRANSITIONS=44} [2025-03-04 15:25:30,088 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -38 predicate places. [2025-03-04 15:25:30,088 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 44 transitions, 106 flow [2025-03-04 15:25:30,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:30,088 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:30,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:25:30,088 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:30,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:30,089 INFO L85 PathProgramCache]: Analyzing trace with hash 57433327, now seen corresponding path program 1 times [2025-03-04 15:25:30,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:30,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072648300] [2025-03-04 15:25:30,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:30,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:30,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:30,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:30,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:30,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:30,156 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,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:30,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072648300] [2025-03-04 15:25:30,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072648300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:30,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:30,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:30,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803406584] [2025-03-04 15:25:30,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:30,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:30,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:30,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:30,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:30,157 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:30,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 44 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:30,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:30,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:31,644 INFO L124 PetriNetUnfolderBase]: 5874/8710 cut-off events. [2025-03-04 15:25:31,644 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-04 15:25:31,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17534 conditions, 8710 events. 5874/8710 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1674. Compared 64658 event pairs, 5874 based on Foata normal form. 0/3189 useless extension candidates. Maximal degree in co-relation 17530. Up to 8619 conditions per place. [2025-03-04 15:25:31,669 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 38 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2025-03-04 15:25:31,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 42 transitions, 180 flow [2025-03-04 15:25:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:31,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 59 transitions. [2025-03-04 15:25:31,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.20701754385964913 [2025-03-04 15:25:31,670 INFO L175 Difference]: Start difference. First operand has 62 places, 44 transitions, 106 flow. Second operand 3 states and 59 transitions. [2025-03-04 15:25:31,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 42 transitions, 180 flow [2025-03-04 15:25:31,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 42 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:31,671 INFO L231 Difference]: Finished difference. Result has 61 places, 42 transitions, 103 flow [2025-03-04 15:25:31,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=61, PETRI_TRANSITIONS=42} [2025-03-04 15:25:31,671 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -39 predicate places. [2025-03-04 15:25:31,671 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 42 transitions, 103 flow [2025-03-04 15:25:31,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:31,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:31,671 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:31,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:25:31,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:31,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:31,672 INFO L85 PathProgramCache]: Analyzing trace with hash 57433305, now seen corresponding path program 1 times [2025-03-04 15:25:31,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:31,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700621824] [2025-03-04 15:25:31,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:31,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:31,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:31,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:31,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:31,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:31,691 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:31,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:31,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700621824] [2025-03-04 15:25:31,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700621824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:31,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:31,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:31,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711664376] [2025-03-04 15:25:31,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:31,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:31,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:31,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:31,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:31,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:31,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 42 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:31,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:31,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:31,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:32,966 INFO L124 PetriNetUnfolderBase]: 4651/6938 cut-off events. [2025-03-04 15:25:32,966 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-04 15:25:32,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13977 conditions, 6938 events. 4651/6938 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 50304 event pairs, 4651 based on Foata normal form. 0/2702 useless extension candidates. Maximal degree in co-relation 13973. Up to 6860 conditions per place. [2025-03-04 15:25:32,982 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 36 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2025-03-04 15:25:32,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 40 transitions, 173 flow [2025-03-04 15:25:32,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:32,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2025-03-04 15:25:32,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.2 [2025-03-04 15:25:32,983 INFO L175 Difference]: Start difference. First operand has 61 places, 42 transitions, 103 flow. Second operand 3 states and 57 transitions. [2025-03-04 15:25:32,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 40 transitions, 173 flow [2025-03-04 15:25:32,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 40 transitions, 172 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:32,984 INFO L231 Difference]: Finished difference. Result has 60 places, 40 transitions, 100 flow [2025-03-04 15:25:32,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=60, PETRI_TRANSITIONS=40} [2025-03-04 15:25:32,984 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -40 predicate places. [2025-03-04 15:25:32,984 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 40 transitions, 100 flow [2025-03-04 15:25:32,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:32,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:32,984 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:32,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:32,985 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:32,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 57433306, now seen corresponding path program 1 times [2025-03-04 15:25:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:32,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137603003] [2025-03-04 15:25:32,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:32,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:32,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:32,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:32,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:32,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:33,006 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:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137603003] [2025-03-04 15:25:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137603003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:33,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170087145] [2025-03-04 15:25:33,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:33,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:33,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:33,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:33,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 40 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:33,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:33,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:33,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:34,053 INFO L124 PetriNetUnfolderBase]: 3554/5344 cut-off events. [2025-03-04 15:25:34,053 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 15:25:34,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10776 conditions, 5344 events. 3554/5344 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 37913 event pairs, 3554 based on Foata normal form. 0/2249 useless extension candidates. Maximal degree in co-relation 10772. Up to 5279 conditions per place. [2025-03-04 15:25:34,069 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 34 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2025-03-04 15:25:34,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 38 transitions, 166 flow [2025-03-04 15:25:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2025-03-04 15:25:34,070 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.19298245614035087 [2025-03-04 15:25:34,070 INFO L175 Difference]: Start difference. First operand has 60 places, 40 transitions, 100 flow. Second operand 3 states and 55 transitions. [2025-03-04 15:25:34,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 38 transitions, 166 flow [2025-03-04 15:25:34,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 38 transitions, 165 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:34,071 INFO L231 Difference]: Finished difference. Result has 59 places, 38 transitions, 97 flow [2025-03-04 15:25:34,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=59, PETRI_TRANSITIONS=38} [2025-03-04 15:25:34,071 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2025-03-04 15:25:34,072 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 38 transitions, 97 flow [2025-03-04 15:25:34,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:34,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:34,072 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:34,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:25:34,072 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:34,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:34,072 INFO L85 PathProgramCache]: Analyzing trace with hash 57433308, now seen corresponding path program 1 times [2025-03-04 15:25:34,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:34,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-04 15:25:34,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:34,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:34,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:34,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:34,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:34,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:34,101 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:34,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:34,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445899137] [2025-03-04 15:25:34,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445899137] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:34,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:34,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:34,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082151543] [2025-03-04 15:25:34,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:34,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:34,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:34,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:34,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:34,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:34,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 38 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:34,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:34,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:34,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:34,944 INFO L124 PetriNetUnfolderBase]: 2610/3962 cut-off events. [2025-03-04 15:25:34,945 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 15:25:34,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7995 conditions, 3962 events. 2610/3962 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 27263 event pairs, 2610 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 7991. Up to 3914 conditions per place. [2025-03-04 15:25:34,953 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 32 selfloop transitions, 1 changer transitions 0/36 dead transitions. [2025-03-04 15:25:34,953 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 36 transitions, 159 flow [2025-03-04 15:25:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:34,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:34,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-04 15:25:34,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18596491228070175 [2025-03-04 15:25:34,954 INFO L175 Difference]: Start difference. First operand has 59 places, 38 transitions, 97 flow. Second operand 3 states and 53 transitions. [2025-03-04 15:25:34,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 36 transitions, 159 flow [2025-03-04 15:25:34,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 36 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:34,954 INFO L231 Difference]: Finished difference. Result has 58 places, 36 transitions, 94 flow [2025-03-04 15:25:34,954 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=58, PETRI_TRANSITIONS=36} [2025-03-04 15:25:34,955 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2025-03-04 15:25:34,955 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 36 transitions, 94 flow [2025-03-04 15:25:34,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:34,955 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:34,955 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-03-04 15:25:34,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:25:34,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:34,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:34,955 INFO L85 PathProgramCache]: Analyzing trace with hash 57433309, now seen corresponding path program 1 times [2025-03-04 15:25:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:34,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697245483] [2025-03-04 15:25:34,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:34,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-03-04 15:25:34,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-03-04 15:25:34,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:34,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:34,984 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:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697245483] [2025-03-04 15:25:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697245483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:34,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862392976] [2025-03-04 15:25:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:34,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:34,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:34,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:34,985 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:34,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 36 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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:34,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:34,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:34,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:35,607 INFO L124 PetriNetUnfolderBase]: 1780/2744 cut-off events. [2025-03-04 15:25:35,607 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2025-03-04 15:25:35,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5544 conditions, 2744 events. 1780/2744 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 18097 event pairs, 1780 based on Foata normal form. 0/1453 useless extension candidates. Maximal degree in co-relation 5540. Up to 2711 conditions per place. [2025-03-04 15:25:35,615 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 30 selfloop transitions, 1 changer transitions 0/34 dead transitions. [2025-03-04 15:25:35,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 34 transitions, 152 flow [2025-03-04 15:25:35,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:35,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:35,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2025-03-04 15:25:35,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.17894736842105263 [2025-03-04 15:25:35,616 INFO L175 Difference]: Start difference. First operand has 58 places, 36 transitions, 94 flow. Second operand 3 states and 51 transitions. [2025-03-04 15:25:35,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 34 transitions, 152 flow [2025-03-04 15:25:35,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 34 transitions, 151 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:35,617 INFO L231 Difference]: Finished difference. Result has 57 places, 34 transitions, 91 flow [2025-03-04 15:25:35,617 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=57, PETRI_TRANSITIONS=34} [2025-03-04 15:25:35,617 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -43 predicate places. [2025-03-04 15:25:35,617 INFO L471 AbstractCegarLoop]: Abstraction has has 57 places, 34 transitions, 91 flow [2025-03-04 15:25:35,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:35,617 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:35,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:25:35,618 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:35,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:35,618 INFO L85 PathProgramCache]: Analyzing trace with hash -642015374, now seen corresponding path program 1 times [2025-03-04 15:25:35,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:35,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481560194] [2025-03-04 15:25:35,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:35,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:35,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:35,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:35,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:35,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:35,641 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,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:35,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481560194] [2025-03-04 15:25:35,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481560194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:35,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:35,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:35,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998185862] [2025-03-04 15:25:35,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:35,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:35,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:35,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:35,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:35,642 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:35,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 34 transitions, 91 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:35,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:35,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:36,208 INFO L124 PetriNetUnfolderBase]: 1468/2275 cut-off events. [2025-03-04 15:25:36,209 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-04 15:25:36,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4604 conditions, 2275 events. 1468/2275 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 349. Compared 14627 event pairs, 1468 based on Foata normal form. 0/1243 useless extension candidates. Maximal degree in co-relation 4600. Up to 2245 conditions per place. [2025-03-04 15:25:36,216 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 28 selfloop transitions, 1 changer transitions 0/32 dead transitions. [2025-03-04 15:25:36,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 32 transitions, 145 flow [2025-03-04 15:25:36,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:36,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:36,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 49 transitions. [2025-03-04 15:25:36,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.17192982456140352 [2025-03-04 15:25:36,217 INFO L175 Difference]: Start difference. First operand has 57 places, 34 transitions, 91 flow. Second operand 3 states and 49 transitions. [2025-03-04 15:25:36,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 32 transitions, 145 flow [2025-03-04 15:25:36,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 32 transitions, 144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:36,217 INFO L231 Difference]: Finished difference. Result has 56 places, 32 transitions, 88 flow [2025-03-04 15:25:36,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=88, PETRI_PLACES=56, PETRI_TRANSITIONS=32} [2025-03-04 15:25:36,218 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -44 predicate places. [2025-03-04 15:25:36,218 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 32 transitions, 88 flow [2025-03-04 15:25:36,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:36,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:36,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:36,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:25:36,218 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:36,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -642015380, now seen corresponding path program 1 times [2025-03-04 15:25:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-04 15:25:36,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:36,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:36,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:36,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:36,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:36,239 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:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672056610] [2025-03-04 15:25:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672056610] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812617935] [2025-03-04 15:25:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:36,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:36,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:36,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:36,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:36,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:36,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 32 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:36,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:36,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:36,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:36,727 INFO L124 PetriNetUnfolderBase]: 1186/1850 cut-off events. [2025-03-04 15:25:36,727 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-03-04 15:25:36,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 1850 events. 1186/1850 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 11461 event pairs, 1186 based on Foata normal form. 0/1049 useless extension candidates. Maximal degree in co-relation 3748. Up to 1823 conditions per place. [2025-03-04 15:25:36,732 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 26 selfloop transitions, 1 changer transitions 0/30 dead transitions. [2025-03-04 15:25:36,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 30 transitions, 138 flow [2025-03-04 15:25:36,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:36,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:36,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2025-03-04 15:25:36,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1649122807017544 [2025-03-04 15:25:36,733 INFO L175 Difference]: Start difference. First operand has 56 places, 32 transitions, 88 flow. Second operand 3 states and 47 transitions. [2025-03-04 15:25:36,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 30 transitions, 138 flow [2025-03-04 15:25:36,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 30 transitions, 137 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:36,734 INFO L231 Difference]: Finished difference. Result has 55 places, 30 transitions, 85 flow [2025-03-04 15:25:36,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=85, PETRI_PLACES=55, PETRI_TRANSITIONS=30} [2025-03-04 15:25:36,734 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -45 predicate places. [2025-03-04 15:25:36,734 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 30 transitions, 85 flow [2025-03-04 15:25:36,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:36,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:36,734 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:36,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:25:36,734 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:36,735 INFO L85 PathProgramCache]: Analyzing trace with hash -642015362, now seen corresponding path program 1 times [2025-03-04 15:25:36,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:36,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277083518] [2025-03-04 15:25:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:36,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:36,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:36,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:36,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:36,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:36,771 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:36,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:36,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277083518] [2025-03-04 15:25:36,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277083518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:36,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:36,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:36,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727485933] [2025-03-04 15:25:36,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:36,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:36,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:36,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:36,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:36,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:36,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 30 transitions, 85 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:36,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:36,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:36,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:37,170 INFO L124 PetriNetUnfolderBase]: 934/1469 cut-off events. [2025-03-04 15:25:37,170 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 15:25:37,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2988 conditions, 1469 events. 934/1469 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 8808 event pairs, 934 based on Foata normal form. 0/871 useless extension candidates. Maximal degree in co-relation 2984. Up to 1445 conditions per place. [2025-03-04 15:25:37,173 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 24 selfloop transitions, 1 changer transitions 0/28 dead transitions. [2025-03-04 15:25:37,174 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 28 transitions, 131 flow [2025-03-04 15:25:37,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:37,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:37,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 45 transitions. [2025-03-04 15:25:37,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.15789473684210525 [2025-03-04 15:25:37,174 INFO L175 Difference]: Start difference. First operand has 55 places, 30 transitions, 85 flow. Second operand 3 states and 45 transitions. [2025-03-04 15:25:37,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 28 transitions, 131 flow [2025-03-04 15:25:37,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 28 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:37,175 INFO L231 Difference]: Finished difference. Result has 54 places, 28 transitions, 82 flow [2025-03-04 15:25:37,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=82, PETRI_PLACES=54, PETRI_TRANSITIONS=28} [2025-03-04 15:25:37,175 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -46 predicate places. [2025-03-04 15:25:37,175 INFO L471 AbstractCegarLoop]: Abstraction has has 54 places, 28 transitions, 82 flow [2025-03-04 15:25:37,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,175 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,175 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:37,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:25:37,175 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:37,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,176 INFO L85 PathProgramCache]: Analyzing trace with hash -642015367, now seen corresponding path program 1 times [2025-03-04 15:25:37,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-03-04 15:25:37,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:37,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:37,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,203 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:37,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420835339] [2025-03-04 15:25:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420835339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914422179] [2025-03-04 15:25:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:37,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:37,205 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:37,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 28 transitions, 82 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:37,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:37,502 INFO L124 PetriNetUnfolderBase]: 712/1132 cut-off events. [2025-03-04 15:25:37,502 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-04 15:25:37,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2312 conditions, 1132 events. 712/1132 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 6442 event pairs, 712 based on Foata normal form. 0/709 useless extension candidates. Maximal degree in co-relation 2308. Up to 1111 conditions per place. [2025-03-04 15:25:37,506 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 22 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2025-03-04 15:25:37,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 26 transitions, 124 flow [2025-03-04 15:25:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:37,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:37,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2025-03-04 15:25:37,507 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.15087719298245614 [2025-03-04 15:25:37,507 INFO L175 Difference]: Start difference. First operand has 54 places, 28 transitions, 82 flow. Second operand 3 states and 43 transitions. [2025-03-04 15:25:37,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 26 transitions, 124 flow [2025-03-04 15:25:37,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 26 transitions, 123 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:37,508 INFO L231 Difference]: Finished difference. Result has 53 places, 26 transitions, 79 flow [2025-03-04 15:25:37,508 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=77, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=79, PETRI_PLACES=53, PETRI_TRANSITIONS=26} [2025-03-04 15:25:37,508 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -47 predicate places. [2025-03-04 15:25:37,508 INFO L471 AbstractCegarLoop]: Abstraction has has 53 places, 26 transitions, 79 flow [2025-03-04 15:25:37,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,509 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:37,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:25:37,509 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash -642015361, now seen corresponding path program 1 times [2025-03-04 15:25:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-03-04 15:25:37,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:37,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:37,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,546 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:37,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696342524] [2025-03-04 15:25:37,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696342524] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:37,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:37,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:37,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34690175] [2025-03-04 15:25:37,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:37,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:37,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:37,548 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:37,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 26 transitions, 79 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,549 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:37,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:37,752 INFO L124 PetriNetUnfolderBase]: 520/839 cut-off events. [2025-03-04 15:25:37,753 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-04 15:25:37,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1724 conditions, 839 events. 520/839 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 4547 event pairs, 520 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 1720. Up to 821 conditions per place. [2025-03-04 15:25:37,756 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 20 selfloop transitions, 1 changer transitions 0/24 dead transitions. [2025-03-04 15:25:37,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 24 transitions, 117 flow [2025-03-04 15:25:37,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:37,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:37,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-03-04 15:25:37,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.14385964912280702 [2025-03-04 15:25:37,756 INFO L175 Difference]: Start difference. First operand has 53 places, 26 transitions, 79 flow. Second operand 3 states and 41 transitions. [2025-03-04 15:25:37,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 24 transitions, 117 flow [2025-03-04 15:25:37,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 24 transitions, 116 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:37,757 INFO L231 Difference]: Finished difference. Result has 52 places, 24 transitions, 76 flow [2025-03-04 15:25:37,757 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=76, PETRI_PLACES=52, PETRI_TRANSITIONS=24} [2025-03-04 15:25:37,757 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -48 predicate places. [2025-03-04 15:25:37,757 INFO L471 AbstractCegarLoop]: Abstraction has has 52 places, 24 transitions, 76 flow [2025-03-04 15:25:37,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,758 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:37,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:25:37,758 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:37,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,758 INFO L85 PathProgramCache]: Analyzing trace with hash -642015379, now seen corresponding path program 1 times [2025-03-04 15:25:37,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-03-04 15:25:37,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:37,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:37,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,787 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:37,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266523833] [2025-03-04 15:25:37,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266523833] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:37,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:37,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:37,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672067917] [2025-03-04 15:25:37,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:37,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:37,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:37,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:37,789 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 24 transitions, 76 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,789 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,789 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:37,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:37,953 INFO L124 PetriNetUnfolderBase]: 358/590 cut-off events. [2025-03-04 15:25:37,953 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 15:25:37,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1224 conditions, 590 events. 358/590 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 2947 event pairs, 358 based on Foata normal form. 0/433 useless extension candidates. Maximal degree in co-relation 1220. Up to 575 conditions per place. [2025-03-04 15:25:37,955 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 18 selfloop transitions, 1 changer transitions 0/22 dead transitions. [2025-03-04 15:25:37,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 22 transitions, 110 flow [2025-03-04 15:25:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:37,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-03-04 15:25:37,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.1368421052631579 [2025-03-04 15:25:37,956 INFO L175 Difference]: Start difference. First operand has 52 places, 24 transitions, 76 flow. Second operand 3 states and 39 transitions. [2025-03-04 15:25:37,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 22 transitions, 110 flow [2025-03-04 15:25:37,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 22 transitions, 109 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:37,957 INFO L231 Difference]: Finished difference. Result has 51 places, 22 transitions, 73 flow [2025-03-04 15:25:37,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=71, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=73, PETRI_PLACES=51, PETRI_TRANSITIONS=22} [2025-03-04 15:25:37,958 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -49 predicate places. [2025-03-04 15:25:37,958 INFO L471 AbstractCegarLoop]: Abstraction has has 51 places, 22 transitions, 73 flow [2025-03-04 15:25:37,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:37,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:25:37,958 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:37,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,959 INFO L85 PathProgramCache]: Analyzing trace with hash -642015373, now seen corresponding path program 1 times [2025-03-04 15:25:37,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-03-04 15:25:37,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:37,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:37,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,987 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:37,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372185404] [2025-03-04 15:25:37,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372185404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:37,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:37,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:37,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515622056] [2025-03-04 15:25:37,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:37,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:37,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:37,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:37,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 22 transitions, 73 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:37,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:37,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:38,106 INFO L124 PetriNetUnfolderBase]: 226/385 cut-off events. [2025-03-04 15:25:38,106 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:25:38,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 812 conditions, 385 events. 226/385 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 1717 event pairs, 226 based on Foata normal form. 0/319 useless extension candidates. Maximal degree in co-relation 808. Up to 373 conditions per place. [2025-03-04 15:25:38,107 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 16 selfloop transitions, 1 changer transitions 0/20 dead transitions. [2025-03-04 15:25:38,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 20 transitions, 103 flow [2025-03-04 15:25:38,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:38,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:38,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-03-04 15:25:38,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12982456140350876 [2025-03-04 15:25:38,108 INFO L175 Difference]: Start difference. First operand has 51 places, 22 transitions, 73 flow. Second operand 3 states and 37 transitions. [2025-03-04 15:25:38,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 20 transitions, 103 flow [2025-03-04 15:25:38,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 20 transitions, 102 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:38,108 INFO L231 Difference]: Finished difference. Result has 50 places, 20 transitions, 70 flow [2025-03-04 15:25:38,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=50, PETRI_TRANSITIONS=20} [2025-03-04 15:25:38,108 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -50 predicate places. [2025-03-04 15:25:38,108 INFO L471 AbstractCegarLoop]: Abstraction has has 50 places, 20 transitions, 70 flow [2025-03-04 15:25:38,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:38,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:38,108 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:25:38,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:25:38,109 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (and 144 more)] === [2025-03-04 15:25:38,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:38,109 INFO L85 PathProgramCache]: Analyzing trace with hash -642015368, now seen corresponding path program 1 times [2025-03-04 15:25:38,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:38,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-03-04 15:25:38,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:38,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:38,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:38,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:38,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:38,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:38,144 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:38,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:38,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328730285] [2025-03-04 15:25:38,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328730285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:38,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:38,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-04 15:25:38,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152189728] [2025-03-04 15:25:38,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:38,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:38,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:38,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:38,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:38,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 95 [2025-03-04 15:25:38,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 20 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:38,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:38,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 95 [2025-03-04 15:25:38,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:38,222 INFO L124 PetriNetUnfolderBase]: 124/224 cut-off events. [2025-03-04 15:25:38,223 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 15:25:38,224 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488 conditions, 224 events. 124/224 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 846 event pairs, 124 based on Foata normal form. 0/221 useless extension candidates. Maximal degree in co-relation 484. Up to 215 conditions per place. [2025-03-04 15:25:38,224 INFO L140 encePairwiseOnDemand]: 92/95 looper letters, 0 selfloop transitions, 0 changer transitions 18/18 dead transitions. [2025-03-04 15:25:38,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 18 transitions, 96 flow [2025-03-04 15:25:38,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:38,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 35 transitions. [2025-03-04 15:25:38,225 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.12280701754385964 [2025-03-04 15:25:38,225 INFO L175 Difference]: Start difference. First operand has 50 places, 20 transitions, 70 flow. Second operand 3 states and 35 transitions. [2025-03-04 15:25:38,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 18 transitions, 96 flow [2025-03-04 15:25:38,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 18 transitions, 95 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:38,225 INFO L231 Difference]: Finished difference. Result has 49 places, 0 transitions, 0 flow [2025-03-04 15:25:38,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=95, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=18, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=49, PETRI_TRANSITIONS=0} [2025-03-04 15:25:38,226 INFO L279 CegarLoopForPetriNet]: 100 programPoint places, -51 predicate places. [2025-03-04 15:25:38,226 INFO L471 AbstractCegarLoop]: Abstraction has has 49 places, 0 transitions, 0 flow [2025-03-04 15:25:38,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (146 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (145 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (144 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (143 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (142 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (141 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (140 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (139 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (138 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (137 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (136 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (135 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (134 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (133 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (132 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (131 of 147 remaining) [2025-03-04 15:25:38,228 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (130 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (129 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (128 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (127 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (126 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (125 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (124 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (123 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (122 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (121 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (120 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (119 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (118 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (117 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (116 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (115 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (114 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (113 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (112 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (111 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (110 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (109 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (108 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (107 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (106 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (105 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (104 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (103 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (102 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (101 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (100 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (99 of 147 remaining) [2025-03-04 15:25:38,229 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (98 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (97 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (96 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (95 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (94 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (93 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (92 of 147 remaining) [2025-03-04 15:25:38,230 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (91 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (90 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (89 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (88 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (87 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (86 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (85 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (84 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (83 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (82 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (81 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (80 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 147 remaining) [2025-03-04 15:25:38,231 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (74 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 147 remaining) [2025-03-04 15:25:38,232 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 147 remaining) [2025-03-04 15:25:38,233 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (37 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (36 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 147 remaining) [2025-03-04 15:25:38,234 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err23ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err22ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err21ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err20ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err19ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err18ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 147 remaining) [2025-03-04 15:25:38,235 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 147 remaining) [2025-03-04 15:25:38,236 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 147 remaining) [2025-03-04 15:25:38,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:25:38,237 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:38,241 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:25:38,242 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:25:38,246 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:25:38 BasicIcfg [2025-03-04 15:25:38,246 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:25:38,247 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:25:38,247 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:25:38,247 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:25:38,247 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:24:06" (3/4) ... [2025-03-04 15:25:38,248 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:25:38,250 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:25:38,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:25:38,251 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-04 15:25:38,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 71 nodes and edges [2025-03-04 15:25:38,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 32 nodes and edges [2025-03-04 15:25:38,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-03-04 15:25:38,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-04 15:25:38,255 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 15:25:38,318 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:25:38,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:25:38,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:25:38,319 INFO L158 Benchmark]: Toolchain (without parser) took 93918.34ms. Allocated memory was 142.6MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 113.4MB in the beginning and 4.9GB in the end (delta: -4.8GB). Peak memory consumption was 1.9GB. Max. memory is 16.1GB. [2025-03-04 15:25:38,319 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:38,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 200.00ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:38,320 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.20ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 98.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:25:38,320 INFO L158 Benchmark]: Boogie Preprocessor took 63.18ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:38,320 INFO L158 Benchmark]: IcfgBuilder took 2010.77ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 95.4MB in the beginning and 204.2MB in the end (delta: -108.8MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. [2025-03-04 15:25:38,320 INFO L158 Benchmark]: TraceAbstraction took 91516.29ms. Allocated memory was 285.2MB in the beginning and 6.9GB in the end (delta: 6.6GB). Free memory was 203.1MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. [2025-03-04 15:25:38,320 INFO L158 Benchmark]: Witness Printer took 72.01ms. Allocated memory is still 6.9GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:25:38,321 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 200.00ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 101.2MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.20ms. Allocated memory is still 142.6MB. Free memory was 101.2MB in the beginning and 98.3MB in the end (delta: 3.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.18ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.4MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 2010.77ms. Allocated memory was 142.6MB in the beginning and 285.2MB in the end (delta: 142.6MB). Free memory was 95.4MB in the beginning and 204.2MB in the end (delta: -108.8MB). Peak memory consumption was 78.0MB. Max. memory is 16.1GB. * TraceAbstraction took 91516.29ms. Allocated memory was 285.2MB in the beginning and 6.9GB in the end (delta: 6.6GB). Free memory was 203.1MB in the beginning and 4.9GB in the end (delta: -4.7GB). Peak memory consumption was 1.8GB. Max. memory is 16.1GB. * Witness Printer took 72.01ms. Allocated memory is still 6.9GB. Free memory was 4.9GB in the beginning and 4.9GB in the end (delta: 4.8MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 107]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 108]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 109]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 183 locations, 147 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 90.7s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 89.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 848 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 848 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 975 IncrementalHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 0 mSDtfsCounter, 975 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=0, InterpolantAutomatonStates: 74, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 116 NumberOfCodeBlocks, 116 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 355 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 72 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:25:38,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE