./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i --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/pthread-ext/11_fmaxsymopt-zero.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:09:13,920 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:09:13,980 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:09:13,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:09:13,987 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:09:14,007 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:09:14,009 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:09:14,009 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:09:14,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:09:14,010 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:09:14,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:09:14,010 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:09:14,011 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:09:14,011 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:09:14,011 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:09:14,011 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:09:14,011 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:09:14,011 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:09:14,012 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:09:14,012 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:09:14,013 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:09:14,013 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:09:14,013 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:09:14,013 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:14,013 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:09:14,013 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:09:14,014 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:09:14,014 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 -> 44a70169ef8abd67c211072db1308f16df00422231dd8f14aa88bc39d0b023bb [2025-03-04 15:09:14,251 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:09:14,259 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:09:14,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:09:14,262 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:09:14,262 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:09:14,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-04 15:09:15,437 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe1008a1/d5b3df571ef2426fb2159f027bfc2ada/FLAGac91012d5 [2025-03-04 15:09:15,729 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:09:15,730 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt-zero.i [2025-03-04 15:09:15,746 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe1008a1/d5b3df571ef2426fb2159f027bfc2ada/FLAGac91012d5 [2025-03-04 15:09:15,767 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2fe1008a1/d5b3df571ef2426fb2159f027bfc2ada [2025-03-04 15:09:15,769 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:09:15,771 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:09:15,773 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:15,773 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:09:15,776 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:09:15,777 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:15" (1/1) ... [2025-03-04 15:09:15,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4061e89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:15, skipping insertion in model container [2025-03-04 15:09:15,780 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:15" (1/1) ... [2025-03-04 15:09:15,805 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:09:15,991 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:16,001 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:09:16,030 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:16,060 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:09:16,061 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16 WrapperNode [2025-03-04 15:09:16,061 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:16,062 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:16,062 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:09:16,062 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:09:16,067 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:09:16" (1/1) ... [2025-03-04 15:09:16,076 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:09:16" (1/1) ... [2025-03-04 15:09:16,093 INFO L138 Inliner]: procedures = 164, calls = 26, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 80 [2025-03-04 15:09:16,094 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:16,095 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:09:16,095 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:09:16,096 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:09:16,102 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,106 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,127 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 5, 7]. 50 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 0 writes are split as follows [0, 0, 0]. [2025-03-04 15:09:16,127 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,128 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,131 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,134 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,135 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,141 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:09:16,141 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:09:16,142 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:09:16,142 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:09:16,142 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (1/1) ... [2025-03-04 15:09:16,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:16,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:16,165 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:09:16,168 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:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 15:09:16,185 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:09:16,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:09:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:09:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:09:16,186 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:09:16,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:09:16,187 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:09:16,290 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:09:16,293 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:09:16,420 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:09:16,420 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:09:16,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:09:16,521 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:09:16,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:16 BoogieIcfgContainer [2025-03-04 15:09:16,521 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:09:16,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:09:16,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:09:16,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:09:16,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:09:15" (1/3) ... [2025-03-04 15:09:16,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cec0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:16, skipping insertion in model container [2025-03-04 15:09:16,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:16" (2/3) ... [2025-03-04 15:09:16,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64cec0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:16, skipping insertion in model container [2025-03-04 15:09:16,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:16" (3/3) ... [2025-03-04 15:09:16,528 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt-zero.i [2025-03-04 15:09:16,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:09:16,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt-zero.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 4 error locations. [2025-03-04 15:09:16,541 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:09:16,576 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:16,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 27 places, 28 transitions, 60 flow [2025-03-04 15:09:16,621 INFO L124 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-03-04 15:09:16,623 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:16,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 30 events. 4/30 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 0/20 useless extension candidates. Maximal degree in co-relation 25. Up to 2 conditions per place. [2025-03-04 15:09:16,625 INFO L82 GeneralOperation]: Start removeDead. Operand has 27 places, 28 transitions, 60 flow [2025-03-04 15:09:16,628 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 27 places, 28 transitions, 60 flow [2025-03-04 15:09:16,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:16,643 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;@4aa71240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:16,643 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-03-04 15:09:16,649 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:16,649 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:09:16,649 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:16,649 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:16,650 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:09:16,650 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:09:16,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash 201013038, now seen corresponding path program 1 times [2025-03-04 15:09:16,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:16,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718377494] [2025-03-04 15:09:16,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:16,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:16,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:09:16,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:09:16,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:16,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:16,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:16,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:16,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718377494] [2025-03-04 15:09:16,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718377494] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:16,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:16,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:16,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891247158] [2025-03-04 15:09:16,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:16,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:16,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:16,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:16,963 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 11 out of 28 [2025-03-04 15:09:16,965 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 28 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:09:16,965 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:16,965 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 11 of 28 [2025-03-04 15:09:16,965 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,018 INFO L124 PetriNetUnfolderBase]: 22/80 cut-off events. [2025-03-04 15:09:17,019 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:17,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 80 events. 22/80 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 231 event pairs, 2 based on Foata normal form. 6/80 useless extension candidates. Maximal degree in co-relation 120. Up to 38 conditions per place. [2025-03-04 15:09:17,021 INFO L140 encePairwiseOnDemand]: 22/28 looper letters, 13 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2025-03-04 15:09:17,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 86 flow [2025-03-04 15:09:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:17,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2025-03-04 15:09:17,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6309523809523809 [2025-03-04 15:09:17,035 INFO L175 Difference]: Start difference. First operand has 27 places, 28 transitions, 60 flow. Second operand 3 states and 53 transitions. [2025-03-04 15:09:17,035 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 86 flow [2025-03-04 15:09:17,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 26 transitions, 86 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:17,039 INFO L231 Difference]: Finished difference. Result has 27 places, 24 transitions, 56 flow [2025-03-04 15:09:17,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=28, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=27, PETRI_TRANSITIONS=24} [2025-03-04 15:09:17,046 INFO L279 CegarLoopForPetriNet]: 27 programPoint places, 0 predicate places. [2025-03-04 15:09:17,046 INFO L471 AbstractCegarLoop]: Abstraction has has 27 places, 24 transitions, 56 flow [2025-03-04 15:09:17,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 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:09:17,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,046 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:17,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:09:17,047 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 6 more)] === [2025-03-04 15:09:17,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1936424488, now seen corresponding path program 1 times [2025-03-04 15:09:17,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314018749] [2025-03-04 15:09:17,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:17,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:17,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:17,069 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:17,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:17,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:17,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:17,101 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:17,101 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:17,102 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-03-04 15:09:17,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 9 remaining) [2025-03-04 15:09:17,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 9 remaining) [2025-03-04 15:09:17,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 9 remaining) [2025-03-04 15:09:17,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 9 remaining) [2025-03-04 15:09:17,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 9 remaining) [2025-03-04 15:09:17,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 9 remaining) [2025-03-04 15:09:17,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 9 remaining) [2025-03-04 15:09:17,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 9 remaining) [2025-03-04 15:09:17,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:09:17,105 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-03-04 15:09:17,107 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:17,107 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:09:17,136 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:17,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 48 places, 51 transitions, 112 flow [2025-03-04 15:09:17,151 INFO L124 PetriNetUnfolderBase]: 8/56 cut-off events. [2025-03-04 15:09:17,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:09:17,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64 conditions, 56 events. 8/56 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 162 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 47. Up to 3 conditions per place. [2025-03-04 15:09:17,153 INFO L82 GeneralOperation]: Start removeDead. Operand has 48 places, 51 transitions, 112 flow [2025-03-04 15:09:17,156 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 48 places, 51 transitions, 112 flow [2025-03-04 15:09:17,157 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:17,157 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;@4aa71240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:17,157 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-03-04 15:09:17,162 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:17,162 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:09:17,162 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:09:17,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,162 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:09:17,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:09:17,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,163 INFO L85 PathProgramCache]: Analyzing trace with hash 249704439, now seen corresponding path program 1 times [2025-03-04 15:09:17,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302499909] [2025-03-04 15:09:17,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:09:17,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:09:17,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,249 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:09:17,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:17,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302499909] [2025-03-04 15:09:17,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [302499909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:17,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:17,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:17,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923382957] [2025-03-04 15:09:17,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:17,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:17,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:17,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:17,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:17,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-04 15:09:17,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 51 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:09:17,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:17,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-04 15:09:17,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,428 INFO L124 PetriNetUnfolderBase]: 421/977 cut-off events. [2025-03-04 15:09:17,428 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-03-04 15:09:17,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1643 conditions, 977 events. 421/977 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 6007 event pairs, 54 based on Foata normal form. 108/1004 useless extension candidates. Maximal degree in co-relation 1348. Up to 517 conditions per place. [2025-03-04 15:09:17,437 INFO L140 encePairwiseOnDemand]: 43/51 looper letters, 31 selfloop transitions, 2 changer transitions 0/56 dead transitions. [2025-03-04 15:09:17,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 56 transitions, 193 flow [2025-03-04 15:09:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:17,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:17,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2025-03-04 15:09:17,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7254901960784313 [2025-03-04 15:09:17,439 INFO L175 Difference]: Start difference. First operand has 48 places, 51 transitions, 112 flow. Second operand 3 states and 111 transitions. [2025-03-04 15:09:17,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 56 transitions, 193 flow [2025-03-04 15:09:17,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 56 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:17,441 INFO L231 Difference]: Finished difference. Result has 48 places, 45 transitions, 104 flow [2025-03-04 15:09:17,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=48, PETRI_TRANSITIONS=45} [2025-03-04 15:09:17,442 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, 0 predicate places. [2025-03-04 15:09:17,442 INFO L471 AbstractCegarLoop]: Abstraction has has 48 places, 45 transitions, 104 flow [2025-03-04 15:09:17,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:09:17,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:09:17,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:09:17,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:09:17,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,443 INFO L85 PathProgramCache]: Analyzing trace with hash -849096735, now seen corresponding path program 1 times [2025-03-04 15:09:17,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116514895] [2025-03-04 15:09:17,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:17,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:17,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,511 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:09:17,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:17,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116514895] [2025-03-04 15:09:17,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116514895] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:17,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:17,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:17,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883174047] [2025-03-04 15:09:17,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:17,512 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:17,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:17,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:17,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:17,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-04 15:09:17,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 45 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:09:17,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:17,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-04 15:09:17,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,619 INFO L124 PetriNetUnfolderBase]: 372/856 cut-off events. [2025-03-04 15:09:17,619 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-04 15:09:17,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1504 conditions, 856 events. 372/856 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 4965 event pairs, 126 based on Foata normal form. 27/799 useless extension candidates. Maximal degree in co-relation 1292. Up to 447 conditions per place. [2025-03-04 15:09:17,624 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 30 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2025-03-04 15:09:17,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 55 transitions, 193 flow [2025-03-04 15:09:17,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:17,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:17,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 15:09:17,629 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:09:17,629 INFO L175 Difference]: Start difference. First operand has 48 places, 45 transitions, 104 flow. Second operand 3 states and 102 transitions. [2025-03-04 15:09:17,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 55 transitions, 193 flow [2025-03-04 15:09:17,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 55 transitions, 189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:17,630 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 102 flow [2025-03-04 15:09:17,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2025-03-04 15:09:17,631 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -1 predicate places. [2025-03-04 15:09:17,631 INFO L471 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 102 flow [2025-03-04 15:09:17,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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:09:17,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:17,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:09:17,631 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:09:17,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,632 INFO L85 PathProgramCache]: Analyzing trace with hash 28782220, now seen corresponding path program 1 times [2025-03-04 15:09:17,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470622070] [2025-03-04 15:09:17,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:09:17,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:09:17,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,680 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:09:17,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:17,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470622070] [2025-03-04 15:09:17,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470622070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:17,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:17,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:17,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907017296] [2025-03-04 15:09:17,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:17,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:17,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:17,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:17,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:17,692 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 51 [2025-03-04 15:09:17,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:09:17,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:17,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 51 [2025-03-04 15:09:17,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:17,822 INFO L124 PetriNetUnfolderBase]: 412/937 cut-off events. [2025-03-04 15:09:17,822 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-04 15:09:17,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 937 events. 412/937 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5625 event pairs, 72 based on Foata normal form. 24/889 useless extension candidates. Maximal degree in co-relation 1135. Up to 472 conditions per place. [2025-03-04 15:09:17,829 INFO L140 encePairwiseOnDemand]: 48/51 looper letters, 30 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2025-03-04 15:09:17,829 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 53 transitions, 188 flow [2025-03-04 15:09:17,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:17,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2025-03-04 15:09:17,832 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:09:17,832 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 102 flow. Second operand 3 states and 102 transitions. [2025-03-04 15:09:17,832 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 53 transitions, 188 flow [2025-03-04 15:09:17,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 180 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:17,835 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 100 flow [2025-03-04 15:09:17,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=51, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2025-03-04 15:09:17,836 INFO L279 CegarLoopForPetriNet]: 48 programPoint places, -2 predicate places. [2025-03-04 15:09:17,836 INFO L471 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 100 flow [2025-03-04 15:09:17,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:09:17,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,836 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1] [2025-03-04 15:09:17,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:09:17,836 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 10 more)] === [2025-03-04 15:09:17,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,839 INFO L85 PathProgramCache]: Analyzing trace with hash 892236499, now seen corresponding path program 1 times [2025-03-04 15:09:17,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457553748] [2025-03-04 15:09:17,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:17,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:17,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:17,851 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:17,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:17,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:17,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:17,863 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:17,863 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 13 remaining) [2025-03-04 15:09:17,863 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 13 remaining) [2025-03-04 15:09:17,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:09:17,866 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-04 15:09:17,867 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:17,867 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:09:17,894 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:17,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 69 places, 74 transitions, 166 flow [2025-03-04 15:09:17,905 INFO L124 PetriNetUnfolderBase]: 12/82 cut-off events. [2025-03-04 15:09:17,905 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:09:17,906 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95 conditions, 82 events. 12/82 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 273 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 69. Up to 4 conditions per place. [2025-03-04 15:09:17,906 INFO L82 GeneralOperation]: Start removeDead. Operand has 69 places, 74 transitions, 166 flow [2025-03-04 15:09:17,907 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 69 places, 74 transitions, 166 flow [2025-03-04 15:09:17,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:17,908 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;@4aa71240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:17,908 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2025-03-04 15:09:17,911 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:17,911 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:09:17,911 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:09:17,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:17,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:09:17,911 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:17,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:17,912 INFO L85 PathProgramCache]: Analyzing trace with hash 320344151, now seen corresponding path program 1 times [2025-03-04 15:09:17,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:17,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115951495] [2025-03-04 15:09:17,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:17,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:17,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:09:17,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:09:17,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:17,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:17,957 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:09:17,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115951495] [2025-03-04 15:09:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115951495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:17,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:17,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642788544] [2025-03-04 15:09:17,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:17,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:17,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:17,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:17,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:17,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:17,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 74 transitions, 166 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:17,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:17,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:17,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:18,616 INFO L124 PetriNetUnfolderBase]: 5317/9887 cut-off events. [2025-03-04 15:09:18,617 INFO L125 PetriNetUnfolderBase]: For 475/475 co-relation queries the response was YES. [2025-03-04 15:09:18,632 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17250 conditions, 9887 events. 5317/9887 cut-off events. For 475/475 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 80961 event pairs, 806 based on Foata normal form. 1648/10785 useless extension candidates. Maximal degree in co-relation 6526. Up to 5693 conditions per place. [2025-03-04 15:09:18,671 INFO L140 encePairwiseOnDemand]: 64/74 looper letters, 49 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2025-03-04 15:09:18,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 86 transitions, 304 flow [2025-03-04 15:09:18,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:18,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:18,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2025-03-04 15:09:18,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7612612612612613 [2025-03-04 15:09:18,673 INFO L175 Difference]: Start difference. First operand has 69 places, 74 transitions, 166 flow. Second operand 3 states and 169 transitions. [2025-03-04 15:09:18,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 86 transitions, 304 flow [2025-03-04 15:09:18,674 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 86 transitions, 300 flow, removed 2 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:18,675 INFO L231 Difference]: Finished difference. Result has 69 places, 66 transitions, 152 flow [2025-03-04 15:09:18,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=152, PETRI_PLACES=69, PETRI_TRANSITIONS=66} [2025-03-04 15:09:18,675 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, 0 predicate places. [2025-03-04 15:09:18,675 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 66 transitions, 152 flow [2025-03-04 15:09:18,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:18,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:18,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:09:18,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:09:18,676 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:18,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:18,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1340734411, now seen corresponding path program 1 times [2025-03-04 15:09:18,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:18,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121184525] [2025-03-04 15:09:18,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:18,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:18,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:18,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:18,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:18,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:18,719 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:09:18,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:18,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121184525] [2025-03-04 15:09:18,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121184525] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:18,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:18,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:18,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997300318] [2025-03-04 15:09:18,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:18,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:18,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:18,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:18,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:18,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:18,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 66 transitions, 152 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:18,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:18,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:18,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:19,332 INFO L124 PetriNetUnfolderBase]: 4754/9105 cut-off events. [2025-03-04 15:09:19,333 INFO L125 PetriNetUnfolderBase]: For 671/671 co-relation queries the response was YES. [2025-03-04 15:09:19,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16026 conditions, 9105 events. 4754/9105 cut-off events. For 671/671 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 75359 event pairs, 806 based on Foata normal form. 219/8589 useless extension candidates. Maximal degree in co-relation 14380. Up to 4911 conditions per place. [2025-03-04 15:09:19,370 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 48 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-04 15:09:19,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 85 transitions, 300 flow [2025-03-04 15:09:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:19,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-04 15:09:19,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-03-04 15:09:19,371 INFO L175 Difference]: Start difference. First operand has 69 places, 66 transitions, 152 flow. Second operand 3 states and 156 transitions. [2025-03-04 15:09:19,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 85 transitions, 300 flow [2025-03-04 15:09:19,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:19,374 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 150 flow [2025-03-04 15:09:19,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-04 15:09:19,375 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-03-04 15:09:19,375 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 150 flow [2025-03-04 15:09:19,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:09:19,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:19,375 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:19,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:09:19,376 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:19,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash -77436596, now seen corresponding path program 1 times [2025-03-04 15:09:19,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:19,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704120120] [2025-03-04 15:09:19,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:19,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:09:19,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:09:19,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,406 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:09:19,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:19,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704120120] [2025-03-04 15:09:19,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704120120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:19,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:19,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315251415] [2025-03-04 15:09:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:19,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:19,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:19,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:19,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:19,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:19,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 150 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:09:19,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:19,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:19,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:19,847 INFO L124 PetriNetUnfolderBase]: 5320/9847 cut-off events. [2025-03-04 15:09:19,848 INFO L125 PetriNetUnfolderBase]: For 751/751 co-relation queries the response was YES. [2025-03-04 15:09:19,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17622 conditions, 9847 events. 5320/9847 cut-off events. For 751/751 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 79938 event pairs, 824 based on Foata normal form. 216/9359 useless extension candidates. Maximal degree in co-relation 12822. Up to 5648 conditions per place. [2025-03-04 15:09:19,935 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 48 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2025-03-04 15:09:19,935 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 83 transitions, 295 flow [2025-03-04 15:09:19,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2025-03-04 15:09:19,937 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7027027027027027 [2025-03-04 15:09:19,937 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 150 flow. Second operand 3 states and 156 transitions. [2025-03-04 15:09:19,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 83 transitions, 295 flow [2025-03-04 15:09:19,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 83 transitions, 287 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:19,941 INFO L231 Difference]: Finished difference. Result has 67 places, 64 transitions, 148 flow [2025-03-04 15:09:19,941 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=67, PETRI_TRANSITIONS=64} [2025-03-04 15:09:19,942 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -2 predicate places. [2025-03-04 15:09:19,943 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 64 transitions, 148 flow [2025-03-04 15:09:19,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:09:19,943 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:19,943 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:19,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:09:19,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:19,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:19,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1894433164, now seen corresponding path program 1 times [2025-03-04 15:09:19,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:19,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105887990] [2025-03-04 15:09:19,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:19,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:19,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:19,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,980 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:09:19,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:19,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105887990] [2025-03-04 15:09:19,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105887990] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:19,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:19,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:19,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658874061] [2025-03-04 15:09:19,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:19,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:19,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:19,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:19,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:19,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:19,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 64 transitions, 148 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:09:19,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:19,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:19,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:20,434 INFO L124 PetriNetUnfolderBase]: 4718/8669 cut-off events. [2025-03-04 15:09:20,434 INFO L125 PetriNetUnfolderBase]: For 664/664 co-relation queries the response was YES. [2025-03-04 15:09:20,449 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15584 conditions, 8669 events. 4718/8669 cut-off events. For 664/664 co-relation queries the response was YES. Maximal size of possible extension queue 488. Compared 67291 event pairs, 1400 based on Foata normal form. 216/8157 useless extension candidates. Maximal degree in co-relation 7276. Up to 4872 conditions per place. [2025-03-04 15:09:20,479 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 47 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-03-04 15:09:20,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 82 transitions, 287 flow [2025-03-04 15:09:20,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:20,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:20,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 15:09:20,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-03-04 15:09:20,481 INFO L175 Difference]: Start difference. First operand has 67 places, 64 transitions, 148 flow. Second operand 3 states and 155 transitions. [2025-03-04 15:09:20,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 82 transitions, 287 flow [2025-03-04 15:09:20,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 82 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:20,483 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 146 flow [2025-03-04 15:09:20,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2025-03-04 15:09:20,484 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-03-04 15:09:20,484 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 146 flow [2025-03-04 15:09:20,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 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:09:20,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:20,484 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:20,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:09:20,484 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:20,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:20,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1376690882, now seen corresponding path program 1 times [2025-03-04 15:09:20,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:20,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699800698] [2025-03-04 15:09:20,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:20,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:20,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:20,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:20,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:20,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,558 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:09:20,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:20,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699800698] [2025-03-04 15:09:20,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699800698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:20,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:20,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:09:20,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265202928] [2025-03-04 15:09:20,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:20,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:20,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:20,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:20,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:20,566 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:20,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:09:20,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:20,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:20,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:21,190 INFO L124 PetriNetUnfolderBase]: 5212/9269 cut-off events. [2025-03-04 15:09:21,191 INFO L125 PetriNetUnfolderBase]: For 745/745 co-relation queries the response was YES. [2025-03-04 15:09:21,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17047 conditions, 9269 events. 5212/9269 cut-off events. For 745/745 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 71575 event pairs, 1880 based on Foata normal form. 219/8564 useless extension candidates. Maximal degree in co-relation 16694. Up to 4129 conditions per place. [2025-03-04 15:09:21,231 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 67 selfloop transitions, 4 changer transitions 0/102 dead transitions. [2025-03-04 15:09:21,231 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 102 transitions, 394 flow [2025-03-04 15:09:21,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2025-03-04 15:09:21,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2025-03-04 15:09:21,232 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 146 flow. Second operand 4 states and 212 transitions. [2025-03-04 15:09:21,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 102 transitions, 394 flow [2025-03-04 15:09:21,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 102 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:21,238 INFO L231 Difference]: Finished difference. Result has 66 places, 62 transitions, 148 flow [2025-03-04 15:09:21,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=66, PETRI_TRANSITIONS=62} [2025-03-04 15:09:21,239 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -3 predicate places. [2025-03-04 15:09:21,239 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 62 transitions, 148 flow [2025-03-04 15:09:21,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:09:21,239 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:21,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:21,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:09:21,240 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:21,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:21,240 INFO L85 PathProgramCache]: Analyzing trace with hash 272255953, now seen corresponding path program 1 times [2025-03-04 15:09:21,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:21,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523887105] [2025-03-04 15:09:21,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:21,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:21,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:09:21,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:09:21,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:21,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:21,306 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:09:21,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:21,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523887105] [2025-03-04 15:09:21,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523887105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:21,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:21,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:09:21,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685802654] [2025-03-04 15:09:21,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:21,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:21,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:21,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:21,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:21,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:21,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 62 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:09:21,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:21,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:21,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:22,010 INFO L124 PetriNetUnfolderBase]: 8962/16346 cut-off events. [2025-03-04 15:09:22,010 INFO L125 PetriNetUnfolderBase]: For 1763/1763 co-relation queries the response was YES. [2025-03-04 15:09:22,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30244 conditions, 16346 events. 8962/16346 cut-off events. For 1763/1763 co-relation queries the response was YES. Maximal size of possible extension queue 734. Compared 139609 event pairs, 4390 based on Foata normal form. 219/15186 useless extension candidates. Maximal degree in co-relation 14374. Up to 7261 conditions per place. [2025-03-04 15:09:22,079 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 74 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-03-04 15:09:22,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 109 transitions, 424 flow [2025-03-04 15:09:22,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:22,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:22,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-03-04 15:09:22,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7398648648648649 [2025-03-04 15:09:22,081 INFO L175 Difference]: Start difference. First operand has 66 places, 62 transitions, 148 flow. Second operand 4 states and 219 transitions. [2025-03-04 15:09:22,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 109 transitions, 424 flow [2025-03-04 15:09:22,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 109 transitions, 410 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:09:22,099 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 167 flow [2025-03-04 15:09:22,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=167, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2025-03-04 15:09:22,100 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-03-04 15:09:22,100 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 167 flow [2025-03-04 15:09:22,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 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:09:22,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:22,100 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:22,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:09:22,100 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:22,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,101 INFO L85 PathProgramCache]: Analyzing trace with hash -569874120, now seen corresponding path program 1 times [2025-03-04 15:09:22,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579027177] [2025-03-04 15:09:22,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,105 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:09:22,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:09:22,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,129 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:09:22,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:22,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579027177] [2025-03-04 15:09:22,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579027177] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:22,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:22,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:22,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608498036] [2025-03-04 15:09:22,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:22,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:22,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:22,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:22,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:22,136 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-03-04 15:09:22,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:09:22,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:22,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-03-04 15:09:22,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:22,859 INFO L124 PetriNetUnfolderBase]: 9388/17039 cut-off events. [2025-03-04 15:09:22,860 INFO L125 PetriNetUnfolderBase]: For 3114/3258 co-relation queries the response was YES. [2025-03-04 15:09:22,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32358 conditions, 17039 events. 9388/17039 cut-off events. For 3114/3258 co-relation queries the response was YES. Maximal size of possible extension queue 791. Compared 145965 event pairs, 1970 based on Foata normal form. 336/16234 useless extension candidates. Maximal degree in co-relation 18871. Up to 9128 conditions per place. [2025-03-04 15:09:22,946 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 53 selfloop transitions, 2 changer transitions 0/85 dead transitions. [2025-03-04 15:09:22,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 85 transitions, 336 flow [2025-03-04 15:09:22,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:22,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:22,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2025-03-04 15:09:22,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2025-03-04 15:09:22,947 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 167 flow. Second operand 3 states and 155 transitions. [2025-03-04 15:09:22,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 85 transitions, 336 flow [2025-03-04 15:09:22,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 85 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:22,951 INFO L231 Difference]: Finished difference. Result has 68 places, 64 transitions, 166 flow [2025-03-04 15:09:22,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=68, PETRI_TRANSITIONS=64} [2025-03-04 15:09:22,951 INFO L279 CegarLoopForPetriNet]: 69 programPoint places, -1 predicate places. [2025-03-04 15:09:22,951 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 64 transitions, 166 flow [2025-03-04 15:09:22,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 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:09:22,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:22,952 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1, 1, 1, 1] [2025-03-04 15:09:22,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:09:22,952 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 15:09:22,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,952 INFO L85 PathProgramCache]: Analyzing trace with hash -486240761, now seen corresponding path program 1 times [2025-03-04 15:09:22,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840707908] [2025-03-04 15:09:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:09:22,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:09:22,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:22,959 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:22,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-04 15:09:22,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-04 15:09:22,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:22,966 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:22,966 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 17 remaining) [2025-03-04 15:09:22,966 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 17 remaining) [2025-03-04 15:09:22,967 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 17 remaining) [2025-03-04 15:09:22,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:09:22,967 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:22,967 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:22,967 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 15:09:22,992 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:22,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 90 places, 97 transitions, 222 flow [2025-03-04 15:09:22,999 INFO L124 PetriNetUnfolderBase]: 16/108 cut-off events. [2025-03-04 15:09:22,999 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:09:22,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 108 events. 16/108 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 377 event pairs, 0 based on Foata normal form. 0/71 useless extension candidates. Maximal degree in co-relation 94. Up to 5 conditions per place. [2025-03-04 15:09:22,999 INFO L82 GeneralOperation]: Start removeDead. Operand has 90 places, 97 transitions, 222 flow [2025-03-04 15:09:23,000 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 90 places, 97 transitions, 222 flow [2025-03-04 15:09:23,001 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:23,001 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;@4aa71240, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:23,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-03-04 15:09:23,002 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:23,002 INFO L124 PetriNetUnfolderBase]: 0/9 cut-off events. [2025-03-04 15:09:23,002 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 15:09:23,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:23,002 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 15:09:23,002 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:09:23,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:23,002 INFO L85 PathProgramCache]: Analyzing trace with hash 412933582, now seen corresponding path program 1 times [2025-03-04 15:09:23,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:23,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403349691] [2025-03-04 15:09:23,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:23,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:23,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 15:09:23,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 15:09:23,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:23,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,027 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:09:23,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:23,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403349691] [2025-03-04 15:09:23,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403349691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:23,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:23,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:23,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094447303] [2025-03-04 15:09:23,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:23,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:23,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:23,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:23,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:23,035 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:09:23,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:23,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:23,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:09:23,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:27,568 INFO L124 PetriNetUnfolderBase]: 58261/94975 cut-off events. [2025-03-04 15:09:27,569 INFO L125 PetriNetUnfolderBase]: For 6417/6417 co-relation queries the response was YES. [2025-03-04 15:09:27,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170307 conditions, 94975 events. 58261/94975 cut-off events. For 6417/6417 co-relation queries the response was YES. Maximal size of possible extension queue 4010. Compared 897942 event pairs, 9510 based on Foata normal form. 19220/107997 useless extension candidates. Maximal degree in co-relation 30712. Up to 57853 conditions per place. [2025-03-04 15:09:28,130 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 67 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2025-03-04 15:09:28,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 116 transitions, 419 flow [2025-03-04 15:09:28,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:28,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 227 transitions. [2025-03-04 15:09:28,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7800687285223368 [2025-03-04 15:09:28,131 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 222 flow. Second operand 3 states and 227 transitions. [2025-03-04 15:09:28,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 116 transitions, 419 flow [2025-03-04 15:09:28,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 116 transitions, 407 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:28,136 INFO L231 Difference]: Finished difference. Result has 90 places, 87 transitions, 200 flow [2025-03-04 15:09:28,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=90, PETRI_TRANSITIONS=87} [2025-03-04 15:09:28,138 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, 0 predicate places. [2025-03-04 15:09:28,138 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 87 transitions, 200 flow [2025-03-04 15:09:28,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:28,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:28,138 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-03-04 15:09:28,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:09:28,138 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:09:28,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:28,138 INFO L85 PathProgramCache]: Analyzing trace with hash -83960405, now seen corresponding path program 1 times [2025-03-04 15:09:28,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:28,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055032379] [2025-03-04 15:09:28,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:28,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:28,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:28,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:28,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:28,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:28,174 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:09:28,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:28,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055032379] [2025-03-04 15:09:28,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055032379] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:28,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:28,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669442078] [2025-03-04 15:09:28,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:28,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:28,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:28,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:28,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:28,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:09:28,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 87 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:28,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:28,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:09:28,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:32,859 INFO L124 PetriNetUnfolderBase]: 52002/86961 cut-off events. [2025-03-04 15:09:32,859 INFO L125 PetriNetUnfolderBase]: For 5479/5479 co-relation queries the response was YES. [2025-03-04 15:09:33,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156347 conditions, 86961 events. 52002/86961 cut-off events. For 5479/5479 co-relation queries the response was YES. Maximal size of possible extension queue 3680. Compared 838066 event pairs, 9510 based on Foata normal form. 1755/82605 useless extension candidates. Maximal degree in co-relation 140780. Up to 49839 conditions per place. [2025-03-04 15:09:33,492 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 66 selfloop transitions, 2 changer transitions 0/115 dead transitions. [2025-03-04 15:09:33,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 115 transitions, 407 flow [2025-03-04 15:09:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:33,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:33,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-04 15:09:33,493 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2025-03-04 15:09:33,493 INFO L175 Difference]: Start difference. First operand has 90 places, 87 transitions, 200 flow. Second operand 3 states and 210 transitions. [2025-03-04 15:09:33,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 115 transitions, 407 flow [2025-03-04 15:09:33,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 115 transitions, 403 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:33,503 INFO L231 Difference]: Finished difference. Result has 89 places, 86 transitions, 198 flow [2025-03-04 15:09:33,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=89, PETRI_TRANSITIONS=86} [2025-03-04 15:09:33,504 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -1 predicate places. [2025-03-04 15:09:33,505 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 86 transitions, 198 flow [2025-03-04 15:09:33,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:33,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:33,505 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:33,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:09:33,505 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:09:33,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:33,505 INFO L85 PathProgramCache]: Analyzing trace with hash 864443596, now seen corresponding path program 1 times [2025-03-04 15:09:33,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:33,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657264436] [2025-03-04 15:09:33,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:33,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:33,510 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:09:33,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:09:33,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:33,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:33,537 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:09:33,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:33,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657264436] [2025-03-04 15:09:33,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657264436] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:33,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:33,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:33,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930145317] [2025-03-04 15:09:33,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:33,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:33,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:33,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:33,546 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:09:33,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 86 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:09:33,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:33,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:09:33,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:38,617 INFO L124 PetriNetUnfolderBase]: 57886/92803 cut-off events. [2025-03-04 15:09:38,617 INFO L125 PetriNetUnfolderBase]: For 6269/6269 co-relation queries the response was YES. [2025-03-04 15:09:38,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170851 conditions, 92803 events. 57886/92803 cut-off events. For 6269/6269 co-relation queries the response was YES. Maximal size of possible extension queue 4059. Compared 842456 event pairs, 23016 based on Foata normal form. 1752/87314 useless extension candidates. Maximal degree in co-relation 125149. Up to 57808 conditions per place. [2025-03-04 15:09:39,129 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 66 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-04 15:09:39,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 113 transitions, 402 flow [2025-03-04 15:09:39,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:39,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 210 transitions. [2025-03-04 15:09:39,130 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7216494845360825 [2025-03-04 15:09:39,130 INFO L175 Difference]: Start difference. First operand has 89 places, 86 transitions, 198 flow. Second operand 3 states and 210 transitions. [2025-03-04 15:09:39,130 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 113 transitions, 402 flow [2025-03-04 15:09:39,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 113 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:39,145 INFO L231 Difference]: Finished difference. Result has 88 places, 85 transitions, 196 flow [2025-03-04 15:09:39,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=88, PETRI_TRANSITIONS=85} [2025-03-04 15:09:39,145 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -2 predicate places. [2025-03-04 15:09:39,145 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 85 transitions, 196 flow [2025-03-04 15:09:39,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:09:39,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:39,145 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:39,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:09:39,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:09:39,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:39,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1027948163, now seen corresponding path program 1 times [2025-03-04 15:09:39,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:39,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064964181] [2025-03-04 15:09:39,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:39,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:39,150 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:39,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:39,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:39,151 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:39,170 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:09:39,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:39,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064964181] [2025-03-04 15:09:39,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064964181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:39,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:39,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:39,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068259954] [2025-03-04 15:09:39,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:39,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:39,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:39,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:39,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:39,176 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-03-04 15:09:39,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 85 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:09:39,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:39,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-03-04 15:09:39,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:43,718 INFO L124 PetriNetUnfolderBase]: 51412/82771 cut-off events. [2025-03-04 15:09:43,719 INFO L125 PetriNetUnfolderBase]: For 5600/5600 co-relation queries the response was YES. [2025-03-04 15:09:43,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152151 conditions, 82771 events. 51412/82771 cut-off events. For 5600/5600 co-relation queries the response was YES. Maximal size of possible extension queue 3597. Compared 743915 event pairs, 20568 based on Foata normal form. 1752/77997 useless extension candidates. Maximal degree in co-relation 72464. Up to 49800 conditions per place. [2025-03-04 15:09:44,210 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 65 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2025-03-04 15:09:44,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 112 transitions, 394 flow [2025-03-04 15:09:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:44,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:44,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 209 transitions. [2025-03-04 15:09:44,211 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.718213058419244 [2025-03-04 15:09:44,211 INFO L175 Difference]: Start difference. First operand has 88 places, 85 transitions, 196 flow. Second operand 3 states and 209 transitions. [2025-03-04 15:09:44,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 112 transitions, 394 flow [2025-03-04 15:09:44,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 112 transitions, 390 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:44,217 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 194 flow [2025-03-04 15:09:44,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=194, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-04 15:09:44,218 INFO L279 CegarLoopForPetriNet]: 90 programPoint places, -3 predicate places. [2025-03-04 15:09:44,218 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 194 flow [2025-03-04 15:09:44,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 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:09:44,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:44,218 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:44,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:09:44,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 18 more)] === [2025-03-04 15:09:44,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:44,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1593017099, now seen corresponding path program 1 times [2025-03-04 15:09:44,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:44,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425724548] [2025-03-04 15:09:44,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:44,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:44,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:44,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:44,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:44,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:44,290 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:09:44,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:44,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425724548] [2025-03-04 15:09:44,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425724548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:44,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:44,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:09:44,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314255013] [2025-03-04 15:09:44,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:44,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:09:44,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:44,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:09:44,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:09:44,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-03-04 15:09:44,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 194 flow. Second operand has 5 states, 5 states have (on average 46.4) internal successors, (232), 5 states have internal predecessors, (232), 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:09:44,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:44,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-03-04 15:09:44,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand