./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.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.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 ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:09:16,244 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:09:16,296 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:16,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:09:16,305 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:09:16,323 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:09:16,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:09:16,324 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:09:16,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:09:16,325 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:09:16,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:09:16,325 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:09:16,325 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:09:16,325 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:09:16,326 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:09:16,326 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:09:16,326 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:09:16,326 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:09:16,327 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:09:16,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:16,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:09:16,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:09:16,328 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 -> ec355916cf6ee76d4008e84bb2b3ecc632256e3b320d2f47b453f4ca1f46acbc [2025-03-04 15:09:16,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:09:16,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:09:16,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:09:16,556 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:09:16,556 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:09:16,557 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-04 15:09:17,634 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052612b4f/580ac42848b240f393bd13cae26ccf0b/FLAG8268ca81d [2025-03-04 15:09:17,973 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:09:17,974 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-ext/11_fmaxsymopt.i [2025-03-04 15:09:17,986 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052612b4f/580ac42848b240f393bd13cae26ccf0b/FLAG8268ca81d [2025-03-04 15:09:18,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/052612b4f/580ac42848b240f393bd13cae26ccf0b [2025-03-04 15:09:18,210 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:09:18,211 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:09:18,212 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:18,212 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:09:18,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:09:18,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:18" (1/1) ... [2025-03-04 15:09:18,216 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7072137e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:18, skipping insertion in model container [2025-03-04 15:09:18,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:09:18" (1/1) ... [2025-03-04 15:09:18,236 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:09:18,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:18,441 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:09:18,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:09:18,499 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:09:18,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:18 WrapperNode [2025-03-04 15:09:18,500 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:09:18,501 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:18,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:09:18,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:09:18,505 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:18" (1/1) ... [2025-03-04 15:09:18,513 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:18" (1/1) ... [2025-03-04 15:09:18,527 INFO L138 Inliner]: procedures = 164, calls = 29, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 97 [2025-03-04 15:09:18,527 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:09:18,528 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:09:18,528 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:09:18,528 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:09:18,534 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:18" (1/1) ... [2025-03-04 15:09:18,534 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:18" (1/1) ... [2025-03-04 15:09:18,536 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:18" (1/1) ... [2025-03-04 15:09:18,547 INFO L175 MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 5, 8]. 53 percent of accesses are in the largest equivalence class. The 13 initializations are split as follows [2, 5, 6]. The 1 writes are split as follows [0, 0, 1]. [2025-03-04 15:09:18,548 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:18" (1/1) ... [2025-03-04 15:09:18,548 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:18" (1/1) ... [2025-03-04 15:09:18,557 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:18" (1/1) ... [2025-03-04 15:09:18,562 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:18" (1/1) ... [2025-03-04 15:09:18,563 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:18" (1/1) ... [2025-03-04 15:09:18,563 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:18" (1/1) ... [2025-03-04 15:09:18,565 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:09:18,569 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:09:18,569 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:09:18,569 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:09:18,570 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:18" (1/1) ... [2025-03-04 15:09:18,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:09:18,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:18,596 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:18,599 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:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-03-04 15:09:18,618 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:09:18,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:09:18,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:09:18,619 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:18,702 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:09:18,704 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:09:18,873 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:09:18,873 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:09:19,010 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:09:19,011 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:09:19,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:19 BoogieIcfgContainer [2025-03-04 15:09:19,012 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:09:19,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:09:19,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:09:19,019 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:09:19,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:09:18" (1/3) ... [2025-03-04 15:09:19,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5fba5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:19, skipping insertion in model container [2025-03-04 15:09:19,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:09:18" (2/3) ... [2025-03-04 15:09:19,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5fba5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:09:19, skipping insertion in model container [2025-03-04 15:09:19,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:09:19" (3/3) ... [2025-03-04 15:09:19,021 INFO L128 eAbstractionObserver]: Analyzing ICFG 11_fmaxsymopt.i [2025-03-04 15:09:19,032 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:09:19,034 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 11_fmaxsymopt.i that has 2 procedures, 32 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-03-04 15:09:19,035 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:09:19,081 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:19,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 35 places, 37 transitions, 78 flow [2025-03-04 15:09:19,123 INFO L124 PetriNetUnfolderBase]: 5/39 cut-off events. [2025-03-04 15:09:19,126 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:19,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43 conditions, 39 events. 5/39 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 79 event pairs, 0 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 28. Up to 2 conditions per place. [2025-03-04 15:09:19,130 INFO L82 GeneralOperation]: Start removeDead. Operand has 35 places, 37 transitions, 78 flow [2025-03-04 15:09:19,133 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 35 places, 37 transitions, 78 flow [2025-03-04 15:09:19,140 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:19,152 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;@591b77e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:19,153 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-03-04 15:09:19,157 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:19,158 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:19,158 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:19,158 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:19,158 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:19,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:19,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:19,164 INFO L85 PathProgramCache]: Analyzing trace with hash 258402, now seen corresponding path program 1 times [2025-03-04 15:09:19,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:19,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633886947] [2025-03-04 15:09:19,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:19,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:19,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:19,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,344 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,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:19,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633886947] [2025-03-04 15:09:19,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633886947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:19,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:19,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:19,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042057834] [2025-03-04 15:09:19,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:19,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:19,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:19,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:19,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:19,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 15:09:19,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 37 transitions, 78 flow. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:19,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:19,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 15:09:19,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:19,471 INFO L124 PetriNetUnfolderBase]: 23/93 cut-off events. [2025-03-04 15:09:19,471 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:19,472 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158 conditions, 93 events. 23/93 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 256 event pairs, 18 based on Foata normal form. 8/87 useless extension candidates. Maximal degree in co-relation 127. Up to 59 conditions per place. [2025-03-04 15:09:19,473 INFO L140 encePairwiseOnDemand]: 28/37 looper letters, 18 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2025-03-04 15:09:19,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 36 transitions, 118 flow [2025-03-04 15:09:19,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:19,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2025-03-04 15:09:19,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2025-03-04 15:09:19,505 INFO L175 Difference]: Start difference. First operand has 35 places, 37 transitions, 78 flow. Second operand 4 states and 87 transitions. [2025-03-04 15:09:19,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 36 transitions, 118 flow [2025-03-04 15:09:19,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 36 transitions, 118 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:19,511 INFO L231 Difference]: Finished difference. Result has 39 places, 36 transitions, 96 flow [2025-03-04 15:09:19,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=96, PETRI_PLACES=39, PETRI_TRANSITIONS=36} [2025-03-04 15:09:19,517 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 4 predicate places. [2025-03-04 15:09:19,517 INFO L471 AbstractCegarLoop]: Abstraction has has 39 places, 36 transitions, 96 flow [2025-03-04 15:09:19,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:09:19,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:19,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:19,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:09:19,518 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:19,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:19,518 INFO L85 PathProgramCache]: Analyzing trace with hash -891672180, now seen corresponding path program 1 times [2025-03-04 15:09:19,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:19,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025401969] [2025-03-04 15:09:19,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:19,531 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:19,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:19,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:19,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:19,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025401969] [2025-03-04 15:09:19,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025401969] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:19,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201039601] [2025-03-04 15:09:19,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:19,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:19,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:19,642 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:19,643 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:09:19,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:19,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:19,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:19,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:19,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:19,709 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:19,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:19,746 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:19,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201039601] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:19,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:19,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:19,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165824911] [2025-03-04 15:09:19,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:19,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:19,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:19,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:19,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:19,755 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 15:09:19,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 36 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:19,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 15:09:19,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:19,843 INFO L124 PetriNetUnfolderBase]: 23/92 cut-off events. [2025-03-04 15:09:19,844 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:09:19,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 168 conditions, 92 events. 23/92 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 250 event pairs, 18 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 150. Up to 54 conditions per place. [2025-03-04 15:09:19,845 INFO L140 encePairwiseOnDemand]: 32/37 looper letters, 14 selfloop transitions, 6 changer transitions 0/35 dead transitions. [2025-03-04 15:09:19,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 35 transitions, 132 flow [2025-03-04 15:09:19,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:19,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:19,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 111 transitions. [2025-03-04 15:09:19,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-03-04 15:09:19,848 INFO L175 Difference]: Start difference. First operand has 39 places, 36 transitions, 96 flow. Second operand 6 states and 111 transitions. [2025-03-04 15:09:19,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 35 transitions, 132 flow [2025-03-04 15:09:19,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 35 transitions, 130 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:19,849 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 102 flow [2025-03-04 15:09:19,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=102, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-03-04 15:09:19,850 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 15:09:19,850 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 102 flow [2025-03-04 15:09:19,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 6 states have internal predecessors, (95), 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,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:19,850 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:09:19,857 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:09:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:20,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1872033596, now seen corresponding path program 1 times [2025-03-04 15:09:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283734716] [2025-03-04 15:09:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:20,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:09:20,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:09:20,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:20,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:20,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:20,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283734716] [2025-03-04 15:09:20,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283734716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:20,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:20,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:20,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854092764] [2025-03-04 15:09:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:20,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:20,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:20,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:20,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 15:09:20,111 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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,111 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:20,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 15:09:20,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:20,150 INFO L124 PetriNetUnfolderBase]: 23/91 cut-off events. [2025-03-04 15:09:20,150 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:09:20,151 INFO L83 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 91 events. 23/91 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 244 event pairs, 18 based on Foata normal form. 1/79 useless extension candidates. Maximal degree in co-relation 146. Up to 57 conditions per place. [2025-03-04 15:09:20,151 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 15 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-03-04 15:09:20,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 34 transitions, 136 flow [2025-03-04 15:09:20,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:20,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:20,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2025-03-04 15:09:20,152 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5675675675675675 [2025-03-04 15:09:20,152 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 102 flow. Second operand 3 states and 63 transitions. [2025-03-04 15:09:20,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 34 transitions, 136 flow [2025-03-04 15:09:20,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 34 transitions, 114 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:20,153 INFO L231 Difference]: Finished difference. Result has 37 places, 34 transitions, 84 flow [2025-03-04 15:09:20,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=34} [2025-03-04 15:09:20,155 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 2 predicate places. [2025-03-04 15:09:20,155 INFO L471 AbstractCegarLoop]: Abstraction has has 37 places, 34 transitions, 84 flow [2025-03-04 15:09:20,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:20,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:20,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:09:20,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:20,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:20,155 INFO L85 PathProgramCache]: Analyzing trace with hash 567437145, now seen corresponding path program 1 times [2025-03-04 15:09:20,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:20,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415895122] [2025-03-04 15:09:20,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:20,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:20,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:20,169 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,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:20,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:20,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:20,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415895122] [2025-03-04 15:09:20,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415895122] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:20,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318053388] [2025-03-04 15:09:20,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:20,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:20,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:20,233 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:20,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:09:20,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:20,285 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,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:20,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:20,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:20,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:20,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:20,322 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:20,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318053388] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:20,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:20,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:09:20,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399344610] [2025-03-04 15:09:20,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:20,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:20,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:20,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:20,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 15:09:20,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 34 transitions, 84 flow. Second operand has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 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,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:20,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 15:09:20,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:20,408 INFO L124 PetriNetUnfolderBase]: 23/95 cut-off events. [2025-03-04 15:09:20,408 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-04 15:09:20,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 95 events. 23/95 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 241 event pairs, 18 based on Foata normal form. 2/85 useless extension candidates. Maximal degree in co-relation 139. Up to 55 conditions per place. [2025-03-04 15:09:20,409 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 15 selfloop transitions, 7 changer transitions 0/37 dead transitions. [2025-03-04 15:09:20,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 37 transitions, 143 flow [2025-03-04 15:09:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:20,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:20,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2025-03-04 15:09:20,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4980694980694981 [2025-03-04 15:09:20,410 INFO L175 Difference]: Start difference. First operand has 37 places, 34 transitions, 84 flow. Second operand 7 states and 129 transitions. [2025-03-04 15:09:20,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 37 transitions, 143 flow [2025-03-04 15:09:20,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 129 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:20,412 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 110 flow [2025-03-04 15:09:20,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=110, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2025-03-04 15:09:20,413 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 8 predicate places. [2025-03-04 15:09:20,413 INFO L471 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 110 flow [2025-03-04 15:09:20,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.4) internal successors, (164), 10 states have internal predecessors, (164), 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,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:20,414 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:20,421 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:09:20,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 15:09:20,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:20,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:20,615 INFO L85 PathProgramCache]: Analyzing trace with hash 697937689, now seen corresponding path program 2 times [2025-03-04 15:09:20,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:20,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579839905] [2025-03-04 15:09:20,616 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:20,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:20,626 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:09:20,633 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:09:20,633 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:20,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,668 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:20,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:20,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579839905] [2025-03-04 15:09:20,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579839905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:20,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:20,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:20,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136131187] [2025-03-04 15:09:20,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:20,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:20,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:20,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:20,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:20,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 15:09:20,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:20,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 15:09:20,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:20,741 INFO L124 PetriNetUnfolderBase]: 27/104 cut-off events. [2025-03-04 15:09:20,741 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-03-04 15:09:20,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 104 events. 27/104 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 253 event pairs, 2 based on Foata normal form. 3/101 useless extension candidates. Maximal degree in co-relation 155. Up to 48 conditions per place. [2025-03-04 15:09:20,742 INFO L140 encePairwiseOnDemand]: 34/37 looper letters, 23 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2025-03-04 15:09:20,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 38 transitions, 162 flow [2025-03-04 15:09:20,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:20,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:20,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-03-04 15:09:20,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5945945945945946 [2025-03-04 15:09:20,743 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 110 flow. Second operand 3 states and 66 transitions. [2025-03-04 15:09:20,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 38 transitions, 162 flow [2025-03-04 15:09:20,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 38 transitions, 158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:20,744 INFO L231 Difference]: Finished difference. Result has 42 places, 36 transitions, 108 flow [2025-03-04 15:09:20,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=36} [2025-03-04 15:09:20,744 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 7 predicate places. [2025-03-04 15:09:20,744 INFO L471 AbstractCegarLoop]: Abstraction has has 42 places, 36 transitions, 108 flow [2025-03-04 15:09:20,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 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,744 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:20,744 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:20,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:09:20,744 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:20,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:20,745 INFO L85 PathProgramCache]: Analyzing trace with hash 161212898, now seen corresponding path program 1 times [2025-03-04 15:09:20,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:20,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999000276] [2025-03-04 15:09:20,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:20,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:20,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:20,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:20,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:20,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:20,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999000276] [2025-03-04 15:09:20,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999000276] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:20,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617586738] [2025-03-04 15:09:20,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:20,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:20,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:20,846 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:20,848 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:09:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:20,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:20,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:20,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:20,905 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:09:20,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:20,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:20,940 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:21,012 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:21,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617586738] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:21,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:21,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:09:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353009142] [2025-03-04 15:09:21,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:21,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:09:21,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:21,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:09:21,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:09:21,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 15 out of 37 [2025-03-04 15:09:21,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 36 transitions, 108 flow. Second operand has 15 states, 15 states have (on average 16.333333333333332) internal successors, (245), 15 states have internal predecessors, (245), 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,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:21,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 15 of 37 [2025-03-04 15:09:21,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:21,148 INFO L124 PetriNetUnfolderBase]: 23/103 cut-off events. [2025-03-04 15:09:21,148 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-03-04 15:09:21,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 103 events. 23/103 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 235 event pairs, 18 based on Foata normal form. 3/95 useless extension candidates. Maximal degree in co-relation 146. Up to 55 conditions per place. [2025-03-04 15:09:21,149 INFO L140 encePairwiseOnDemand]: 33/37 looper letters, 15 selfloop transitions, 13 changer transitions 0/42 dead transitions. [2025-03-04 15:09:21,149 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 42 transitions, 200 flow [2025-03-04 15:09:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:09:21,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:09:21,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 226 transitions. [2025-03-04 15:09:21,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4698544698544699 [2025-03-04 15:09:21,150 INFO L175 Difference]: Start difference. First operand has 42 places, 36 transitions, 108 flow. Second operand 13 states and 226 transitions. [2025-03-04 15:09:21,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 42 transitions, 200 flow [2025-03-04 15:09:21,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 42 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:21,152 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 181 flow [2025-03-04 15:09:21,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=37, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2025-03-04 15:09:21,152 INFO L279 CegarLoopForPetriNet]: 35 programPoint places, 20 predicate places. [2025-03-04 15:09:21,152 INFO L471 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 181 flow [2025-03-04 15:09:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 16.333333333333332) internal successors, (245), 15 states have internal predecessors, (245), 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,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:21,152 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:21,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:21,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:21,357 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 8 more)] === [2025-03-04 15:09:21,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash -249274952, now seen corresponding path program 2 times [2025-03-04 15:09:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735034653] [2025-03-04 15:09:21,358 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:21,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:21,366 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-03-04 15:09:21,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:09:21,380 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:09:21,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:21,381 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:21,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:09:21,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:09:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:21,410 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:21,411 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:21,411 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-03-04 15:09:21,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 11 remaining) [2025-03-04 15:09:21,412 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 11 remaining) [2025-03-04 15:09:21,413 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 11 remaining) [2025-03-04 15:09:21,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:09:21,414 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2025-03-04 15:09:21,415 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:21,415 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-04 15:09:21,435 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:21,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 59 places, 63 transitions, 136 flow [2025-03-04 15:09:21,440 INFO L124 PetriNetUnfolderBase]: 9/68 cut-off events. [2025-03-04 15:09:21,440 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:09:21,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 68 events. 9/68 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 203 event pairs, 0 based on Foata normal form. 0/46 useless extension candidates. Maximal degree in co-relation 53. Up to 3 conditions per place. [2025-03-04 15:09:21,441 INFO L82 GeneralOperation]: Start removeDead. Operand has 59 places, 63 transitions, 136 flow [2025-03-04 15:09:21,441 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 63 transitions, 136 flow [2025-03-04 15:09:21,442 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:21,442 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;@591b77e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:21,442 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-04 15:09:21,443 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:21,443 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:21,443 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:21,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:21,443 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:21,444 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash 320961, now seen corresponding path program 1 times [2025-03-04 15:09:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:21,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634049450] [2025-03-04 15:09:21,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:21,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:21,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:21,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:21,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:21,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:21,471 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,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:21,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634049450] [2025-03-04 15:09:21,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634049450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:21,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:21,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:21,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333415899] [2025-03-04 15:09:21,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:21,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:21,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:21,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:21,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:21,476 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:21,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 63 transitions, 136 flow. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:21,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:21,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:21,615 INFO L124 PetriNetUnfolderBase]: 545/1248 cut-off events. [2025-03-04 15:09:21,616 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-04 15:09:21,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2154 conditions, 1248 events. 545/1248 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7772 event pairs, 468 based on Foata normal form. 158/1259 useless extension candidates. Maximal degree in co-relation 1071. Up to 869 conditions per place. [2025-03-04 15:09:21,625 INFO L140 encePairwiseOnDemand]: 52/63 looper letters, 29 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2025-03-04 15:09:21,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 194 flow [2025-03-04 15:09:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2025-03-04 15:09:21,627 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6031746031746031 [2025-03-04 15:09:21,627 INFO L175 Difference]: Start difference. First operand has 59 places, 63 transitions, 136 flow. Second operand 4 states and 152 transitions. [2025-03-04 15:09:21,627 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 194 flow [2025-03-04 15:09:21,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:21,629 INFO L231 Difference]: Finished difference. Result has 63 places, 60 transitions, 150 flow [2025-03-04 15:09:21,629 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=63, PETRI_TRANSITIONS=60} [2025-03-04 15:09:21,630 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2025-03-04 15:09:21,630 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 60 transitions, 150 flow [2025-03-04 15:09:21,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:21,631 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:21,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 15:09:21,631 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:21,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:21,633 INFO L85 PathProgramCache]: Analyzing trace with hash 972085548, now seen corresponding path program 1 times [2025-03-04 15:09:21,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:21,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708738293] [2025-03-04 15:09:21,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:21,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:21,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:21,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:21,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:21,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:21,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708738293] [2025-03-04 15:09:21,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708738293] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:21,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407336768] [2025-03-04 15:09:21,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:21,680 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:21,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:21,681 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:21,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:09:21,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:21,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:21,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:21,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:21,738 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:21,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:21,766 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:21,766 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:21,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407336768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:21,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:21,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:21,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307183064] [2025-03-04 15:09:21,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:21,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:21,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:21,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:21,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:21,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:21,772 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 60 transitions, 150 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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,772 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:21,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:21,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:21,950 INFO L124 PetriNetUnfolderBase]: 545/1247 cut-off events. [2025-03-04 15:09:21,950 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-03-04 15:09:21,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2164 conditions, 1247 events. 545/1247 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7779 event pairs, 468 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 2145. Up to 864 conditions per place. [2025-03-04 15:09:21,955 INFO L140 encePairwiseOnDemand]: 58/63 looper letters, 25 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2025-03-04 15:09:21,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 59 transitions, 208 flow [2025-03-04 15:09:21,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:21,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:21,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 200 transitions. [2025-03-04 15:09:21,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5291005291005291 [2025-03-04 15:09:21,957 INFO L175 Difference]: Start difference. First operand has 63 places, 60 transitions, 150 flow. Second operand 6 states and 200 transitions. [2025-03-04 15:09:21,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 59 transitions, 208 flow [2025-03-04 15:09:21,958 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 59 transitions, 206 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:21,958 INFO L231 Difference]: Finished difference. Result has 66 places, 59 transitions, 156 flow [2025-03-04 15:09:21,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=144, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=156, PETRI_PLACES=66, PETRI_TRANSITIONS=59} [2025-03-04 15:09:21,959 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2025-03-04 15:09:21,959 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 59 transitions, 156 flow [2025-03-04 15:09:21,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 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,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:21,959 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:09:21,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:09:22,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:22,160 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:22,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,161 INFO L85 PathProgramCache]: Analyzing trace with hash 69881187, now seen corresponding path program 1 times [2025-03-04 15:09:22,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488198932] [2025-03-04 15:09:22,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:09:22,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:09:22,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:22,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:22,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488198932] [2025-03-04 15:09:22,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488198932] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:22,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508097562] [2025-03-04 15:09:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:22,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:22,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:22,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:22,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:22,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:22,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 59 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:22,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:22,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:22,311 INFO L124 PetriNetUnfolderBase]: 545/1246 cut-off events. [2025-03-04 15:09:22,311 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-03-04 15:09:22,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2166 conditions, 1246 events. 545/1246 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7744 event pairs, 468 based on Foata normal form. 1/1101 useless extension candidates. Maximal degree in co-relation 2141. Up to 867 conditions per place. [2025-03-04 15:09:22,319 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 26 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-04 15:09:22,319 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 58 transitions, 212 flow [2025-03-04 15:09:22,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:22,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:22,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2025-03-04 15:09:22,320 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5978835978835979 [2025-03-04 15:09:22,320 INFO L175 Difference]: Start difference. First operand has 66 places, 59 transitions, 156 flow. Second operand 3 states and 113 transitions. [2025-03-04 15:09:22,320 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 58 transitions, 212 flow [2025-03-04 15:09:22,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 58 transitions, 190 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:22,321 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 138 flow [2025-03-04 15:09:22,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2025-03-04 15:09:22,322 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2025-03-04 15:09:22,322 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 138 flow [2025-03-04 15:09:22,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 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,322 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:22,322 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:22,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:09:22,322 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:22,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1563203311, now seen corresponding path program 1 times [2025-03-04 15:09:22,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839907845] [2025-03-04 15:09:22,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:22,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:22,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:22,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839907845] [2025-03-04 15:09:22,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839907845] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:22,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [935278838] [2025-03-04 15:09:22,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:22,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:22,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:22,371 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:22,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:09:22,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:22,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:22,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:22,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,423 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:22,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:22,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:22,441 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:22,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:22,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [935278838] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:22,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:22,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:09:22,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273360433] [2025-03-04 15:09:22,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:22,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:22,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:22,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:22,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:22,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:22,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 138 flow. Second operand has 10 states, 10 states have (on average 29.4) internal successors, (294), 10 states have internal predecessors, (294), 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,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:22,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:22,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:22,637 INFO L124 PetriNetUnfolderBase]: 545/1250 cut-off events. [2025-03-04 15:09:22,637 INFO L125 PetriNetUnfolderBase]: For 35/35 co-relation queries the response was YES. [2025-03-04 15:09:22,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2169 conditions, 1250 events. 545/1250 cut-off events. For 35/35 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7750 event pairs, 468 based on Foata normal form. 2/1107 useless extension candidates. Maximal degree in co-relation 2134. Up to 865 conditions per place. [2025-03-04 15:09:22,645 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 26 selfloop transitions, 7 changer transitions 0/61 dead transitions. [2025-03-04 15:09:22,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 61 transitions, 219 flow [2025-03-04 15:09:22,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:22,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2025-03-04 15:09:22,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5238095238095238 [2025-03-04 15:09:22,648 INFO L175 Difference]: Start difference. First operand has 61 places, 58 transitions, 138 flow. Second operand 7 states and 231 transitions. [2025-03-04 15:09:22,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 61 transitions, 219 flow [2025-03-04 15:09:22,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 61 transitions, 205 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:22,650 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 164 flow [2025-03-04 15:09:22,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=164, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2025-03-04 15:09:22,651 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 8 predicate places. [2025-03-04 15:09:22,653 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 164 flow [2025-03-04 15:09:22,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 29.4) internal successors, (294), 10 states have internal predecessors, (294), 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,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:22,653 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:22,661 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:09:22,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 15:09:22,854 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:22,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:22,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1233152719, now seen corresponding path program 2 times [2025-03-04 15:09:22,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:22,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366229889] [2025-03-04 15:09:22,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:22,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:22,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:09:22,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:09:22,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:22,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:22,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:22,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:22,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366229889] [2025-03-04 15:09:22,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366229889] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:22,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:22,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:22,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141410506] [2025-03-04 15:09:22,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:22,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:22,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:22,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:22,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:22,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:22,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:22,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:22,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:23,036 INFO L124 PetriNetUnfolderBase]: 624/1403 cut-off events. [2025-03-04 15:09:23,037 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-03-04 15:09:23,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2418 conditions, 1403 events. 624/1403 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 8623 event pairs, 68 based on Foata normal form. 33/1343 useless extension candidates. Maximal degree in co-relation 2378. Up to 807 conditions per place. [2025-03-04 15:09:23,044 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 45 selfloop transitions, 2 changer transitions 0/73 dead transitions. [2025-03-04 15:09:23,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 73 transitions, 287 flow [2025-03-04 15:09:23,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:23,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:23,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2025-03-04 15:09:23,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.671957671957672 [2025-03-04 15:09:23,045 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 164 flow. Second operand 3 states and 127 transitions. [2025-03-04 15:09:23,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 73 transitions, 287 flow [2025-03-04 15:09:23,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 73 transitions, 283 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:23,047 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 162 flow [2025-03-04 15:09:23,047 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=162, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2025-03-04 15:09:23,047 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 7 predicate places. [2025-03-04 15:09:23,047 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 162 flow [2025-03-04 15:09:23,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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,048 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:23,048 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:23,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:09:23,048 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:23,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:23,048 INFO L85 PathProgramCache]: Analyzing trace with hash 426971682, now seen corresponding path program 1 times [2025-03-04 15:09:23,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:23,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405320095] [2025-03-04 15:09:23,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:23,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:23,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:23,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:23,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:23,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:23,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:23,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405320095] [2025-03-04 15:09:23,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405320095] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:23,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:23,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:23,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161727793] [2025-03-04 15:09:23,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:23,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:23,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:23,095 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:23,095 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:23,101 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:23,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 162 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:23,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:23,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:23,231 INFO L124 PetriNetUnfolderBase]: 559/1245 cut-off events. [2025-03-04 15:09:23,231 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2025-03-04 15:09:23,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2236 conditions, 1245 events. 559/1245 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7271 event pairs, 212 based on Foata normal form. 33/1182 useless extension candidates. Maximal degree in co-relation 2197. Up to 721 conditions per place. [2025-03-04 15:09:23,237 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 44 selfloop transitions, 2 changer transitions 0/72 dead transitions. [2025-03-04 15:09:23,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 72 transitions, 283 flow [2025-03-04 15:09:23,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:23,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:23,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 15:09:23,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:09:23,239 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 162 flow. Second operand 3 states and 126 transitions. [2025-03-04 15:09:23,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 72 transitions, 283 flow [2025-03-04 15:09:23,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 72 transitions, 279 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:23,241 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 160 flow [2025-03-04 15:09:23,242 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2025-03-04 15:09:23,242 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 6 predicate places. [2025-03-04 15:09:23,243 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 160 flow [2025-03-04 15:09:23,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 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,243 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:23,243 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:23,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:09:23,244 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:23,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash -2039346234, now seen corresponding path program 1 times [2025-03-04 15:09:23,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:23,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868006450] [2025-03-04 15:09:23,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:23,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:23,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:09:23,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:09:23,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:23,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,288 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:23,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:23,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868006450] [2025-03-04 15:09:23,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868006450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:23,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:23,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:23,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287655379] [2025-03-04 15:09:23,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:23,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:23,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:23,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:23,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:23,295 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:23,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 160 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:23,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:23,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:23,435 INFO L124 PetriNetUnfolderBase]: 613/1355 cut-off events. [2025-03-04 15:09:23,435 INFO L125 PetriNetUnfolderBase]: For 100/100 co-relation queries the response was YES. [2025-03-04 15:09:23,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2432 conditions, 1355 events. 613/1355 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8233 event pairs, 92 based on Foata normal form. 30/1302 useless extension candidates. Maximal degree in co-relation 2393. Up to 750 conditions per place. [2025-03-04 15:09:23,441 INFO L140 encePairwiseOnDemand]: 60/63 looper letters, 44 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2025-03-04 15:09:23,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 70 transitions, 278 flow [2025-03-04 15:09:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:23,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:23,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-03-04 15:09:23,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-03-04 15:09:23,442 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 160 flow. Second operand 3 states and 126 transitions. [2025-03-04 15:09:23,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 70 transitions, 278 flow [2025-03-04 15:09:23,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:23,444 INFO L231 Difference]: Finished difference. Result has 64 places, 58 transitions, 158 flow [2025-03-04 15:09:23,444 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=64, PETRI_TRANSITIONS=58} [2025-03-04 15:09:23,445 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 5 predicate places. [2025-03-04 15:09:23,445 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 58 transitions, 158 flow [2025-03-04 15:09:23,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 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,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:23,446 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:23,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:09:23,446 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:23,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:23,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1204757293, now seen corresponding path program 1 times [2025-03-04 15:09:23,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:23,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079678643] [2025-03-04 15:09:23,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:23,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:23,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:09:23,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:09:23,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:23,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:23,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079678643] [2025-03-04 15:09:23,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079678643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:23,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138084538] [2025-03-04 15:09:23,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:23,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:23,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:23,539 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:23,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:09:23,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:09:23,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:09:23,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:23,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:23,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:09:23,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:23,620 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:23,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:23,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138084538] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:23,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:23,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:09:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246668558] [2025-03-04 15:09:23,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:23,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:09:23,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:23,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:09:23,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:09:23,683 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 63 [2025-03-04 15:09:23,684 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 58 transitions, 158 flow. Second operand has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 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,684 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:23,684 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 63 [2025-03-04 15:09:23,684 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:23,846 INFO L124 PetriNetUnfolderBase]: 545/1245 cut-off events. [2025-03-04 15:09:23,846 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 15:09:23,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2248 conditions, 1245 events. 545/1245 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 7612 event pairs, 468 based on Foata normal form. 3/1117 useless extension candidates. Maximal degree in co-relation 2182. Up to 865 conditions per place. [2025-03-04 15:09:23,852 INFO L140 encePairwiseOnDemand]: 59/63 looper letters, 26 selfloop transitions, 13 changer transitions 0/64 dead transitions. [2025-03-04 15:09:23,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 64 transitions, 272 flow [2025-03-04 15:09:23,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:09:23,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:09:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 406 transitions. [2025-03-04 15:09:23,853 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49572649572649574 [2025-03-04 15:09:23,853 INFO L175 Difference]: Start difference. First operand has 64 places, 58 transitions, 158 flow. Second operand 13 states and 406 transitions. [2025-03-04 15:09:23,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 64 transitions, 272 flow [2025-03-04 15:09:23,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 64 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:23,855 INFO L231 Difference]: Finished difference. Result has 77 places, 64 transitions, 231 flow [2025-03-04 15:09:23,855 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=63, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=231, PETRI_PLACES=77, PETRI_TRANSITIONS=64} [2025-03-04 15:09:23,855 INFO L279 CegarLoopForPetriNet]: 59 programPoint places, 18 predicate places. [2025-03-04 15:09:23,855 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 64 transitions, 231 flow [2025-03-04 15:09:23,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 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,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:23,855 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:23,862 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:09:24,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-04 15:09:24,056 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 12 more)] === [2025-03-04 15:09:24,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:24,056 INFO L85 PathProgramCache]: Analyzing trace with hash -559323016, now seen corresponding path program 2 times [2025-03-04 15:09:24,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:24,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831955624] [2025-03-04 15:09:24,057 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:24,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:24,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 28 statements into 2 equivalence classes. [2025-03-04 15:09:24,076 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:24,079 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-04 15:09:24,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:24,079 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:24,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:09:24,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:24,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:24,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:24,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:24,099 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 15 remaining) [2025-03-04 15:09:24,099 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 15 remaining) [2025-03-04 15:09:24,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 15 remaining) [2025-03-04 15:09:24,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 15 remaining) [2025-03-04 15:09:24,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 15 remaining) [2025-03-04 15:09:24,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 15 remaining) [2025-03-04 15:09:24,100 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 15 remaining) [2025-03-04 15:09:24,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:09:24,100 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2025-03-04 15:09:24,100 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:24,101 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-04 15:09:24,125 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:24,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 89 transitions, 196 flow [2025-03-04 15:09:24,136 INFO L124 PetriNetUnfolderBase]: 13/97 cut-off events. [2025-03-04 15:09:24,136 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2025-03-04 15:09:24,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 97 events. 13/97 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 344 event pairs, 0 based on Foata normal form. 0/66 useless extension candidates. Maximal degree in co-relation 78. Up to 4 conditions per place. [2025-03-04 15:09:24,137 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 89 transitions, 196 flow [2025-03-04 15:09:24,137 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 83 places, 89 transitions, 196 flow [2025-03-04 15:09:24,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:24,138 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;@591b77e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:24,138 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-04 15:09:24,139 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:24,140 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:24,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:24,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:24,140 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:24,140 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 409338, now seen corresponding path program 1 times [2025-03-04 15:09:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783793793] [2025-03-04 15:09:24,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:24,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:24,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:24,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:24,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:24,163 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:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783793793] [2025-03-04 15:09:24,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783793793] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:24,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:24,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:24,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015852726] [2025-03-04 15:09:24,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:24,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:24,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:24,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:24,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:24,169 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:24,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 89 transitions, 196 flow. Second operand has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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:24,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:24,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:24,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:25,039 INFO L124 PetriNetUnfolderBase]: 8717/15445 cut-off events. [2025-03-04 15:09:25,039 INFO L125 PetriNetUnfolderBase]: For 670/670 co-relation queries the response was YES. [2025-03-04 15:09:25,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27852 conditions, 15445 events. 8717/15445 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125278 event pairs, 7668 based on Foata normal form. 2506/16439 useless extension candidates. Maximal degree in co-relation 8049. Up to 11969 conditions per place. [2025-03-04 15:09:25,104 INFO L140 encePairwiseOnDemand]: 76/89 looper letters, 40 selfloop transitions, 3 changer transitions 0/84 dead transitions. [2025-03-04 15:09:25,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 84 transitions, 272 flow [2025-03-04 15:09:25,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:25,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2025-03-04 15:09:25,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6095505617977528 [2025-03-04 15:09:25,106 INFO L175 Difference]: Start difference. First operand has 83 places, 89 transitions, 196 flow. Second operand 4 states and 217 transitions. [2025-03-04 15:09:25,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 84 transitions, 272 flow [2025-03-04 15:09:25,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 84 transitions, 270 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:25,108 INFO L231 Difference]: Finished difference. Result has 87 places, 84 transitions, 204 flow [2025-03-04 15:09:25,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=87, PETRI_TRANSITIONS=84} [2025-03-04 15:09:25,108 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 4 predicate places. [2025-03-04 15:09:25,108 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 84 transitions, 204 flow [2025-03-04 15:09:25,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 41.75) internal successors, (167), 4 states have internal predecessors, (167), 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:25,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:25,108 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:25,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:09:25,109 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:25,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash -689954164, now seen corresponding path program 1 times [2025-03-04 15:09:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:25,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182788931] [2025-03-04 15:09:25,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:25,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:25,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:25,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:25,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:25,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182788931] [2025-03-04 15:09:25,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182788931] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:25,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302613289] [2025-03-04 15:09:25,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:25,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:25,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:25,143 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:25,145 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:09:25,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:25,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:25,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:25,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:25,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:25,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:25,212 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:25,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:25,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302613289] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:25,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:25,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:25,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819663431] [2025-03-04 15:09:25,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:25,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:25,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:25,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:25,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:25,220 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:25,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 84 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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:25,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:25,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:25,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:26,210 INFO L124 PetriNetUnfolderBase]: 8717/15444 cut-off events. [2025-03-04 15:09:26,211 INFO L125 PetriNetUnfolderBase]: For 376/376 co-relation queries the response was YES. [2025-03-04 15:09:26,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27762 conditions, 15444 events. 8717/15444 cut-off events. For 376/376 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125319 event pairs, 7668 based on Foata normal form. 1/13933 useless extension candidates. Maximal degree in co-relation 27742. Up to 11964 conditions per place. [2025-03-04 15:09:26,288 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 36 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2025-03-04 15:09:26,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 83 transitions, 284 flow [2025-03-04 15:09:26,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:09:26,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:09:26,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 289 transitions. [2025-03-04 15:09:26,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5411985018726592 [2025-03-04 15:09:26,293 INFO L175 Difference]: Start difference. First operand has 87 places, 84 transitions, 204 flow. Second operand 6 states and 289 transitions. [2025-03-04 15:09:26,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 83 transitions, 284 flow [2025-03-04 15:09:26,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 83 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:26,295 INFO L231 Difference]: Finished difference. Result has 90 places, 83 transitions, 210 flow [2025-03-04 15:09:26,295 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=210, PETRI_PLACES=90, PETRI_TRANSITIONS=83} [2025-03-04 15:09:26,295 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-03-04 15:09:26,295 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 83 transitions, 210 flow [2025-03-04 15:09:26,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.833333333333336) internal successors, (251), 6 states have internal predecessors, (251), 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:26,295 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:26,296 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:09:26,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:26,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:26,496 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:26,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 86257756, now seen corresponding path program 1 times [2025-03-04 15:09:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:26,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721760159] [2025-03-04 15:09:26,497 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:26,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:26,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:09:26,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:09:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:26,516 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:09:26,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:26,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721760159] [2025-03-04 15:09:26,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721760159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:26,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:26,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100020647] [2025-03-04 15:09:26,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:26,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:26,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:26,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:26,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:26,520 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:26,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 83 transitions, 210 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:26,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:26,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:26,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:27,364 INFO L124 PetriNetUnfolderBase]: 8717/15443 cut-off events. [2025-03-04 15:09:27,364 INFO L125 PetriNetUnfolderBase]: For 381/381 co-relation queries the response was YES. [2025-03-04 15:09:27,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27764 conditions, 15443 events. 8717/15443 cut-off events. For 381/381 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125227 event pairs, 7668 based on Foata normal form. 1/13933 useless extension candidates. Maximal degree in co-relation 27738. Up to 11967 conditions per place. [2025-03-04 15:09:27,422 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 37 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2025-03-04 15:09:27,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 82 transitions, 288 flow [2025-03-04 15:09:27,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:27,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:27,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-03-04 15:09:27,423 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104868913857678 [2025-03-04 15:09:27,423 INFO L175 Difference]: Start difference. First operand has 90 places, 83 transitions, 210 flow. Second operand 3 states and 163 transitions. [2025-03-04 15:09:27,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 82 transitions, 288 flow [2025-03-04 15:09:27,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 82 transitions, 266 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:09:27,425 INFO L231 Difference]: Finished difference. Result has 85 places, 82 transitions, 192 flow [2025-03-04 15:09:27,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=192, PETRI_PLACES=85, PETRI_TRANSITIONS=82} [2025-03-04 15:09:27,425 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 2 predicate places. [2025-03-04 15:09:27,425 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 82 transitions, 192 flow [2025-03-04 15:09:27,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 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:27,425 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:27,425 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:27,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:09:27,425 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:27,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:27,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1289804483, now seen corresponding path program 1 times [2025-03-04 15:09:27,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:27,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755747493] [2025-03-04 15:09:27,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:27,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:27,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:27,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:27,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:27,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:27,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:27,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755747493] [2025-03-04 15:09:27,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1755747493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:27,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466969690] [2025-03-04 15:09:27,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:27,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:27,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:27,466 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:27,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:09:27,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 15:09:27,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 15:09:27,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:27,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:27,523 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:09:27,524 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:27,546 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:27,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:27,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466969690] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:27,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:27,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-03-04 15:09:27,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769814794] [2025-03-04 15:09:27,566 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:27,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:09:27,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:27,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:09:27,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:09:27,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:27,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 82 transitions, 192 flow. Second operand has 10 states, 10 states have (on average 42.4) internal successors, (424), 10 states have internal predecessors, (424), 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:27,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:27,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:27,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:28,567 INFO L124 PetriNetUnfolderBase]: 8717/15447 cut-off events. [2025-03-04 15:09:28,568 INFO L125 PetriNetUnfolderBase]: For 383/383 co-relation queries the response was YES. [2025-03-04 15:09:28,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 15447 events. 8717/15447 cut-off events. For 383/383 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125301 event pairs, 7668 based on Foata normal form. 2/13939 useless extension candidates. Maximal degree in co-relation 27731. Up to 11965 conditions per place. [2025-03-04 15:09:28,660 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 37 selfloop transitions, 7 changer transitions 0/85 dead transitions. [2025-03-04 15:09:28,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 85 transitions, 295 flow [2025-03-04 15:09:28,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:09:28,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:09:28,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 333 transitions. [2025-03-04 15:09:28,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5345104333868379 [2025-03-04 15:09:28,662 INFO L175 Difference]: Start difference. First operand has 85 places, 82 transitions, 192 flow. Second operand 7 states and 333 transitions. [2025-03-04 15:09:28,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 85 transitions, 295 flow [2025-03-04 15:09:28,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 85 transitions, 281 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:28,664 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 218 flow [2025-03-04 15:09:28,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2025-03-04 15:09:28,665 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 8 predicate places. [2025-03-04 15:09:28,665 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 218 flow [2025-03-04 15:09:28,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 42.4) internal successors, (424), 10 states have internal predecessors, (424), 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,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:28,665 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:28,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-04 15:09:28,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:28,866 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1833585027, now seen corresponding path program 2 times [2025-03-04 15:09:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139756339] [2025-03-04 15:09:28,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:28,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-04 15:09:28,874 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 15 statements. [2025-03-04 15:09:28,874 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:28,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:28,897 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:28,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139756339] [2025-03-04 15:09:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139756339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:28,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931578263] [2025-03-04 15:09:28,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:28,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:28,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:28,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:28,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:28,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 218 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:28,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:28,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:29,849 INFO L124 PetriNetUnfolderBase]: 9720/16898 cut-off events. [2025-03-04 15:09:29,850 INFO L125 PetriNetUnfolderBase]: For 394/394 co-relation queries the response was YES. [2025-03-04 15:09:29,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30454 conditions, 16898 events. 9720/16898 cut-off events. For 394/394 co-relation queries the response was YES. Maximal size of possible extension queue 719. Compared 134242 event pairs, 5096 based on Foata normal form. 333/16037 useless extension candidates. Maximal degree in co-relation 30413. Up to 11097 conditions per place. [2025-03-04 15:09:29,925 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 67 selfloop transitions, 2 changer transitions 0/108 dead transitions. [2025-03-04 15:09:29,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 108 transitions, 412 flow [2025-03-04 15:09:29,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:29,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2025-03-04 15:09:29,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.704119850187266 [2025-03-04 15:09:29,926 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 218 flow. Second operand 3 states and 188 transitions. [2025-03-04 15:09:29,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 108 transitions, 412 flow [2025-03-04 15:09:29,927 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 108 transitions, 408 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:29,927 INFO L231 Difference]: Finished difference. Result has 90 places, 84 transitions, 216 flow [2025-03-04 15:09:29,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=88, 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=216, PETRI_PLACES=90, PETRI_TRANSITIONS=84} [2025-03-04 15:09:29,928 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 7 predicate places. [2025-03-04 15:09:29,928 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 84 transitions, 216 flow [2025-03-04 15:09:29,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:29,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:29,928 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:29,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:09:29,928 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:29,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:29,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1006561385, now seen corresponding path program 1 times [2025-03-04 15:09:29,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:29,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576965014] [2025-03-04 15:09:29,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:29,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:29,933 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 15:09:29,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 15:09:29,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:29,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:29,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:09:29,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:29,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576965014] [2025-03-04 15:09:29,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576965014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:29,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:29,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:29,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73648978] [2025-03-04 15:09:29,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:29,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:29,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:29,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:29,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:29,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:29,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 84 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:29,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:29,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:29,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:30,729 INFO L124 PetriNetUnfolderBase]: 8830/15390 cut-off events. [2025-03-04 15:09:30,730 INFO L125 PetriNetUnfolderBase]: For 993/993 co-relation queries the response was YES. [2025-03-04 15:09:30,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28382 conditions, 15390 events. 8830/15390 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 651. Compared 120298 event pairs, 4592 based on Foata normal form. 333/14631 useless extension candidates. Maximal degree in co-relation 28342. Up to 9901 conditions per place. [2025-03-04 15:09:30,782 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 66 selfloop transitions, 2 changer transitions 0/107 dead transitions. [2025-03-04 15:09:30,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 107 transitions, 408 flow [2025-03-04 15:09:30,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:30,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-03-04 15:09:30,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.700374531835206 [2025-03-04 15:09:30,783 INFO L175 Difference]: Start difference. First operand has 90 places, 84 transitions, 216 flow. Second operand 3 states and 187 transitions. [2025-03-04 15:09:30,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 107 transitions, 408 flow [2025-03-04 15:09:30,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 107 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:30,785 INFO L231 Difference]: Finished difference. Result has 89 places, 83 transitions, 214 flow [2025-03-04 15:09:30,785 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=214, PETRI_PLACES=89, PETRI_TRANSITIONS=83} [2025-03-04 15:09:30,785 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 6 predicate places. [2025-03-04 15:09:30,786 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 83 transitions, 214 flow [2025-03-04 15:09:30,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 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:30,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:30,786 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:30,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:09:30,786 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:30,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:30,786 INFO L85 PathProgramCache]: Analyzing trace with hash 895605638, now seen corresponding path program 1 times [2025-03-04 15:09:30,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:30,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055751299] [2025-03-04 15:09:30,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:30,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:30,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:09:30,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:09:30,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:30,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:30,855 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:30,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:30,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055751299] [2025-03-04 15:09:30,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055751299] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:30,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440631483] [2025-03-04 15:09:30,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:30,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:30,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:30,858 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:30,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:09:30,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-04 15:09:30,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-04 15:09:30,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:30,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:30,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 15:09:30,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:30,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:30,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:09:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:31,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440631483] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:09:31,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:09:31,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-04 15:09:31,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39225399] [2025-03-04 15:09:31,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:09:31,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:09:31,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:31,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:09:31,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:09:31,027 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:31,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 83 transitions, 214 flow. Second operand has 15 states, 15 states have (on average 42.46666666666667) internal successors, (637), 15 states have internal predecessors, (637), 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:31,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:31,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:31,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:31,800 INFO L124 PetriNetUnfolderBase]: 8717/15454 cut-off events. [2025-03-04 15:09:31,800 INFO L125 PetriNetUnfolderBase]: For 997/997 co-relation queries the response was YES. [2025-03-04 15:09:31,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28464 conditions, 15454 events. 8717/15454 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 125325 event pairs, 7668 based on Foata normal form. 3/13949 useless extension candidates. Maximal degree in co-relation 28397. Up to 11965 conditions per place. [2025-03-04 15:09:31,891 INFO L140 encePairwiseOnDemand]: 85/89 looper letters, 37 selfloop transitions, 13 changer transitions 0/89 dead transitions. [2025-03-04 15:09:31,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 89 transitions, 350 flow [2025-03-04 15:09:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:09:31,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:09:31,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 586 transitions. [2025-03-04 15:09:31,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5064822817631807 [2025-03-04 15:09:31,893 INFO L175 Difference]: Start difference. First operand has 89 places, 83 transitions, 214 flow. Second operand 13 states and 586 transitions. [2025-03-04 15:09:31,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 89 transitions, 350 flow [2025-03-04 15:09:31,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 89 transitions, 346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:31,900 INFO L231 Difference]: Finished difference. Result has 102 places, 89 transitions, 287 flow [2025-03-04 15:09:31,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=287, PETRI_PLACES=102, PETRI_TRANSITIONS=89} [2025-03-04 15:09:31,900 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 19 predicate places. [2025-03-04 15:09:31,900 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 89 transitions, 287 flow [2025-03-04 15:09:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 42.46666666666667) internal successors, (637), 15 states have internal predecessors, (637), 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:31,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:31,901 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:31,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:09:32,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:32,102 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:32,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:32,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1471188876, now seen corresponding path program 2 times [2025-03-04 15:09:32,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:32,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849625011] [2025-03-04 15:09:32,102 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:09:32,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:32,108 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-03-04 15:09:32,110 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 9 of 27 statements. [2025-03-04 15:09:32,111 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:09:32,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:32,141 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:32,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:32,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849625011] [2025-03-04 15:09:32,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849625011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:32,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:32,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:32,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880620542] [2025-03-04 15:09:32,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:32,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:32,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:32,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:32,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:32,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:32,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 89 transitions, 287 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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:32,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:32,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:32,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:32,919 INFO L124 PetriNetUnfolderBase]: 9781/17102 cut-off events. [2025-03-04 15:09:32,919 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2025-03-04 15:09:32,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30689 conditions, 17102 events. 9781/17102 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 722. Compared 136332 event pairs, 2972 based on Foata normal form. 330/16357 useless extension candidates. Maximal degree in co-relation 30602. Up to 11040 conditions per place. [2025-03-04 15:09:33,014 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 72 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2025-03-04 15:09:33,014 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 111 transitions, 484 flow [2025-03-04 15:09:33,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:33,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:33,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2025-03-04 15:09:33,016 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.700374531835206 [2025-03-04 15:09:33,016 INFO L175 Difference]: Start difference. First operand has 102 places, 89 transitions, 287 flow. Second operand 3 states and 187 transitions. [2025-03-04 15:09:33,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 111 transitions, 484 flow [2025-03-04 15:09:33,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 111 transitions, 474 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:09:33,018 INFO L231 Difference]: Finished difference. Result has 99 places, 88 transitions, 279 flow [2025-03-04 15:09:33,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=99, PETRI_TRANSITIONS=88} [2025-03-04 15:09:33,018 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 16 predicate places. [2025-03-04 15:09:33,018 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 88 transitions, 279 flow [2025-03-04 15:09:33,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:33,018 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:33,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:09:33,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:33,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:33,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1637785521, now seen corresponding path program 1 times [2025-03-04 15:09:33,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:33,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735711676] [2025-03-04 15:09:33,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:33,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:33,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:09:33,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:33,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:33,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:33,065 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:33,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:33,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735711676] [2025-03-04 15:09:33,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735711676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:33,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:33,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:33,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154210194] [2025-03-04 15:09:33,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:33,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:33,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:33,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:33,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:33,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:33,071 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 88 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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,071 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:33,071 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:33,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:33,801 INFO L124 PetriNetUnfolderBase]: 8891/15672 cut-off events. [2025-03-04 15:09:33,801 INFO L125 PetriNetUnfolderBase]: For 928/928 co-relation queries the response was YES. [2025-03-04 15:09:33,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28695 conditions, 15672 events. 8891/15672 cut-off events. For 928/928 co-relation queries the response was YES. Maximal size of possible extension queue 660. Compared 123628 event pairs, 2732 based on Foata normal form. 330/15005 useless extension candidates. Maximal degree in co-relation 28612. Up to 9850 conditions per place. [2025-03-04 15:09:33,892 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 71 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-04 15:09:33,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 110 transitions, 474 flow [2025-03-04 15:09:33,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:33,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:33,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-03-04 15:09:33,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2025-03-04 15:09:33,893 INFO L175 Difference]: Start difference. First operand has 99 places, 88 transitions, 279 flow. Second operand 3 states and 186 transitions. [2025-03-04 15:09:33,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 110 transitions, 474 flow [2025-03-04 15:09:33,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 110 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:33,896 INFO L231 Difference]: Finished difference. Result has 98 places, 87 transitions, 277 flow [2025-03-04 15:09:33,896 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=96, 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=277, PETRI_PLACES=98, PETRI_TRANSITIONS=87} [2025-03-04 15:09:33,896 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-03-04 15:09:33,896 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 87 transitions, 277 flow [2025-03-04 15:09:33,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:33,897 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:33,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:09:33,897 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:33,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:33,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1347228740, now seen corresponding path program 1 times [2025-03-04 15:09:33,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:33,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187583295] [2025-03-04 15:09:33,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:33,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:33,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-03-04 15:09:33,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-03-04 15:09:33,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:33,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:33,983 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:33,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:33,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187583295] [2025-03-04 15:09:33,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187583295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:33,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:33,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:09:33,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697910792] [2025-03-04 15:09:33,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:33,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:33,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:33,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:33,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:33,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:33,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 87 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:33,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:33,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:34,931 INFO L124 PetriNetUnfolderBase]: 9669/16553 cut-off events. [2025-03-04 15:09:34,931 INFO L125 PetriNetUnfolderBase]: For 1016/1016 co-relation queries the response was YES. [2025-03-04 15:09:34,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30871 conditions, 16553 events. 9669/16553 cut-off events. For 1016/1016 co-relation queries the response was YES. Maximal size of possible extension queue 712. Compared 129739 event pairs, 4088 based on Foata normal form. 333/15575 useless extension candidates. Maximal degree in co-relation 30788. Up to 8705 conditions per place. [2025-03-04 15:09:35,007 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 95 selfloop transitions, 4 changer transitions 0/134 dead transitions. [2025-03-04 15:09:35,007 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 134 transitions, 597 flow [2025-03-04 15:09:35,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 253 transitions. [2025-03-04 15:09:35,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7106741573033708 [2025-03-04 15:09:35,008 INFO L175 Difference]: Start difference. First operand has 98 places, 87 transitions, 277 flow. Second operand 4 states and 253 transitions. [2025-03-04 15:09:35,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 134 transitions, 597 flow [2025-03-04 15:09:35,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 134 transitions, 585 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:09:35,018 INFO L231 Difference]: Finished difference. Result has 98 places, 86 transitions, 279 flow [2025-03-04 15:09:35,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=279, PETRI_PLACES=98, PETRI_TRANSITIONS=86} [2025-03-04 15:09:35,018 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 15 predicate places. [2025-03-04 15:09:35,019 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 86 transitions, 279 flow [2025-03-04 15:09:35,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:35,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:35,019 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:35,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:09:35,019 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:35,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1185582429, now seen corresponding path program 1 times [2025-03-04 15:09:35,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:35,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117919147] [2025-03-04 15:09:35,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:35,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:35,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-04 15:09:35,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-04 15:09:35,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:35,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:35,101 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:35,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:35,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117919147] [2025-03-04 15:09:35,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117919147] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:35,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:35,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:09:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582895979] [2025-03-04 15:09:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:35,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:35,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:35,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:35,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:35,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 86 transitions, 279 flow. Second operand has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:35,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:35,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:35,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:37,062 INFO L124 PetriNetUnfolderBase]: 17141/29572 cut-off events. [2025-03-04 15:09:37,062 INFO L125 PetriNetUnfolderBase]: For 2105/2105 co-relation queries the response was YES. [2025-03-04 15:09:37,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55660 conditions, 29572 events. 17141/29572 cut-off events. For 2105/2105 co-relation queries the response was YES. Maximal size of possible extension queue 1145. Compared 253329 event pairs, 8468 based on Foata normal form. 333/28150 useless extension candidates. Maximal degree in co-relation 55577. Up to 13507 conditions per place. [2025-03-04 15:09:37,282 INFO L140 encePairwiseOnDemand]: 84/89 looper letters, 104 selfloop transitions, 4 changer transitions 0/143 dead transitions. [2025-03-04 15:09:37,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 143 transitions, 635 flow [2025-03-04 15:09:37,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:37,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:37,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-03-04 15:09:37,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7359550561797753 [2025-03-04 15:09:37,283 INFO L175 Difference]: Start difference. First operand has 98 places, 86 transitions, 279 flow. Second operand 4 states and 262 transitions. [2025-03-04 15:09:37,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 143 transitions, 635 flow [2025-03-04 15:09:37,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 143 transitions, 621 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:09:37,329 INFO L231 Difference]: Finished difference. Result has 100 places, 89 transitions, 298 flow [2025-03-04 15:09:37,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=298, PETRI_PLACES=100, PETRI_TRANSITIONS=89} [2025-03-04 15:09:37,330 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 17 predicate places. [2025-03-04 15:09:37,330 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 89 transitions, 298 flow [2025-03-04 15:09:37,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 43.5) internal successors, (174), 4 states have internal predecessors, (174), 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:37,330 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:37,330 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:37,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:09:37,330 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:37,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:37,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1887754134, now seen corresponding path program 1 times [2025-03-04 15:09:37,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:37,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955806261] [2025-03-04 15:09:37,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:37,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:37,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:09:37,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:09:37,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:37,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-04 15:09:37,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:37,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955806261] [2025-03-04 15:09:37,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955806261] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:37,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:37,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:37,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427327086] [2025-03-04 15:09:37,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:37,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:09:37,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:37,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:09:37,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:09:37,377 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 89 [2025-03-04 15:09:37,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 89 transitions, 298 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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:37,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:37,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 89 [2025-03-04 15:09:37,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:38,792 INFO L124 PetriNetUnfolderBase]: 17907/31481 cut-off events. [2025-03-04 15:09:38,792 INFO L125 PetriNetUnfolderBase]: For 4618/4861 co-relation queries the response was YES. [2025-03-04 15:09:38,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59735 conditions, 31481 events. 17907/31481 cut-off events. For 4618/4861 co-relation queries the response was YES. Maximal size of possible extension queue 1179. Compared 277409 event pairs, 3220 based on Foata normal form. 540/30372 useless extension candidates. Maximal degree in co-relation 59650. Up to 18630 conditions per place. [2025-03-04 15:09:39,018 INFO L140 encePairwiseOnDemand]: 86/89 looper letters, 77 selfloop transitions, 2 changer transitions 0/113 dead transitions. [2025-03-04 15:09:39,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 113 transitions, 523 flow [2025-03-04 15:09:39,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:09:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:09:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2025-03-04 15:09:39,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6966292134831461 [2025-03-04 15:09:39,019 INFO L175 Difference]: Start difference. First operand has 100 places, 89 transitions, 298 flow. Second operand 3 states and 186 transitions. [2025-03-04 15:09:39,019 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 113 transitions, 523 flow [2025-03-04 15:09:39,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 113 transitions, 517 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:09:39,023 INFO L231 Difference]: Finished difference. Result has 100 places, 88 transitions, 297 flow [2025-03-04 15:09:39,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=89, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=297, PETRI_PLACES=100, PETRI_TRANSITIONS=88} [2025-03-04 15:09:39,024 INFO L279 CegarLoopForPetriNet]: 83 programPoint places, 17 predicate places. [2025-03-04 15:09:39,024 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 88 transitions, 297 flow [2025-03-04 15:09:39,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:39,024 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 6, 6, 4, 3, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:39,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:09:39,024 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 16 more)] === [2025-03-04 15:09:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:39,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1609182769, now seen corresponding path program 1 times [2025-03-04 15:09:39,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:39,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127173183] [2025-03-04 15:09:39,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:39,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:39,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:09:39,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:09:39,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:39,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:39,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 15:09:39,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:09:39,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:09:39,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:39,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 15:09:39,055 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 15:09:39,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 19 remaining) [2025-03-04 15:09:39,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 19 remaining) [2025-03-04 15:09:39,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 19 remaining) [2025-03-04 15:09:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 15:09:39,057 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:09:39,058 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-04 15:09:39,058 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-03-04 15:09:39,084 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 15:09:39,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 107 places, 115 transitions, 258 flow [2025-03-04 15:09:39,091 INFO L124 PetriNetUnfolderBase]: 17/126 cut-off events. [2025-03-04 15:09:39,092 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-03-04 15:09:39,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 126 events. 17/126 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 468 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 105. Up to 5 conditions per place. [2025-03-04 15:09:39,093 INFO L82 GeneralOperation]: Start removeDead. Operand has 107 places, 115 transitions, 258 flow [2025-03-04 15:09:39,096 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 107 places, 115 transitions, 258 flow [2025-03-04 15:09:39,096 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:09:39,096 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;@591b77e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:09:39,097 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-03-04 15:09:39,097 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:09:39,097 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:09:39,097 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:09:39,097 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:39,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:09:39,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:09:39,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:39,097 INFO L85 PathProgramCache]: Analyzing trace with hash 523533, now seen corresponding path program 1 times [2025-03-04 15:09:39,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:39,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006893796] [2025-03-04 15:09:39,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:39,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:39,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:09:39,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:09:39,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:39,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:39,121 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,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:39,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006893796] [2025-03-04 15:09:39,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006893796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:39,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:09:39,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:09:39,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860957363] [2025-03-04 15:09:39,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:39,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:09:39,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:39,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:09:39,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:09:39,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 115 [2025-03-04 15:09:39,125 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 115 transitions, 258 flow. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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,125 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:39,125 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 115 [2025-03-04 15:09:39,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:09:49,217 INFO L124 PetriNetUnfolderBase]: 120365/186035 cut-off events. [2025-03-04 15:09:49,218 INFO L125 PetriNetUnfolderBase]: For 11610/11610 co-relation queries the response was YES. [2025-03-04 15:09:49,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344443 conditions, 186035 events. 120365/186035 cut-off events. For 11610/11610 co-relation queries the response was YES. Maximal size of possible extension queue 6212. Compared 1712487 event pairs, 106668 based on Foata normal form. 34911/206029 useless extension candidates. Maximal degree in co-relation 27954. Up to 152969 conditions per place. [2025-03-04 15:09:50,442 INFO L140 encePairwiseOnDemand]: 100/115 looper letters, 51 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-03-04 15:09:50,442 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 108 transitions, 352 flow [2025-03-04 15:09:50,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:09:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:09:50,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 282 transitions. [2025-03-04 15:09:50,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6130434782608696 [2025-03-04 15:09:50,443 INFO L175 Difference]: Start difference. First operand has 107 places, 115 transitions, 258 flow. Second operand 4 states and 282 transitions. [2025-03-04 15:09:50,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 108 transitions, 352 flow [2025-03-04 15:09:50,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 108 transitions, 346 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-04 15:09:50,448 INFO L231 Difference]: Finished difference. Result has 111 places, 108 transitions, 258 flow [2025-03-04 15:09:50,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=115, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=258, PETRI_PLACES=111, PETRI_TRANSITIONS=108} [2025-03-04 15:09:50,448 INFO L279 CegarLoopForPetriNet]: 107 programPoint places, 4 predicate places. [2025-03-04 15:09:50,449 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 108 transitions, 258 flow [2025-03-04 15:09:50,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 4 states have internal predecessors, (219), 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:50,449 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:09:50,449 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:09:50,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 15:09:50,449 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thr1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thr1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 20 more)] === [2025-03-04 15:09:50,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:09:50,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1582824020, now seen corresponding path program 1 times [2025-03-04 15:09:50,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:09:50,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349732944] [2025-03-04 15:09:50,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:50,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:09:50,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:50,455 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:50,455 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:50,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:50,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:50,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:09:50,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349732944] [2025-03-04 15:09:50,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349732944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:09:50,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [311479683] [2025-03-04 15:09:50,481 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:09:50,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:09:50,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:09:50,483 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:09:50,485 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:09:50,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:09:50,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:09:50,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:09:50,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:09:50,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:09:50,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:09:50,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:09:50,564 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:09:50,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [311479683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:09:50,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:09:50,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:09:50,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858682183] [2025-03-04 15:09:50,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:09:50,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:09:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:09:50,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:09:50,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:09:50,570 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 115 [2025-03-04 15:09:50,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 108 transitions, 258 flow. Second operand has 6 states, 6 states have (on average 54.833333333333336) internal successors, (329), 6 states have internal predecessors, (329), 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:50,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:09:50,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 115 [2025-03-04 15:09:50,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:10:01,541 INFO L124 PetriNetUnfolderBase]: 120365/186034 cut-off events. [2025-03-04 15:10:01,541 INFO L125 PetriNetUnfolderBase]: For 4356/4356 co-relation queries the response was YES. [2025-03-04 15:10:02,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342353 conditions, 186034 events. 120365/186034 cut-off events. For 4356/4356 co-relation queries the response was YES. Maximal size of possible extension queue 6212. Compared 1713389 event pairs, 106668 based on Foata normal form. 1/171118 useless extension candidates. Maximal degree in co-relation 342332. Up to 152964 conditions per place.