./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e2fb8bed 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/queue.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 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-09 06:20:44,053 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-09 06:20:44,103 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-09 06:20:44,107 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-09 06:20:44,107 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-09 06:20:44,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-09 06:20:44,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-09 06:20:44,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-09 06:20:44,133 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-09 06:20:44,133 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-09 06:20:44,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-09 06:20:44,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-09 06:20:44,133 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Use SBE=true [2025-03-09 06:20:44,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-09 06:20:44,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-09 06:20:44,135 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:20:44,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-09 06:20:44,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-09 06:20:44,137 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-09 06:20:44,137 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-09 06:20:44,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-09 06:20:44,138 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-09 06:20:44,138 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 -> 4d771c5dc4ab027f123135a7de4324b9be0c6bae288f44d0eaffc15d1836bd60 [2025-03-09 06:20:44,390 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-09 06:20:44,399 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-09 06:20:44,400 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-09 06:20:44,402 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-09 06:20:44,402 INFO L274 PluginConnector]: CDTParser initialized [2025-03-09 06:20:44,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-09 06:20:45,573 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad0f271e/6a01a181aef04c5c91e3364407f5fc11/FLAGdf1f00477 [2025-03-09 06:20:45,820 INFO L384 CDTParser]: Found 1 translation units. [2025-03-09 06:20:45,821 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-09 06:20:45,835 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad0f271e/6a01a181aef04c5c91e3364407f5fc11/FLAGdf1f00477 [2025-03-09 06:20:46,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bad0f271e/6a01a181aef04c5c91e3364407f5fc11 [2025-03-09 06:20:46,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-09 06:20:46,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-09 06:20:46,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-09 06:20:46,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-09 06:20:46,143 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-09 06:20:46,144 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20a751b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46, skipping insertion in model container [2025-03-09 06:20:46,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,180 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-09 06:20:46,461 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:20:46,478 INFO L200 MainTranslator]: Completed pre-run [2025-03-09 06:20:46,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-09 06:20:46,585 INFO L204 MainTranslator]: Completed translation [2025-03-09 06:20:46,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46 WrapperNode [2025-03-09 06:20:46,586 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-09 06:20:46,587 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-09 06:20:46,587 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-09 06:20:46,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-09 06:20:46,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,607 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,628 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 307 [2025-03-09 06:20:46,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-09 06:20:46,629 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-09 06:20:46,629 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-09 06:20:46,629 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-09 06:20:46,635 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,636 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,640 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,658 INFO L175 MemorySlicer]: Split 92 memory accesses to 5 slices as follows [2, 8, 5, 23, 54]. 59 percent of accesses are in the largest equivalence class. The 58 initializations are split as follows [2, 8, 5, 20, 23]. The 16 writes are split as follows [0, 0, 0, 2, 14]. [2025-03-09 06:20:46,658 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,658 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,665 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,668 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,670 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,673 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-09 06:20:46,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-09 06:20:46,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-09 06:20:46,674 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-09 06:20:46,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (1/1) ... [2025-03-09 06:20:46,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-09 06:20:46,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:20:46,700 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-09 06:20:46,703 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-09 06:20:46,720 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-09 06:20:46,721 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-09 06:20:46,721 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-09 06:20:46,721 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-09 06:20:46,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-09 06:20:46,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-09 06:20:46,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-09 06:20:46,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-09 06:20:46,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-09 06:20:46,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-09 06:20:46,724 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-09 06:20:46,828 INFO L256 CfgBuilder]: Building ICFG [2025-03-09 06:20:46,830 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-09 06:20:47,160 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-09 06:20:47,160 INFO L307 CfgBuilder]: Performing block encoding [2025-03-09 06:20:47,418 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-09 06:20:47,419 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-09 06:20:47,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:20:47 BoogieIcfgContainer [2025-03-09 06:20:47,420 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-09 06:20:47,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-09 06:20:47,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-09 06:20:47,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-09 06:20:47,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.03 06:20:46" (1/3) ... [2025-03-09 06:20:47,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f967e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:20:47, skipping insertion in model container [2025-03-09 06:20:47,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.03 06:20:46" (2/3) ... [2025-03-09 06:20:47,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f967e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.03 06:20:47, skipping insertion in model container [2025-03-09 06:20:47,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.03 06:20:47" (3/3) ... [2025-03-09 06:20:47,427 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-09 06:20:47,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-09 06:20:47,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue.i that has 3 procedures, 77 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-09 06:20:47,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-09 06:20:47,493 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-09 06:20:47,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-03-09 06:20:47,551 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-03-09 06:20:47,553 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-09 06:20:47,557 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93 conditions, 84 events. 10/84 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 213 event pairs, 0 based on Foata normal form. 0/56 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-03-09 06:20:47,557 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-03-09 06:20:47,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 80 transitions, 169 flow [2025-03-09 06:20:47,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-09 06:20:47,580 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;@1160c884, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-09 06:20:47,581 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-09 06:20:47,587 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-09 06:20:47,587 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-09 06:20:47,588 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-09 06:20:47,588 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:47,588 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:47,588 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:47,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:47,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1490407634, now seen corresponding path program 1 times [2025-03-09 06:20:47,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:47,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030421615] [2025-03-09 06:20:47,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:47,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:47,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-09 06:20:47,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-09 06:20:47,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:47,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:48,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:20:48,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:48,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030421615] [2025-03-09 06:20:48,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030421615] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:48,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:48,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:20:48,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670378436] [2025-03-09 06:20:48,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:48,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:20:48,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:48,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:20:48,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:20:48,212 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:20:48,214 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 80 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-09 06:20:48,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:48,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:20:48,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:48,561 INFO L124 PetriNetUnfolderBase]: 1236/2529 cut-off events. [2025-03-09 06:20:48,561 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-09 06:20:48,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4513 conditions, 2529 events. 1236/2529 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15780 event pairs, 205 based on Foata normal form. 48/2190 useless extension candidates. Maximal degree in co-relation 4442. Up to 1613 conditions per place. [2025-03-09 06:20:48,578 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 74 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2025-03-09 06:20:48,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 395 flow [2025-03-09 06:20:48,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:48,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:48,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-03-09 06:20:48,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-03-09 06:20:48,592 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 169 flow. Second operand 4 states and 210 transitions. [2025-03-09 06:20:48,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 395 flow [2025-03-09 06:20:48,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:20:48,599 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 204 flow [2025-03-09 06:20:48,601 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=204, PETRI_PLACES=81, PETRI_TRANSITIONS=83} [2025-03-09 06:20:48,604 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-03-09 06:20:48,606 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 204 flow [2025-03-09 06:20:48,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-09 06:20:48,606 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:48,606 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:48,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-09 06:20:48,606 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:48,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:48,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1042004321, now seen corresponding path program 1 times [2025-03-09 06:20:48,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:48,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126014367] [2025-03-09 06:20:48,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:48,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:48,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-09 06:20:48,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-09 06:20:48,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:48,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:48,954 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-09 06:20:48,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:48,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126014367] [2025-03-09 06:20:48,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126014367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:48,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:48,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:20:48,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300348731] [2025-03-09 06:20:48,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:48,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:20:48,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:48,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:20:48,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:20:48,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:20:48,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 83 transitions, 204 flow. Second operand has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-09 06:20:48,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:48,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:20:48,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:49,284 INFO L124 PetriNetUnfolderBase]: 1242/2582 cut-off events. [2025-03-09 06:20:49,285 INFO L125 PetriNetUnfolderBase]: For 454/457 co-relation queries the response was YES. [2025-03-09 06:20:49,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4892 conditions, 2582 events. 1242/2582 cut-off events. For 454/457 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 16533 event pairs, 264 based on Foata normal form. 38/2288 useless extension candidates. Maximal degree in co-relation 4134. Up to 1757 conditions per place. [2025-03-09 06:20:49,295 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 82 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-03-09 06:20:49,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 460 flow [2025-03-09 06:20:49,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:20:49,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:20:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2025-03-09 06:20:49,299 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-09 06:20:49,300 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 204 flow. Second operand 5 states and 250 transitions. [2025-03-09 06:20:49,300 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 460 flow [2025-03-09 06:20:49,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 118 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:20:49,305 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 221 flow [2025-03-09 06:20:49,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=221, PETRI_PLACES=85, PETRI_TRANSITIONS=84} [2025-03-09 06:20:49,306 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-03-09 06:20:49,306 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 221 flow [2025-03-09 06:20:49,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.75) internal successors, (135), 4 states have internal predecessors, (135), 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-09 06:20:49,307 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:49,307 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:49,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-09 06:20:49,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:49,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:49,308 INFO L85 PathProgramCache]: Analyzing trace with hash 638797541, now seen corresponding path program 1 times [2025-03-09 06:20:49,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:49,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003794939] [2025-03-09 06:20:49,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:49,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:49,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-09 06:20:49,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-09 06:20:49,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:49,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:49,506 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-09 06:20:49,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:49,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003794939] [2025-03-09 06:20:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003794939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:49,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:20:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105349187] [2025-03-09 06:20:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:49,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:20:49,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:49,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:20:49,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:20:49,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:20:49,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 84 transitions, 221 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-09 06:20:49,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:49,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:20:49,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:49,918 INFO L124 PetriNetUnfolderBase]: 1322/2692 cut-off events. [2025-03-09 06:20:49,918 INFO L125 PetriNetUnfolderBase]: For 532/548 co-relation queries the response was YES. [2025-03-09 06:20:49,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5201 conditions, 2692 events. 1322/2692 cut-off events. For 532/548 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 17162 event pairs, 266 based on Foata normal form. 40/2368 useless extension candidates. Maximal degree in co-relation 4433. Up to 1803 conditions per place. [2025-03-09 06:20:49,933 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 103 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-03-09 06:20:49,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 589 flow [2025-03-09 06:20:49,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-09 06:20:49,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-09 06:20:49,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-03-09 06:20:49,935 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664451827242525 [2025-03-09 06:20:49,935 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 221 flow. Second operand 7 states and 341 transitions. [2025-03-09 06:20:49,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 589 flow [2025-03-09 06:20:49,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 144 transitions, 575 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-09 06:20:49,943 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 276 flow [2025-03-09 06:20:49,943 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=276, PETRI_PLACES=91, PETRI_TRANSITIONS=90} [2025-03-09 06:20:49,944 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-09 06:20:49,944 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 276 flow [2025-03-09 06:20:49,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 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-09 06:20:49,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:49,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:49,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-09 06:20:49,945 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:49,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:49,946 INFO L85 PathProgramCache]: Analyzing trace with hash -846753598, now seen corresponding path program 1 times [2025-03-09 06:20:49,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:49,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434892295] [2025-03-09 06:20:49,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:49,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:49,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-09 06:20:49,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-09 06:20:49,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:49,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:50,023 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-09 06:20:50,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:50,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434892295] [2025-03-09 06:20:50,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434892295] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:50,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:50,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-09 06:20:50,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474755448] [2025-03-09 06:20:50,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:50,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:20:50,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:50,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:20:50,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:20:50,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-09 06:20:50,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 90 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-09 06:20:50,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:50,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-09 06:20:50,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:50,245 INFO L124 PetriNetUnfolderBase]: 1023/2377 cut-off events. [2025-03-09 06:20:50,246 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-03-09 06:20:50,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4349 conditions, 2377 events. 1023/2377 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 13953 event pairs, 483 based on Foata normal form. 38/2105 useless extension candidates. Maximal degree in co-relation 4339. Up to 885 conditions per place. [2025-03-09 06:20:50,259 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 64 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-03-09 06:20:50,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 97 transitions, 374 flow [2025-03-09 06:20:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:20:50,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:20:50,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-09 06:20:50,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-03-09 06:20:50,264 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 276 flow. Second operand 3 states and 176 transitions. [2025-03-09 06:20:50,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 97 transitions, 374 flow [2025-03-09 06:20:50,266 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 335 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-03-09 06:20:50,267 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 169 flow [2025-03-09 06:20:50,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=169, PETRI_PLACES=75, PETRI_TRANSITIONS=76} [2025-03-09 06:20:50,270 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-03-09 06:20:50,271 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 169 flow [2025-03-09 06:20:50,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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-09 06:20:50,271 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:50,271 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:50,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-09 06:20:50,271 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:50,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:50,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1981394715, now seen corresponding path program 1 times [2025-03-09 06:20:50,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:50,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137435275] [2025-03-09 06:20:50,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:50,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:50,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-09 06:20:50,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-09 06:20:50,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:50,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:50,322 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-09 06:20:50,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:50,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137435275] [2025-03-09 06:20:50,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137435275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:50,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:50,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:20:50,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53252516] [2025-03-09 06:20:50,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:50,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:20:50,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:50,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:20:50,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:20:50,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-03-09 06:20:50,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 76 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:50,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:50,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-03-09 06:20:50,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:50,711 INFO L124 PetriNetUnfolderBase]: 1890/4135 cut-off events. [2025-03-09 06:20:50,711 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-09 06:20:50,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7390 conditions, 4135 events. 1890/4135 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26754 event pairs, 960 based on Foata normal form. 138/3752 useless extension candidates. Maximal degree in co-relation 7385. Up to 1980 conditions per place. [2025-03-09 06:20:50,729 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 113 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-09 06:20:50,730 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 144 transitions, 554 flow [2025-03-09 06:20:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:50,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:50,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-03-09 06:20:50,731 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-03-09 06:20:50,731 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 169 flow. Second operand 4 states and 252 transitions. [2025-03-09 06:20:50,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 144 transitions, 554 flow [2025-03-09 06:20:50,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 144 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:20:50,734 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 190 flow [2025-03-09 06:20:50,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=190, PETRI_PLACES=79, PETRI_TRANSITIONS=78} [2025-03-09 06:20:50,734 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-03-09 06:20:50,735 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 190 flow [2025-03-09 06:20:50,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:50,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:50,735 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:50,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-09 06:20:50,735 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:50,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1160182554, now seen corresponding path program 1 times [2025-03-09 06:20:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:50,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76743190] [2025-03-09 06:20:50,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:50,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-09 06:20:50,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-09 06:20:50,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:50,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:50,973 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-09 06:20:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:50,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76743190] [2025-03-09 06:20:50,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76743190] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:50,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:50,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-09 06:20:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685156778] [2025-03-09 06:20:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:50,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:20:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:50,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:20:50,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-09 06:20:50,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-09 06:20:50,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 78 transitions, 190 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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-09 06:20:50,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:50,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-09 06:20:50,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:51,327 INFO L124 PetriNetUnfolderBase]: 1715/3852 cut-off events. [2025-03-09 06:20:51,327 INFO L125 PetriNetUnfolderBase]: For 790/910 co-relation queries the response was YES. [2025-03-09 06:20:51,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7356 conditions, 3852 events. 1715/3852 cut-off events. For 790/910 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 25034 event pairs, 279 based on Foata normal form. 0/3403 useless extension candidates. Maximal degree in co-relation 7349. Up to 2409 conditions per place. [2025-03-09 06:20:51,345 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 75 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-09 06:20:51,346 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 468 flow [2025-03-09 06:20:51,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:20:51,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:20:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2025-03-09 06:20:51,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2025-03-09 06:20:51,347 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 190 flow. Second operand 5 states and 252 transitions. [2025-03-09 06:20:51,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 468 flow [2025-03-09 06:20:51,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:20:51,349 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 196 flow [2025-03-09 06:20:51,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=82, PETRI_TRANSITIONS=77} [2025-03-09 06:20:51,350 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-03-09 06:20:51,350 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 196 flow [2025-03-09 06:20:51,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 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-09 06:20:51,350 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:51,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:51,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-09 06:20:51,351 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:51,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:51,351 INFO L85 PathProgramCache]: Analyzing trace with hash 898811421, now seen corresponding path program 1 times [2025-03-09 06:20:51,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:51,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891618387] [2025-03-09 06:20:51,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:51,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:51,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:20:51,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:20:51,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:51,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:52,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-09 06:20:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891618387] [2025-03-09 06:20:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891618387] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:52,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:20:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925332734] [2025-03-09 06:20:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:52,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:20:52,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:52,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:20:52,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:20:52,210 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-09 06:20:52,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 77 transitions, 196 flow. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-09 06:20:52,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:52,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-09 06:20:52,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:52,831 INFO L124 PetriNetUnfolderBase]: 2309/4799 cut-off events. [2025-03-09 06:20:52,831 INFO L125 PetriNetUnfolderBase]: For 925/1077 co-relation queries the response was YES. [2025-03-09 06:20:52,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9576 conditions, 4799 events. 2309/4799 cut-off events. For 925/1077 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 31309 event pairs, 444 based on Foata normal form. 22/4282 useless extension candidates. Maximal degree in co-relation 9569. Up to 2448 conditions per place. [2025-03-09 06:20:52,845 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 135 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-03-09 06:20:52,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 169 transitions, 783 flow [2025-03-09 06:20:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:20:52,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:20:52,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 379 transitions. [2025-03-09 06:20:52,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4896640826873385 [2025-03-09 06:20:52,848 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 196 flow. Second operand 9 states and 379 transitions. [2025-03-09 06:20:52,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 169 transitions, 783 flow [2025-03-09 06:20:52,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 169 transitions, 773 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:20:52,852 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 223 flow [2025-03-09 06:20:52,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=223, PETRI_PLACES=89, PETRI_TRANSITIONS=80} [2025-03-09 06:20:52,854 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2025-03-09 06:20:52,854 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 223 flow [2025-03-09 06:20:52,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-09 06:20:52,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:52,856 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:52,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-09 06:20:52,856 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:52,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:52,856 INFO L85 PathProgramCache]: Analyzing trace with hash -165116390, now seen corresponding path program 1 times [2025-03-09 06:20:52,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:52,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657900852] [2025-03-09 06:20:52,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:52,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:52,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:20:52,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:20:52,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:52,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:52,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:20:52,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657900852] [2025-03-09 06:20:52,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657900852] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:20:52,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140379151] [2025-03-09 06:20:52,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:52,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:20:52,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:20:52,919 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-09 06:20:52,921 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-09 06:20:52,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-09 06:20:53,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-09 06:20:53,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:53,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:53,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:20:53,010 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:20:53,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:20:53,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:20:53,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140379151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:53,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:20:53,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 06:20:53,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850988468] [2025-03-09 06:20:53,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:53,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:20:53,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:53,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:20:53,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:20:53,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-03-09 06:20:53,062 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 80 transitions, 223 flow. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-09 06:20:53,062 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:53,062 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-03-09 06:20:53,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:53,492 INFO L124 PetriNetUnfolderBase]: 2140/4297 cut-off events. [2025-03-09 06:20:53,493 INFO L125 PetriNetUnfolderBase]: For 819/903 co-relation queries the response was YES. [2025-03-09 06:20:53,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9002 conditions, 4297 events. 2140/4297 cut-off events. For 819/903 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 27026 event pairs, 111 based on Foata normal form. 83/4006 useless extension candidates. Maximal degree in co-relation 8993. Up to 2115 conditions per place. [2025-03-09 06:20:53,511 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 106 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-03-09 06:20:53,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 613 flow [2025-03-09 06:20:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:53,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:53,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-09 06:20:53,515 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-03-09 06:20:53,515 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 223 flow. Second operand 4 states and 233 transitions. [2025-03-09 06:20:53,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 613 flow [2025-03-09 06:20:53,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 139 transitions, 591 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:20:53,519 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 221 flow [2025-03-09 06:20:53,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=211, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=87, PETRI_TRANSITIONS=79} [2025-03-09 06:20:53,519 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2025-03-09 06:20:53,519 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 221 flow [2025-03-09 06:20:53,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 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-09 06:20:53,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:53,520 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:53,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-09 06:20:53,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:20:53,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:53,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:53,722 INFO L85 PathProgramCache]: Analyzing trace with hash 2093351021, now seen corresponding path program 1 times [2025-03-09 06:20:53,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:53,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987667277] [2025-03-09 06:20:53,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:53,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:53,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:20:53,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:20:53,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:53,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:54,274 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-09 06:20:54,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:54,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987667277] [2025-03-09 06:20:54,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987667277] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:54,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:54,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:20:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917306424] [2025-03-09 06:20:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:54,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:20:54,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:54,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:20:54,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:20:54,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-09 06:20:54,309 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 79 transitions, 221 flow. Second operand has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-09 06:20:54,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:54,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-09 06:20:54,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:54,853 INFO L124 PetriNetUnfolderBase]: 2277/4734 cut-off events. [2025-03-09 06:20:54,854 INFO L125 PetriNetUnfolderBase]: For 2384/2456 co-relation queries the response was YES. [2025-03-09 06:20:54,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10219 conditions, 4734 events. 2277/4734 cut-off events. For 2384/2456 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 30919 event pairs, 444 based on Foata normal form. 22/4295 useless extension candidates. Maximal degree in co-relation 10209. Up to 2448 conditions per place. [2025-03-09 06:20:54,876 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 134 selfloop transitions, 8 changer transitions 0/167 dead transitions. [2025-03-09 06:20:54,876 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 167 transitions, 866 flow [2025-03-09 06:20:54,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-09 06:20:54,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-09 06:20:54,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-03-09 06:20:54,878 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2025-03-09 06:20:54,878 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 221 flow. Second operand 9 states and 378 transitions. [2025-03-09 06:20:54,878 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 167 transitions, 866 flow [2025-03-09 06:20:54,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 167 transitions, 783 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:20:54,913 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 220 flow [2025-03-09 06:20:54,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=220, PETRI_PLACES=91, PETRI_TRANSITIONS=78} [2025-03-09 06:20:54,914 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-09 06:20:54,914 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 220 flow [2025-03-09 06:20:54,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.125) internal successors, (241), 8 states have internal predecessors, (241), 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-09 06:20:54,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:54,914 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:54,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-09 06:20:54,915 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:54,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:54,915 INFO L85 PathProgramCache]: Analyzing trace with hash -823640014, now seen corresponding path program 1 times [2025-03-09 06:20:54,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:54,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820322046] [2025-03-09 06:20:54,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:54,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:54,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-09 06:20:54,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-09 06:20:54,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:54,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:20:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820322046] [2025-03-09 06:20:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820322046] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:54,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:54,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:20:54,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321675977] [2025-03-09 06:20:54,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:54,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:20:54,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:54,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:20:54,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:20:54,957 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-03-09 06:20:54,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 78 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:54,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:54,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-03-09 06:20:54,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:55,314 INFO L124 PetriNetUnfolderBase]: 1994/4203 cut-off events. [2025-03-09 06:20:55,314 INFO L125 PetriNetUnfolderBase]: For 1066/1110 co-relation queries the response was YES. [2025-03-09 06:20:55,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8640 conditions, 4203 events. 1994/4203 cut-off events. For 1066/1110 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 27092 event pairs, 368 based on Foata normal form. 0/3890 useless extension candidates. Maximal degree in co-relation 8630. Up to 1995 conditions per place. [2025-03-09 06:20:55,353 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 99 selfloop transitions, 6 changer transitions 6/138 dead transitions. [2025-03-09 06:20:55,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 620 flow [2025-03-09 06:20:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-09 06:20:55,355 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-03-09 06:20:55,355 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 220 flow. Second operand 4 states and 233 transitions. [2025-03-09 06:20:55,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 620 flow [2025-03-09 06:20:55,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 586 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:20:55,358 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 220 flow [2025-03-09 06:20:55,359 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=220, PETRI_PLACES=88, PETRI_TRANSITIONS=76} [2025-03-09 06:20:55,359 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2025-03-09 06:20:55,360 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 220 flow [2025-03-09 06:20:55,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:55,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:55,360 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:55,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-09 06:20:55,360 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:55,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:55,361 INFO L85 PathProgramCache]: Analyzing trace with hash 469342208, now seen corresponding path program 1 times [2025-03-09 06:20:55,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:55,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896143795] [2025-03-09 06:20:55,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:55,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:55,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-09 06:20:55,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-09 06:20:55,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:55,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:55,403 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-09 06:20:55,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:55,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896143795] [2025-03-09 06:20:55,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896143795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:55,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:55,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:20:55,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545623029] [2025-03-09 06:20:55,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:55,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:20:55,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:55,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:20:55,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:20:55,418 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:20:55,419 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 76 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:55,419 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:55,419 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:20:55,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:55,881 INFO L124 PetriNetUnfolderBase]: 2829/5808 cut-off events. [2025-03-09 06:20:55,882 INFO L125 PetriNetUnfolderBase]: For 3596/3606 co-relation queries the response was YES. [2025-03-09 06:20:55,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12826 conditions, 5808 events. 2829/5808 cut-off events. For 3596/3606 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 39865 event pairs, 1541 based on Foata normal form. 144/5556 useless extension candidates. Maximal degree in co-relation 12815. Up to 3624 conditions per place. [2025-03-09 06:20:55,905 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 93 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-03-09 06:20:55,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 578 flow [2025-03-09 06:20:55,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:55,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-03-09 06:20:55,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-03-09 06:20:55,909 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 220 flow. Second operand 4 states and 220 transitions. [2025-03-09 06:20:55,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 578 flow [2025-03-09 06:20:55,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:20:55,915 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 240 flow [2025-03-09 06:20:55,915 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-03-09 06:20:55,915 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 12 predicate places. [2025-03-09 06:20:55,915 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 240 flow [2025-03-09 06:20:55,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:55,916 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:55,916 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:55,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-09 06:20:55,916 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:55,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:55,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1665662611, now seen corresponding path program 1 times [2025-03-09 06:20:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:55,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989698417] [2025-03-09 06:20:55,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:55,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-09 06:20:55,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-09 06:20:55,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:55,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:56,281 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-09 06:20:56,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:56,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989698417] [2025-03-09 06:20:56,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989698417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:56,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:56,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:20:56,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995945072] [2025-03-09 06:20:56,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:56,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:20:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:56,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:20:56,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:20:56,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-09 06:20:56,292 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 240 flow. Second operand has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 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-09 06:20:56,292 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:56,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-09 06:20:56,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:56,868 INFO L124 PetriNetUnfolderBase]: 2968/6034 cut-off events. [2025-03-09 06:20:56,869 INFO L125 PetriNetUnfolderBase]: For 2660/2726 co-relation queries the response was YES. [2025-03-09 06:20:56,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13768 conditions, 6034 events. 2968/6034 cut-off events. For 2660/2726 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 41323 event pairs, 480 based on Foata normal form. 0/5593 useless extension candidates. Maximal degree in co-relation 13754. Up to 2392 conditions per place. [2025-03-09 06:20:56,898 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 15 changer transitions 2/192 dead transitions. [2025-03-09 06:20:56,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 1000 flow [2025-03-09 06:20:56,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:20:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:20:56,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2025-03-09 06:20:56,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174418604651163 [2025-03-09 06:20:56,900 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 240 flow. Second operand 10 states and 445 transitions. [2025-03-09 06:20:56,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 1000 flow [2025-03-09 06:20:56,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 192 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:20:56,908 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 312 flow [2025-03-09 06:20:56,909 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=312, PETRI_PLACES=101, PETRI_TRANSITIONS=85} [2025-03-09 06:20:56,909 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-03-09 06:20:56,910 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 312 flow [2025-03-09 06:20:56,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 32.5) internal successors, (260), 8 states have internal predecessors, (260), 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-09 06:20:56,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:56,911 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:56,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-09 06:20:56,911 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:56,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash 95934146, now seen corresponding path program 1 times [2025-03-09 06:20:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:56,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563712948] [2025-03-09 06:20:56,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:56,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-09 06:20:56,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-09 06:20:56,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:56,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:57,265 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-09 06:20:57,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:57,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563712948] [2025-03-09 06:20:57,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563712948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:57,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:57,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:20:57,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319783023] [2025-03-09 06:20:57,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:57,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:20:57,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:57,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:20:57,267 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:20:57,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:20:57,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 85 transitions, 312 flow. Second operand has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 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-09 06:20:57,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:57,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:20:57,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:57,837 INFO L124 PetriNetUnfolderBase]: 2853/5963 cut-off events. [2025-03-09 06:20:57,838 INFO L125 PetriNetUnfolderBase]: For 3464/3530 co-relation queries the response was YES. [2025-03-09 06:20:57,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14752 conditions, 5963 events. 2853/5963 cut-off events. For 3464/3530 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 41629 event pairs, 496 based on Foata normal form. 44/5834 useless extension candidates. Maximal degree in co-relation 14736. Up to 2726 conditions per place. [2025-03-09 06:20:57,862 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 14 changer transitions 2/194 dead transitions. [2025-03-09 06:20:57,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 194 transitions, 1075 flow [2025-03-09 06:20:57,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-09 06:20:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-09 06:20:57,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2025-03-09 06:20:57,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536046511627907 [2025-03-09 06:20:57,864 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 312 flow. Second operand 10 states and 461 transitions. [2025-03-09 06:20:57,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 194 transitions, 1075 flow [2025-03-09 06:20:57,870 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 194 transitions, 1063 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:20:57,872 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 362 flow [2025-03-09 06:20:57,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=300, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=362, PETRI_PLACES=107, PETRI_TRANSITIONS=88} [2025-03-09 06:20:57,872 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2025-03-09 06:20:57,873 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 362 flow [2025-03-09 06:20:57,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.375) internal successors, (275), 8 states have internal predecessors, (275), 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-09 06:20:57,873 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:57,873 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-09 06:20:57,873 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:57,874 INFO L85 PathProgramCache]: Analyzing trace with hash 202224693, now seen corresponding path program 1 times [2025-03-09 06:20:57,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:57,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125206413] [2025-03-09 06:20:57,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:57,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:20:57,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:20:57,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:57,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:57,931 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:20:57,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:57,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125206413] [2025-03-09 06:20:57,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125206413] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:20:57,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314201841] [2025-03-09 06:20:57,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:57,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:20:57,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:20:57,934 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-09 06:20:57,935 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-09 06:20:58,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-09 06:20:58,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-09 06:20:58,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:58,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:58,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-09 06:20:58,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:20:58,065 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:20:58,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:20:58,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314201841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:58,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:20:58,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-09 06:20:58,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069199169] [2025-03-09 06:20:58,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:58,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-09 06:20:58,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:58,069 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-09 06:20:58,069 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-09 06:20:58,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-03-09 06:20:58,080 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 88 transitions, 362 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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-09 06:20:58,080 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:58,080 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-03-09 06:20:58,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:58,552 INFO L124 PetriNetUnfolderBase]: 3140/6153 cut-off events. [2025-03-09 06:20:58,552 INFO L125 PetriNetUnfolderBase]: For 4513/4547 co-relation queries the response was YES. [2025-03-09 06:20:58,565 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16172 conditions, 6153 events. 3140/6153 cut-off events. For 4513/4547 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40802 event pairs, 704 based on Foata normal form. 150/6043 useless extension candidates. Maximal degree in co-relation 16153. Up to 3424 conditions per place. [2025-03-09 06:20:58,581 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 84 selfloop transitions, 5 changer transitions 0/114 dead transitions. [2025-03-09 06:20:58,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 640 flow [2025-03-09 06:20:58,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:58,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-03-09 06:20:58,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2025-03-09 06:20:58,583 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 362 flow. Second operand 4 states and 195 transitions. [2025-03-09 06:20:58,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 640 flow [2025-03-09 06:20:58,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 622 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-09 06:20:58,595 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 346 flow [2025-03-09 06:20:58,595 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=346, PETRI_PLACES=101, PETRI_TRANSITIONS=86} [2025-03-09 06:20:58,596 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-03-09 06:20:58,596 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 346 flow [2025-03-09 06:20:58,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 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-09 06:20:58,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:58,597 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:58,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-09 06:20:58,801 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,SelfDestructingSolverStorable13 [2025-03-09 06:20:58,801 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:58,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:58,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1973998939, now seen corresponding path program 1 times [2025-03-09 06:20:58,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:58,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617717522] [2025-03-09 06:20:58,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:58,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:58,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-09 06:20:58,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-09 06:20:58,822 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:58,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:58,846 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:20:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617717522] [2025-03-09 06:20:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617717522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:58,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:20:58,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499654438] [2025-03-09 06:20:58,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:58,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-09 06:20:58,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:58,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-09 06:20:58,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-09 06:20:58,856 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-03-09 06:20:58,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 86 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:58,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:58,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-03-09 06:20:58,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:59,307 INFO L124 PetriNetUnfolderBase]: 2784/5687 cut-off events. [2025-03-09 06:20:59,307 INFO L125 PetriNetUnfolderBase]: For 4472/4492 co-relation queries the response was YES. [2025-03-09 06:20:59,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14877 conditions, 5687 events. 2784/5687 cut-off events. For 4472/4492 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38253 event pairs, 748 based on Foata normal form. 150/5683 useless extension candidates. Maximal degree in co-relation 14858. Up to 2901 conditions per place. [2025-03-09 06:20:59,340 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 88 selfloop transitions, 6 changer transitions 0/119 dead transitions. [2025-03-09 06:20:59,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 656 flow [2025-03-09 06:20:59,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-09 06:20:59,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-09 06:20:59,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-03-09 06:20:59,342 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-09 06:20:59,342 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 346 flow. Second operand 4 states and 200 transitions. [2025-03-09 06:20:59,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 656 flow [2025-03-09 06:20:59,352 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 646 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-09 06:20:59,353 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 348 flow [2025-03-09 06:20:59,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=100, PETRI_TRANSITIONS=85} [2025-03-09 06:20:59,354 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2025-03-09 06:20:59,354 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 348 flow [2025-03-09 06:20:59,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.0) internal successors, (148), 4 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:20:59,354 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:59,354 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:59,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-09 06:20:59,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:59,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:59,355 INFO L85 PathProgramCache]: Analyzing trace with hash -886420645, now seen corresponding path program 1 times [2025-03-09 06:20:59,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:59,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451733478] [2025-03-09 06:20:59,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:59,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:59,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-09 06:20:59,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-09 06:20:59,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:59,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:20:59,402 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-09 06:20:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:20:59,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451733478] [2025-03-09 06:20:59,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451733478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:20:59,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:20:59,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:20:59,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875526623] [2025-03-09 06:20:59,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:20:59,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:20:59,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:20:59,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:20:59,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:20:59,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-09 06:20:59,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 85 transitions, 348 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-09 06:20:59,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:20:59,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-09 06:20:59,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:20:59,679 INFO L124 PetriNetUnfolderBase]: 1726/3929 cut-off events. [2025-03-09 06:20:59,680 INFO L125 PetriNetUnfolderBase]: For 4062/4062 co-relation queries the response was YES. [2025-03-09 06:20:59,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10530 conditions, 3929 events. 1726/3929 cut-off events. For 4062/4062 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 25708 event pairs, 514 based on Foata normal form. 166/4014 useless extension candidates. Maximal degree in co-relation 10511. Up to 1934 conditions per place. [2025-03-09 06:20:59,696 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 64 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-03-09 06:20:59,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 97 transitions, 534 flow [2025-03-09 06:20:59,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:20:59,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:20:59,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-09 06:20:59,697 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-09 06:20:59,697 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 348 flow. Second operand 3 states and 166 transitions. [2025-03-09 06:20:59,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 97 transitions, 534 flow [2025-03-09 06:20:59,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 508 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-09 06:20:59,705 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 303 flow [2025-03-09 06:20:59,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=291, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=303, PETRI_PLACES=99, PETRI_TRANSITIONS=80} [2025-03-09 06:20:59,706 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-03-09 06:20:59,706 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 303 flow [2025-03-09 06:20:59,706 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-09 06:20:59,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:20:59,706 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:20:59,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-09 06:20:59,706 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:20:59,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:20:59,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1834171490, now seen corresponding path program 1 times [2025-03-09 06:20:59,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:20:59,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141692830] [2025-03-09 06:20:59,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:20:59,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:20:59,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-09 06:20:59,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-09 06:20:59,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:20:59,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:00,139 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-09 06:21:00,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:00,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141692830] [2025-03-09 06:21:00,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141692830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:00,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:00,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-09 06:21:00,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509468470] [2025-03-09 06:21:00,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:00,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-09 06:21:00,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:00,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-09 06:21:00,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-09 06:21:00,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:21:00,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 80 transitions, 303 flow. Second operand has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:00,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:00,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:21:00,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:00,596 INFO L124 PetriNetUnfolderBase]: 1760/3862 cut-off events. [2025-03-09 06:21:00,596 INFO L125 PetriNetUnfolderBase]: For 3541/3543 co-relation queries the response was YES. [2025-03-09 06:21:00,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10412 conditions, 3862 events. 1760/3862 cut-off events. For 3541/3543 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24291 event pairs, 308 based on Foata normal form. 36/3802 useless extension candidates. Maximal degree in co-relation 10392. Up to 1776 conditions per place. [2025-03-09 06:21:00,615 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 109 selfloop transitions, 9 changer transitions 2/145 dead transitions. [2025-03-09 06:21:00,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 832 flow [2025-03-09 06:21:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:21:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:21:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 357 transitions. [2025-03-09 06:21:00,617 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5188953488372093 [2025-03-09 06:21:00,617 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 303 flow. Second operand 8 states and 357 transitions. [2025-03-09 06:21:00,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 832 flow [2025-03-09 06:21:00,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-09 06:21:00,625 INFO L231 Difference]: Finished difference. Result has 105 places, 79 transitions, 311 flow [2025-03-09 06:21:00,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=311, PETRI_PLACES=105, PETRI_TRANSITIONS=79} [2025-03-09 06:21:00,626 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-03-09 06:21:00,626 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 79 transitions, 311 flow [2025-03-09 06:21:00,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.25) internal successors, (282), 8 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:00,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:00,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:00,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-09 06:21:00,627 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:00,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:00,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1891934825, now seen corresponding path program 1 times [2025-03-09 06:21:00,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:00,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17311968] [2025-03-09 06:21:00,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:00,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:00,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:21:00,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:21:00,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:00,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:01,148 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-09 06:21:01,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:01,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17311968] [2025-03-09 06:21:01,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17311968] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:01,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:01,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:21:01,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876639902] [2025-03-09 06:21:01,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:01,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:21:01,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:01,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:21:01,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:21:01,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-09 06:21:01,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 79 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 31.8) internal successors, (318), 10 states have internal predecessors, (318), 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-09 06:21:01,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:01,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-09 06:21:01,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:01,783 INFO L124 PetriNetUnfolderBase]: 2162/4614 cut-off events. [2025-03-09 06:21:01,783 INFO L125 PetriNetUnfolderBase]: For 4416/4416 co-relation queries the response was YES. [2025-03-09 06:21:01,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12419 conditions, 4614 events. 2162/4614 cut-off events. For 4416/4416 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 29251 event pairs, 213 based on Foata normal form. 0/4478 useless extension candidates. Maximal degree in co-relation 12398. Up to 1544 conditions per place. [2025-03-09 06:21:01,802 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 147 selfloop transitions, 12 changer transitions 2/183 dead transitions. [2025-03-09 06:21:01,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 183 transitions, 1076 flow [2025-03-09 06:21:01,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-09 06:21:01,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-09 06:21:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 455 transitions. [2025-03-09 06:21:01,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4809725158562368 [2025-03-09 06:21:01,804 INFO L175 Difference]: Start difference. First operand has 105 places, 79 transitions, 311 flow. Second operand 11 states and 455 transitions. [2025-03-09 06:21:01,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 183 transitions, 1076 flow [2025-03-09 06:21:01,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 183 transitions, 1060 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:21:01,812 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 360 flow [2025-03-09 06:21:01,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=360, PETRI_PLACES=113, PETRI_TRANSITIONS=84} [2025-03-09 06:21:01,813 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2025-03-09 06:21:01,813 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 360 flow [2025-03-09 06:21:01,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.8) internal successors, (318), 10 states have internal predecessors, (318), 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-09 06:21:01,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:01,813 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:01,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-09 06:21:01,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:01,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:01,814 INFO L85 PathProgramCache]: Analyzing trace with hash 739624328, now seen corresponding path program 1 times [2025-03-09 06:21:01,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:01,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430486435] [2025-03-09 06:21:01,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:01,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:01,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-09 06:21:01,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-09 06:21:01,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:01,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:01,867 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:01,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:01,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430486435] [2025-03-09 06:21:01,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430486435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:01,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:01,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-09 06:21:01,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800375765] [2025-03-09 06:21:01,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:01,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-09 06:21:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:01,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-09 06:21:01,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-09 06:21:01,873 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-09 06:21:01,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 84 transitions, 360 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-09 06:21:01,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:01,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-09 06:21:01,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:02,143 INFO L124 PetriNetUnfolderBase]: 1680/3798 cut-off events. [2025-03-09 06:21:02,144 INFO L125 PetriNetUnfolderBase]: For 4278/4284 co-relation queries the response was YES. [2025-03-09 06:21:02,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10227 conditions, 3798 events. 1680/3798 cut-off events. For 4278/4284 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23456 event pairs, 1011 based on Foata normal form. 30/3735 useless extension candidates. Maximal degree in co-relation 10203. Up to 1855 conditions per place. [2025-03-09 06:21:02,162 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 71 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-09 06:21:02,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 101 transitions, 575 flow [2025-03-09 06:21:02,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-09 06:21:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-09 06:21:02,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-09 06:21:02,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-09 06:21:02,163 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 360 flow. Second operand 3 states and 166 transitions. [2025-03-09 06:21:02,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 101 transitions, 575 flow [2025-03-09 06:21:02,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 101 transitions, 562 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-09 06:21:02,171 INFO L231 Difference]: Finished difference. Result has 110 places, 82 transitions, 343 flow [2025-03-09 06:21:02,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=343, PETRI_PLACES=110, PETRI_TRANSITIONS=82} [2025-03-09 06:21:02,172 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2025-03-09 06:21:02,173 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 343 flow [2025-03-09 06:21:02,173 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-09 06:21:02,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:02,173 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:02,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-09 06:21:02,173 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:02,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:02,173 INFO L85 PathProgramCache]: Analyzing trace with hash 645781617, now seen corresponding path program 1 times [2025-03-09 06:21:02,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:02,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280285505] [2025-03-09 06:21:02,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:02,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:02,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-09 06:21:02,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-09 06:21:02,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:02,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:02,353 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-09 06:21:02,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280285505] [2025-03-09 06:21:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280285505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:02,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:02,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-09 06:21:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380603318] [2025-03-09 06:21:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:02,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-09 06:21:02,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:02,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-09 06:21:02,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-09 06:21:02,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-03-09 06:21:02,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 82 transitions, 343 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:02,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:02,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-03-09 06:21:02,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:02,707 INFO L124 PetriNetUnfolderBase]: 1676/3747 cut-off events. [2025-03-09 06:21:02,707 INFO L125 PetriNetUnfolderBase]: For 3887/3887 co-relation queries the response was YES. [2025-03-09 06:21:02,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10171 conditions, 3747 events. 1676/3747 cut-off events. For 3887/3887 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 23006 event pairs, 1059 based on Foata normal form. 35/3694 useless extension candidates. Maximal degree in co-relation 10145. Up to 2113 conditions per place. [2025-03-09 06:21:02,724 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 59 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2025-03-09 06:21:02,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 97 transitions, 554 flow [2025-03-09 06:21:02,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-09 06:21:02,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-09 06:21:02,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-09 06:21:02,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2025-03-09 06:21:02,726 INFO L175 Difference]: Start difference. First operand has 110 places, 82 transitions, 343 flow. Second operand 5 states and 226 transitions. [2025-03-09 06:21:02,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 97 transitions, 554 flow [2025-03-09 06:21:02,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-09 06:21:02,734 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 361 flow [2025-03-09 06:21:02,735 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=361, PETRI_PLACES=111, PETRI_TRANSITIONS=81} [2025-03-09 06:21:02,735 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2025-03-09 06:21:02,735 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 361 flow [2025-03-09 06:21:02,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-09 06:21:02,735 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:02,736 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:02,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-09 06:21:02,736 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:02,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:02,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1675858379, now seen corresponding path program 1 times [2025-03-09 06:21:02,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:02,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465682404] [2025-03-09 06:21:02,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:02,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:02,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-09 06:21:02,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-09 06:21:02,763 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:02,763 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:03,237 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-09 06:21:03,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:03,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465682404] [2025-03-09 06:21:03,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465682404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:03,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:03,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:21:03,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016323567] [2025-03-09 06:21:03,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:03,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:21:03,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:03,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:21:03,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:21:03,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-09 06:21:03,274 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 81 transitions, 361 flow. Second operand has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 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-09 06:21:03,274 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:03,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-09 06:21:03,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:03,850 INFO L124 PetriNetUnfolderBase]: 1808/3867 cut-off events. [2025-03-09 06:21:03,851 INFO L125 PetriNetUnfolderBase]: For 4482/4484 co-relation queries the response was YES. [2025-03-09 06:21:03,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10741 conditions, 3867 events. 1808/3867 cut-off events. For 4482/4484 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 22667 event pairs, 265 based on Foata normal form. 26/3823 useless extension candidates. Maximal degree in co-relation 10715. Up to 972 conditions per place. [2025-03-09 06:21:03,878 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 141 selfloop transitions, 14 changer transitions 18/196 dead transitions. [2025-03-09 06:21:03,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 196 transitions, 1201 flow [2025-03-09 06:21:03,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:21:03,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:21:03,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 534 transitions. [2025-03-09 06:21:03,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4776386404293381 [2025-03-09 06:21:03,879 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 361 flow. Second operand 13 states and 534 transitions. [2025-03-09 06:21:03,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 196 transitions, 1201 flow [2025-03-09 06:21:03,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 1177 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-09 06:21:03,890 INFO L231 Difference]: Finished difference. Result has 122 places, 85 transitions, 394 flow [2025-03-09 06:21:03,890 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=394, PETRI_PLACES=122, PETRI_TRANSITIONS=85} [2025-03-09 06:21:03,891 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2025-03-09 06:21:03,891 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 85 transitions, 394 flow [2025-03-09 06:21:03,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.0) internal successors, (330), 10 states have internal predecessors, (330), 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-09 06:21:03,891 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:03,891 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:03,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-09 06:21:03,891 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:03,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:03,892 INFO L85 PathProgramCache]: Analyzing trace with hash 394201899, now seen corresponding path program 1 times [2025-03-09 06:21:03,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:03,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098686112] [2025-03-09 06:21:03,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:03,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:03,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:21:03,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:21:03,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:03,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:04,538 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-09 06:21:04,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098686112] [2025-03-09 06:21:04,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098686112] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:04,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229855615] [2025-03-09 06:21:04,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:04,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:04,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:04,542 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-09 06:21:04,543 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-09 06:21:04,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-09 06:21:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-09 06:21:04,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:04,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:04,662 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-09 06:21:04,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:04,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2025-03-09 06:21:04,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:04,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:04,787 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-09 06:21:04,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-03-09 06:21:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:04,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:04,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-03-09 06:21:04,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:04,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 27 [2025-03-09 06:21:05,004 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:05,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:05,024 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-09 06:21:05,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 47 [2025-03-09 06:21:05,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:05,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:05,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2025-03-09 06:21:05,105 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-09 06:21:05,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 16 [2025-03-09 06:21:05,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-03-09 06:21:05,193 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-09 06:21:05,193 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:10,251 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-09 06:21:10,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229855615] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:10,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:10,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-03-09 06:21:10,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158627941] [2025-03-09 06:21:10,252 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:10,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-09 06:21:10,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:10,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-09 06:21:10,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2025-03-09 06:21:14,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:21:15,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:21:15,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 85 transitions, 394 flow. Second operand has 28 states, 28 states have (on average 35.464285714285715) internal successors, (993), 28 states have internal predecessors, (993), 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-09 06:21:15,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:15,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:21:15,048 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:16,137 INFO L124 PetriNetUnfolderBase]: 1748/3799 cut-off events. [2025-03-09 06:21:16,137 INFO L125 PetriNetUnfolderBase]: For 4496/4498 co-relation queries the response was YES. [2025-03-09 06:21:16,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10787 conditions, 3799 events. 1748/3799 cut-off events. For 4496/4498 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 22193 event pairs, 258 based on Foata normal form. 26/3790 useless extension candidates. Maximal degree in co-relation 10758. Up to 926 conditions per place. [2025-03-09 06:21:16,159 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 139 selfloop transitions, 15 changer transitions 17/196 dead transitions. [2025-03-09 06:21:16,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 196 transitions, 1218 flow [2025-03-09 06:21:16,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:21:16,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:21:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 558 transitions. [2025-03-09 06:21:16,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4991055456171735 [2025-03-09 06:21:16,160 INFO L175 Difference]: Start difference. First operand has 122 places, 85 transitions, 394 flow. Second operand 13 states and 558 transitions. [2025-03-09 06:21:16,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 196 transitions, 1218 flow [2025-03-09 06:21:16,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 196 transitions, 1196 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-09 06:21:16,172 INFO L231 Difference]: Finished difference. Result has 126 places, 85 transitions, 407 flow [2025-03-09 06:21:16,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=407, PETRI_PLACES=126, PETRI_TRANSITIONS=85} [2025-03-09 06:21:16,172 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2025-03-09 06:21:16,172 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 85 transitions, 407 flow [2025-03-09 06:21:16,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 35.464285714285715) internal successors, (993), 28 states have internal predecessors, (993), 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-09 06:21:16,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:16,173 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:16,180 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-09 06:21:16,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:16,377 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:16,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:16,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1213459165, now seen corresponding path program 1 times [2025-03-09 06:21:16,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:16,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856634406] [2025-03-09 06:21:16,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:16,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:16,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-09 06:21:16,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-09 06:21:16,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:16,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:16,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:21:16,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:16,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856634406] [2025-03-09 06:21:16,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856634406] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:16,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:16,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-09 06:21:16,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280288440] [2025-03-09 06:21:16,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:16,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-09 06:21:16,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:16,636 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-09 06:21:16,636 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-09 06:21:16,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-09 06:21:16,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 85 transitions, 407 flow. Second operand has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 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-09 06:21:16,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:16,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-09 06:21:16,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:17,091 INFO L124 PetriNetUnfolderBase]: 1928/4172 cut-off events. [2025-03-09 06:21:17,091 INFO L125 PetriNetUnfolderBase]: For 4689/4689 co-relation queries the response was YES. [2025-03-09 06:21:17,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11880 conditions, 4172 events. 1928/4172 cut-off events. For 4689/4689 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24905 event pairs, 438 based on Foata normal form. 12/4160 useless extension candidates. Maximal degree in co-relation 11850. Up to 1823 conditions per place. [2025-03-09 06:21:17,114 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 102 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-09 06:21:17,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 143 transitions, 900 flow [2025-03-09 06:21:17,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:21:17,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:21:17,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-03-09 06:21:17,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2025-03-09 06:21:17,119 INFO L175 Difference]: Start difference. First operand has 126 places, 85 transitions, 407 flow. Second operand 8 states and 330 transitions. [2025-03-09 06:21:17,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 143 transitions, 900 flow [2025-03-09 06:21:17,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 872 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-09 06:21:17,129 INFO L231 Difference]: Finished difference. Result has 120 places, 87 transitions, 427 flow [2025-03-09 06:21:17,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=427, PETRI_PLACES=120, PETRI_TRANSITIONS=87} [2025-03-09 06:21:17,129 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2025-03-09 06:21:17,129 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 87 transitions, 427 flow [2025-03-09 06:21:17,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.42857142857143) internal successors, (241), 7 states have internal predecessors, (241), 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-09 06:21:17,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:17,130 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:17,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-09 06:21:17,130 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:17,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:17,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1549495869, now seen corresponding path program 1 times [2025-03-09 06:21:17,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:17,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590414059] [2025-03-09 06:21:17,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:17,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:17,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-09 06:21:17,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-09 06:21:17,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:17,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:18,274 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-09 06:21:18,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:18,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590414059] [2025-03-09 06:21:18,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590414059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:18,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:18,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-09 06:21:18,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573275214] [2025-03-09 06:21:18,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:18,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-09 06:21:18,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:18,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-09 06:21:18,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-09 06:21:18,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 86 [2025-03-09 06:21:18,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 87 transitions, 427 flow. Second operand has 15 states, 15 states have (on average 28.466666666666665) internal successors, (427), 15 states have internal predecessors, (427), 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-09 06:21:18,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:18,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 86 [2025-03-09 06:21:18,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:19,402 INFO L124 PetriNetUnfolderBase]: 2274/4901 cut-off events. [2025-03-09 06:21:19,402 INFO L125 PetriNetUnfolderBase]: For 5375/5375 co-relation queries the response was YES. [2025-03-09 06:21:19,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13753 conditions, 4901 events. 2274/4901 cut-off events. For 5375/5375 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 28320 event pairs, 411 based on Foata normal form. 12/4881 useless extension candidates. Maximal degree in co-relation 13723. Up to 1014 conditions per place. [2025-03-09 06:21:19,427 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 192 selfloop transitions, 20 changer transitions 12/247 dead transitions. [2025-03-09 06:21:19,427 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 247 transitions, 1605 flow [2025-03-09 06:21:19,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-09 06:21:19,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-09 06:21:19,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 594 transitions. [2025-03-09 06:21:19,429 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4316860465116279 [2025-03-09 06:21:19,429 INFO L175 Difference]: Start difference. First operand has 120 places, 87 transitions, 427 flow. Second operand 16 states and 594 transitions. [2025-03-09 06:21:19,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 247 transitions, 1605 flow [2025-03-09 06:21:19,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 247 transitions, 1578 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-09 06:21:19,442 INFO L231 Difference]: Finished difference. Result has 137 places, 94 transitions, 532 flow [2025-03-09 06:21:19,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=532, PETRI_PLACES=137, PETRI_TRANSITIONS=94} [2025-03-09 06:21:19,442 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 59 predicate places. [2025-03-09 06:21:19,443 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 94 transitions, 532 flow [2025-03-09 06:21:19,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 28.466666666666665) internal successors, (427), 15 states have internal predecessors, (427), 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-09 06:21:19,443 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:19,443 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:19,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-09 06:21:19,443 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:19,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:19,444 INFO L85 PathProgramCache]: Analyzing trace with hash -998562279, now seen corresponding path program 1 times [2025-03-09 06:21:19,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:19,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005153835] [2025-03-09 06:21:19,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:19,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:19,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:21:19,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:21:19,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:19,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:20,235 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-09 06:21:20,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005153835] [2025-03-09 06:21:20,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005153835] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:20,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627605273] [2025-03-09 06:21:20,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:20,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:20,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:20,238 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-09 06:21:20,240 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-09 06:21:20,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-09 06:21:20,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-09 06:21:20,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:20,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:20,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-09 06:21:20,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:20,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:21:20,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:20,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-09 06:21:20,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-09 06:21:20,647 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-09 06:21:20,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 56 [2025-03-09 06:21:20,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-09 06:21:20,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 06:21:20,700 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-09 06:21:20,700 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:20,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627605273] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:20,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:20,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2025-03-09 06:21:20,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662451768] [2025-03-09 06:21:20,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:20,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-09 06:21:20,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:20,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-09 06:21:20,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-09 06:21:20,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-09 06:21:20,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 94 transitions, 532 flow. Second operand has 9 states, 9 states have (on average 34.55555555555556) internal successors, (311), 9 states have internal predecessors, (311), 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-09 06:21:20,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:20,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-09 06:21:20,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:21,216 INFO L124 PetriNetUnfolderBase]: 2259/4906 cut-off events. [2025-03-09 06:21:21,217 INFO L125 PetriNetUnfolderBase]: For 6493/6493 co-relation queries the response was YES. [2025-03-09 06:21:21,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14217 conditions, 4906 events. 2259/4906 cut-off events. For 6493/6493 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 28654 event pairs, 1244 based on Foata normal form. 20/4890 useless extension candidates. Maximal degree in co-relation 14183. Up to 2457 conditions per place. [2025-03-09 06:21:21,247 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 71 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2025-03-09 06:21:21,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 118 transitions, 831 flow [2025-03-09 06:21:21,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:21:21,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:21:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-03-09 06:21:21,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4748062015503876 [2025-03-09 06:21:21,248 INFO L175 Difference]: Start difference. First operand has 137 places, 94 transitions, 532 flow. Second operand 6 states and 245 transitions. [2025-03-09 06:21:21,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 118 transitions, 831 flow [2025-03-09 06:21:21,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 803 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-09 06:21:21,261 INFO L231 Difference]: Finished difference. Result has 129 places, 93 transitions, 550 flow [2025-03-09 06:21:21,261 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=550, PETRI_PLACES=129, PETRI_TRANSITIONS=93} [2025-03-09 06:21:21,261 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 51 predicate places. [2025-03-09 06:21:21,261 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 93 transitions, 550 flow [2025-03-09 06:21:21,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.55555555555556) internal successors, (311), 9 states have internal predecessors, (311), 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-09 06:21:21,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:21,262 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:21,269 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-09 06:21:21,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:21,465 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:21,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash -206399880, now seen corresponding path program 1 times [2025-03-09 06:21:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210023996] [2025-03-09 06:21:21,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:21,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:21,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-09 06:21:21,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-09 06:21:21,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:21,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:22,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:22,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:22,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210023996] [2025-03-09 06:21:22,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210023996] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:22,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:22,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-09 06:21:22,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889861896] [2025-03-09 06:21:22,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:22,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-09 06:21:22,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:22,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-09 06:21:22,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-09 06:21:22,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:21:22,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 93 transitions, 550 flow. Second operand has 12 states, 12 states have (on average 35.25) internal successors, (423), 12 states have internal predecessors, (423), 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-09 06:21:22,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:22,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:21:22,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:23,094 INFO L124 PetriNetUnfolderBase]: 2327/5055 cut-off events. [2025-03-09 06:21:23,094 INFO L125 PetriNetUnfolderBase]: For 7558/7562 co-relation queries the response was YES. [2025-03-09 06:21:23,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14692 conditions, 5055 events. 2327/5055 cut-off events. For 7558/7562 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 29765 event pairs, 430 based on Foata normal form. 12/5027 useless extension candidates. Maximal degree in co-relation 14659. Up to 1362 conditions per place. [2025-03-09 06:21:23,123 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 151 selfloop transitions, 17 changer transitions 14/207 dead transitions. [2025-03-09 06:21:23,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 207 transitions, 1430 flow [2025-03-09 06:21:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-09 06:21:23,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-09 06:21:23,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 561 transitions. [2025-03-09 06:21:23,124 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.501788908765653 [2025-03-09 06:21:23,124 INFO L175 Difference]: Start difference. First operand has 129 places, 93 transitions, 550 flow. Second operand 13 states and 561 transitions. [2025-03-09 06:21:23,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 207 transitions, 1430 flow [2025-03-09 06:21:23,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 207 transitions, 1374 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-09 06:21:23,141 INFO L231 Difference]: Finished difference. Result has 141 places, 98 transitions, 599 flow [2025-03-09 06:21:23,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=599, PETRI_PLACES=141, PETRI_TRANSITIONS=98} [2025-03-09 06:21:23,142 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 63 predicate places. [2025-03-09 06:21:23,142 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 98 transitions, 599 flow [2025-03-09 06:21:23,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.25) internal successors, (423), 12 states have internal predecessors, (423), 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-09 06:21:23,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:23,142 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:23,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-09 06:21:23,142 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:23,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:23,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1045320147, now seen corresponding path program 1 times [2025-03-09 06:21:23,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:23,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141485574] [2025-03-09 06:21:23,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:23,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:23,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 06:21:23,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:21:23,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:23,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:24,186 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:24,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141485574] [2025-03-09 06:21:24,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141485574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:24,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1169553492] [2025-03-09 06:21:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:24,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:24,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:24,188 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-09 06:21:24,189 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-09 06:21:24,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-09 06:21:24,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-09 06:21:24,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:24,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:24,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-09 06:21:24,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:24,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2025-03-09 06:21:24,384 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:24,390 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 06:21:24,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 06:21:24,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:21:24,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-09 06:21:24,497 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:24,505 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-09 06:21:24,505 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 35 [2025-03-09 06:21:24,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:21:24,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 13 [2025-03-09 06:21:24,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:24,650 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:21:24,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:21:24,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2025-03-09 06:21:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:24,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:25,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:25,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1169553492] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:25,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:25,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2025-03-09 06:21:25,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881003988] [2025-03-09 06:21:25,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:25,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-09 06:21:25,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:25,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-09 06:21:25,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2025-03-09 06:21:25,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-09 06:21:25,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 98 transitions, 599 flow. Second operand has 36 states, 36 states have (on average 35.47222222222222) internal successors, (1277), 36 states have internal predecessors, (1277), 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-09 06:21:25,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:25,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-09 06:21:25,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:28,600 INFO L124 PetriNetUnfolderBase]: 2565/5645 cut-off events. [2025-03-09 06:21:28,600 INFO L125 PetriNetUnfolderBase]: For 8405/8405 co-relation queries the response was YES. [2025-03-09 06:21:28,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16252 conditions, 5645 events. 2565/5645 cut-off events. For 8405/8405 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 30661 event pairs, 426 based on Foata normal form. 28/5637 useless extension candidates. Maximal degree in co-relation 16215. Up to 881 conditions per place. [2025-03-09 06:21:28,646 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 236 selfloop transitions, 35 changer transitions 17/313 dead transitions. [2025-03-09 06:21:28,646 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 313 transitions, 2106 flow [2025-03-09 06:21:28,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-09 06:21:28,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-09 06:21:28,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1116 transitions. [2025-03-09 06:21:28,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2025-03-09 06:21:28,648 INFO L175 Difference]: Start difference. First operand has 141 places, 98 transitions, 599 flow. Second operand 27 states and 1116 transitions. [2025-03-09 06:21:28,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 313 transitions, 2106 flow [2025-03-09 06:21:28,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 313 transitions, 2050 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-03-09 06:21:28,663 INFO L231 Difference]: Finished difference. Result has 152 places, 106 transitions, 679 flow [2025-03-09 06:21:28,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=679, PETRI_PLACES=152, PETRI_TRANSITIONS=106} [2025-03-09 06:21:28,664 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 74 predicate places. [2025-03-09 06:21:28,664 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 106 transitions, 679 flow [2025-03-09 06:21:28,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 35.47222222222222) internal successors, (1277), 36 states have internal predecessors, (1277), 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-09 06:21:28,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:28,665 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:28,673 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-09 06:21:28,865 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,SelfDestructingSolverStorable26 [2025-03-09 06:21:28,866 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:28,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:28,866 INFO L85 PathProgramCache]: Analyzing trace with hash 562969654, now seen corresponding path program 1 times [2025-03-09 06:21:28,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:28,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216548786] [2025-03-09 06:21:28,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:28,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:28,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 06:21:28,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 06:21:28,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:28,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:30,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:30,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216548786] [2025-03-09 06:21:30,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216548786] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:30,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302959802] [2025-03-09 06:21:30,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:30,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:30,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:30,533 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-09 06:21:30,534 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-09 06:21:30,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-09 06:21:30,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-09 06:21:30,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:30,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:30,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-09 06:21:30,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:30,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-09 06:21:30,822 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-03-09 06:21:30,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:30,883 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-03-09 06:21:30,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 71 [2025-03-09 06:21:31,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-09 06:21:31,025 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-09 06:21:31,055 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-03-09 06:21:31,056 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 89 [2025-03-09 06:21:31,179 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-03-09 06:21:31,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 63 [2025-03-09 06:21:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2025-03-09 06:21:31,265 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-09 06:21:31,265 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-09 06:21:31,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302959802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:31,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-09 06:21:31,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 25 [2025-03-09 06:21:31,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310042124] [2025-03-09 06:21:31,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:31,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-09 06:21:31,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:31,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-09 06:21:31,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-03-09 06:21:31,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-03-09 06:21:31,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 106 transitions, 679 flow. Second operand has 11 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 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-09 06:21:31,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:31,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-03-09 06:21:31,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:31,929 INFO L124 PetriNetUnfolderBase]: 2615/5624 cut-off events. [2025-03-09 06:21:31,929 INFO L125 PetriNetUnfolderBase]: For 7890/7902 co-relation queries the response was YES. [2025-03-09 06:21:31,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16421 conditions, 5624 events. 2615/5624 cut-off events. For 7890/7902 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 30202 event pairs, 1163 based on Foata normal form. 36/5612 useless extension candidates. Maximal degree in co-relation 16385. Up to 2263 conditions per place. [2025-03-09 06:21:31,952 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 94 selfloop transitions, 35 changer transitions 1/153 dead transitions. [2025-03-09 06:21:31,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1146 flow [2025-03-09 06:21:31,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-09 06:21:31,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-09 06:21:31,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-03-09 06:21:31,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2025-03-09 06:21:31,953 INFO L175 Difference]: Start difference. First operand has 152 places, 106 transitions, 679 flow. Second operand 8 states and 330 transitions. [2025-03-09 06:21:31,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1146 flow [2025-03-09 06:21:31,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 153 transitions, 1058 flow, removed 21 selfloop flow, removed 18 redundant places. [2025-03-09 06:21:31,967 INFO L231 Difference]: Finished difference. Result has 140 places, 105 transitions, 657 flow [2025-03-09 06:21:31,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=657, PETRI_PLACES=140, PETRI_TRANSITIONS=105} [2025-03-09 06:21:31,968 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 62 predicate places. [2025-03-09 06:21:31,968 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 657 flow [2025-03-09 06:21:31,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.36363636363637) internal successors, (389), 11 states have internal predecessors, (389), 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-09 06:21:31,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:31,968 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:31,974 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-09 06:21:32,169 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,SelfDestructingSolverStorable27 [2025-03-09 06:21:32,169 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:32,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:32,170 INFO L85 PathProgramCache]: Analyzing trace with hash -932074256, now seen corresponding path program 1 times [2025-03-09 06:21:32,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:32,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554592328] [2025-03-09 06:21:32,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:32,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:32,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-09 06:21:32,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-09 06:21:32,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:32,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:32,808 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:32,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:32,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554592328] [2025-03-09 06:21:32,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554592328] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-09 06:21:32,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-09 06:21:32,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-09 06:21:32,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196119216] [2025-03-09 06:21:32,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-09 06:21:32,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-09 06:21:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:32,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-09 06:21:32,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-09 06:21:32,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-03-09 06:21:32,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 105 transitions, 657 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 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-09 06:21:32,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:32,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-03-09 06:21:32,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:33,416 INFO L124 PetriNetUnfolderBase]: 2585/5672 cut-off events. [2025-03-09 06:21:33,417 INFO L125 PetriNetUnfolderBase]: For 7616/7616 co-relation queries the response was YES. [2025-03-09 06:21:33,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16301 conditions, 5672 events. 2585/5672 cut-off events. For 7616/7616 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 30938 event pairs, 1442 based on Foata normal form. 27/5634 useless extension candidates. Maximal degree in co-relation 16270. Up to 2837 conditions per place. [2025-03-09 06:21:33,444 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 78 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2025-03-09 06:21:33,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 963 flow [2025-03-09 06:21:33,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-09 06:21:33,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-09 06:21:33,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2025-03-09 06:21:33,446 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2025-03-09 06:21:33,446 INFO L175 Difference]: Start difference. First operand has 140 places, 105 transitions, 657 flow. Second operand 6 states and 261 transitions. [2025-03-09 06:21:33,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 127 transitions, 963 flow [2025-03-09 06:21:33,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 127 transitions, 905 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-09 06:21:33,459 INFO L231 Difference]: Finished difference. Result has 138 places, 104 transitions, 647 flow [2025-03-09 06:21:33,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=647, PETRI_PLACES=138, PETRI_TRANSITIONS=104} [2025-03-09 06:21:33,460 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2025-03-09 06:21:33,460 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 647 flow [2025-03-09 06:21:33,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 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-09 06:21:33,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:21:33,461 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:21:33,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-09 06:21:33,461 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:21:33,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:21:33,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1037194721, now seen corresponding path program 1 times [2025-03-09 06:21:33,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:21:33,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309609460] [2025-03-09 06:21:33,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:33,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:21:33,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 06:21:33,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 06:21:33,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:33,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:34,839 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:34,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:21:34,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309609460] [2025-03-09 06:21:34,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309609460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:21:34,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1227931335] [2025-03-09 06:21:34,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:21:34,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:21:34,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:21:34,841 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-09 06:21:34,842 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-09 06:21:34,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-09 06:21:34,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-09 06:21:34,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:21:34,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:21:34,987 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-09 06:21:34,993 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:21:34,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2025-03-09 06:21:35,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-09 06:21:35,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,376 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2025-03-09 06:21:35,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-09 06:21:35,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:21:35,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-09 06:21:35,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-09 06:21:35,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:21:35,820 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:35,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-09 06:21:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:21:42,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1227931335] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-09 06:21:42,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-09 06:21:42,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 19] total 50 [2025-03-09 06:21:42,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708861039] [2025-03-09 06:21:42,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-09 06:21:42,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-09 06:21:42,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-09 06:21:42,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-09 06:21:42,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2142, Unknown=1, NotChecked=0, Total=2652 [2025-03-09 06:21:42,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-09 06:21:42,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 104 transitions, 647 flow. Second operand has 52 states, 52 states have (on average 32.82692307692308) internal successors, (1707), 52 states have internal predecessors, (1707), 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-09 06:21:42,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-09 06:21:42,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-09 06:21:42,764 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-09 06:21:49,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:22:03,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-09 06:22:04,865 INFO L124 PetriNetUnfolderBase]: 2824/6108 cut-off events. [2025-03-09 06:22:04,865 INFO L125 PetriNetUnfolderBase]: For 8076/8076 co-relation queries the response was YES. [2025-03-09 06:22:04,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17404 conditions, 6108 events. 2824/6108 cut-off events. For 8076/8076 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 32919 event pairs, 369 based on Foata normal form. 0/6069 useless extension candidates. Maximal degree in co-relation 17374. Up to 906 conditions per place. [2025-03-09 06:22:04,887 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 314 selfloop transitions, 53 changer transitions 59/448 dead transitions. [2025-03-09 06:22:04,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 448 transitions, 2960 flow [2025-03-09 06:22:04,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-09 06:22:04,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-09 06:22:04,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1764 transitions. [2025-03-09 06:22:04,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44590495449949447 [2025-03-09 06:22:04,889 INFO L175 Difference]: Start difference. First operand has 138 places, 104 transitions, 647 flow. Second operand 46 states and 1764 transitions. [2025-03-09 06:22:04,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 448 transitions, 2960 flow [2025-03-09 06:22:04,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 448 transitions, 2890 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-09 06:22:04,905 INFO L231 Difference]: Finished difference. Result has 184 places, 119 transitions, 822 flow [2025-03-09 06:22:04,905 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=86, PETRI_DIFFERENCE_MINUEND_FLOW=591, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=41, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=822, PETRI_PLACES=184, PETRI_TRANSITIONS=119} [2025-03-09 06:22:04,905 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 106 predicate places. [2025-03-09 06:22:04,905 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 119 transitions, 822 flow [2025-03-09 06:22:04,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 32.82692307692308) internal successors, (1707), 52 states have internal predecessors, (1707), 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-09 06:22:04,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-09 06:22:04,906 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-09 06:22:04,912 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-09 06:22:05,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:05,106 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-09 06:22:05,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-09 06:22:05,107 INFO L85 PathProgramCache]: Analyzing trace with hash 530635870, now seen corresponding path program 1 times [2025-03-09 06:22:05,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-09 06:22:05,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009597335] [2025-03-09 06:22:05,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:05,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-09 06:22:05,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:22:05,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:22:05,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:05,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:06,811 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:06,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-09 06:22:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009597335] [2025-03-09 06:22:06,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009597335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-09 06:22:06,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123596767] [2025-03-09 06:22:06,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-09 06:22:06,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-09 06:22:06,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-09 06:22:06,813 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-09 06:22:06,814 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-09 06:22:06,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-09 06:22:06,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-09 06:22:06,964 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-09 06:22:06,964 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-09 06:22:06,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-09 06:22:06,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-09 06:22:06,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 1 [2025-03-09 06:22:07,106 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-09 06:22:07,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-03-09 06:22:07,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:22:07,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-09 06:22:07,583 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-09 06:22:07,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-03-09 06:22:07,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:22:07,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-09 06:22:07,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:22:08,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-03-09 06:22:08,233 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-09 06:22:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-03-09 06:22:08,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-09 06:22:08,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-03-09 06:22:08,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-09 06:22:08,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-09 06:22:08,704 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-09 06:22:08,705 INFO L312 TraceCheckSpWp]: Computing backward predicates...