./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/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-?-798a7b3-m [2025-03-04 15:07:31,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:07:31,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:07:31,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:07:31,222 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:07:31,240 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:07:31,241 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:07:31,241 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:07:31,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:07:31,242 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:07:31,242 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:07:31,242 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:07:31,243 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:07:31,243 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:07:31,243 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:07:31,243 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:07:31,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:07:31,245 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:07:31,245 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:07:31,245 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:07:31,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:07:31,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:07:31,245 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:07:31,245 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:07:31,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:07:31,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:07:31,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:07:31,247 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-04 15:07:31,456 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:07:31,462 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:07:31,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:07:31,464 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:07:31,464 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:07:31,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-03-04 15:07:32,604 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7b725ab/22f70cdbafba4f6088c535a40b666d0a/FLAG1eec502a0 [2025-03-04 15:07:32,880 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:07:32,882 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-03-04 15:07:32,894 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7b725ab/22f70cdbafba4f6088c535a40b666d0a/FLAG1eec502a0 [2025-03-04 15:07:33,171 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d7b725ab/22f70cdbafba4f6088c535a40b666d0a [2025-03-04 15:07:33,173 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:07:33,174 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:07:33,175 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:07:33,175 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:07:33,178 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:07:33,179 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,179 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d7ee0d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33, skipping insertion in model container [2025-03-04 15:07:33,180 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,213 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:07:33,450 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:07:33,461 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:07:33,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:07:33,565 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:07:33,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33 WrapperNode [2025-03-04 15:07:33,565 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:07:33,566 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:07:33,566 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:07:33,566 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:07:33,570 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,583 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,601 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 307 [2025-03-04 15:07:33,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:07:33,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:07:33,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:07:33,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:07:33,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,612 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,630 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-04 15:07:33,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,635 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,647 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,653 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,654 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,658 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:07:33,659 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:07:33,659 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:07:33,659 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:07:33,660 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (1/1) ... [2025-03-04 15:07:33,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:07:33,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:33,685 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:07:33,688 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:07:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-03-04 15:07:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-03-04 15:07:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-03-04 15:07:33,705 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-03-04 15:07:33,705 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 15:07:33,706 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 15:07:33,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:07:33,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:07:33,709 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:07:33,838 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:07:33,840 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:07:34,249 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:07:34,250 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:07:34,508 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:07:34,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:07:34,509 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:07:34 BoogieIcfgContainer [2025-03-04 15:07:34,509 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:07:34,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:07:34,510 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:07:34,513 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:07:34,513 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:07:33" (1/3) ... [2025-03-04 15:07:34,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4befde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:07:34, skipping insertion in model container [2025-03-04 15:07:34,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:07:33" (2/3) ... [2025-03-04 15:07:34,514 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f4befde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:07:34, skipping insertion in model container [2025-03-04 15:07:34,514 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:07:34" (3/3) ... [2025-03-04 15:07:34,515 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-03-04 15:07:34,526 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:07:34,527 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-04 15:07:34,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:07:34,600 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:07:34,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-03-04 15:07:34,664 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-03-04 15:07:34,668 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:07:34,672 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-04 15:07:34,672 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-03-04 15:07:34,674 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 80 transitions, 169 flow [2025-03-04 15:07:34,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:07:34,691 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;@5a2d40d7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:07:34,692 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-04 15:07:34,698 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:07:34,698 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-03-04 15:07:34,699 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:07:34,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:34,699 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:34,699 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:34,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:34,703 INFO L85 PathProgramCache]: Analyzing trace with hash -1490407634, now seen corresponding path program 1 times [2025-03-04 15:07:34,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:34,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306077795] [2025-03-04 15:07:34,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:34,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:34,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:07:34,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:07:34,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:34,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:35,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:35,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:35,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306077795] [2025-03-04 15:07:35,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306077795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:35,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:35,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:35,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970774581] [2025-03-04 15:07:35,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:35,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:35,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:35,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:35,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:35,345 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:07:35,347 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-04 15:07:35,348 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:35,348 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:07:35,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:35,748 INFO L124 PetriNetUnfolderBase]: 1236/2529 cut-off events. [2025-03-04 15:07:35,748 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-03-04 15:07:35,753 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-04 15:07:35,766 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 74 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2025-03-04 15:07:35,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 395 flow [2025-03-04 15:07:35,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:35,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-03-04 15:07:35,775 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-03-04 15:07:35,776 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 169 flow. Second operand 4 states and 210 transitions. [2025-03-04 15:07:35,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 395 flow [2025-03-04 15:07:35,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:07:35,782 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 204 flow [2025-03-04 15:07:35,784 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-04 15:07:35,787 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-03-04 15:07:35,788 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 204 flow [2025-03-04 15:07:35,788 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-04 15:07:35,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:35,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:35,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:07:35,789 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:35,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:35,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1042004321, now seen corresponding path program 1 times [2025-03-04 15:07:35,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:35,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903237243] [2025-03-04 15:07:35,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:35,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:35,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 15:07:35,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 15:07:35,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:35,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:36,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:36,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903237243] [2025-03-04 15:07:36,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903237243] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:36,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:36,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:36,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756565972] [2025-03-04 15:07:36,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:36,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:36,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:36,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:36,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:36,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:07:36,115 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-04 15:07:36,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:36,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:07:36,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:36,502 INFO L124 PetriNetUnfolderBase]: 1242/2582 cut-off events. [2025-03-04 15:07:36,502 INFO L125 PetriNetUnfolderBase]: For 454/457 co-relation queries the response was YES. [2025-03-04 15:07:36,505 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-04 15:07:36,512 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 82 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-03-04 15:07:36,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 460 flow [2025-03-04 15:07:36,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:07:36,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:07:36,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2025-03-04 15:07:36,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-04 15:07:36,518 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 204 flow. Second operand 5 states and 250 transitions. [2025-03-04 15:07:36,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 460 flow [2025-03-04 15:07:36,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 118 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:36,523 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 221 flow [2025-03-04 15:07:36,523 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-04 15:07:36,524 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-03-04 15:07:36,524 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 221 flow [2025-03-04 15:07:36,525 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-04 15:07:36,525 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:36,525 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:36,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 15:07:36,525 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:36,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:36,526 INFO L85 PathProgramCache]: Analyzing trace with hash 638797541, now seen corresponding path program 1 times [2025-03-04 15:07:36,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:36,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151247617] [2025-03-04 15:07:36,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:36,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:07:36,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:07:36,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:36,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:36,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:36,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:36,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151247617] [2025-03-04 15:07:36,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151247617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:36,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:36,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:36,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759847119] [2025-03-04 15:07:36,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:36,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:36,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:36,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:36,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:07:36,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:07:36,719 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-04 15:07:36,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:36,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:07:36,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:37,066 INFO L124 PetriNetUnfolderBase]: 1322/2692 cut-off events. [2025-03-04 15:07:37,066 INFO L125 PetriNetUnfolderBase]: For 532/548 co-relation queries the response was YES. [2025-03-04 15:07:37,070 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-04 15:07:37,079 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 103 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-03-04 15:07:37,079 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 589 flow [2025-03-04 15:07:37,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:07:37,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:07:37,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-03-04 15:07:37,081 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664451827242525 [2025-03-04 15:07:37,081 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 221 flow. Second operand 7 states and 341 transitions. [2025-03-04 15:07:37,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 589 flow [2025-03-04 15:07:37,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 144 transitions, 575 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-04 15:07:37,085 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 276 flow [2025-03-04 15:07:37,085 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-04 15:07:37,086 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-04 15:07:37,086 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 276 flow [2025-03-04 15:07:37,086 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-04 15:07:37,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:37,086 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:37,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 15:07:37,086 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:37,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:37,088 INFO L85 PathProgramCache]: Analyzing trace with hash -846753598, now seen corresponding path program 1 times [2025-03-04 15:07:37,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:37,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718619180] [2025-03-04 15:07:37,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:37,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:07:37,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:07:37,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:37,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:37,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:37,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:37,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718619180] [2025-03-04 15:07:37,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718619180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:37,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:37,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:07:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140994984] [2025-03-04 15:07:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:37,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:07:37,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:37,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:07:37,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:07:37,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-04 15:07:37,164 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-04 15:07:37,164 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:37,164 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-04 15:07:37,164 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:37,409 INFO L124 PetriNetUnfolderBase]: 1023/2377 cut-off events. [2025-03-04 15:07:37,409 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-03-04 15:07:37,412 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-04 15:07:37,421 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 64 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-03-04 15:07:37,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 97 transitions, 374 flow [2025-03-04 15:07:37,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:07:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:07:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-03-04 15:07:37,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-03-04 15:07:37,426 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 276 flow. Second operand 3 states and 176 transitions. [2025-03-04 15:07:37,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 97 transitions, 374 flow [2025-03-04 15:07:37,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 335 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-03-04 15:07:37,430 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 169 flow [2025-03-04 15:07:37,430 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-04 15:07:37,431 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-03-04 15:07:37,431 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 169 flow [2025-03-04 15:07:37,431 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-04 15:07:37,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:37,431 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:37,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:07:37,432 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:37,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:37,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1981394715, now seen corresponding path program 1 times [2025-03-04 15:07:37,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:37,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308255907] [2025-03-04 15:07:37,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:37,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:37,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-04 15:07:37,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-04 15:07:37,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:37,447 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:37,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:37,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:37,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308255907] [2025-03-04 15:07:37,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308255907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:37,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:37,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:37,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018146796] [2025-03-04 15:07:37,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:37,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:37,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:37,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:37,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:37,497 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-03-04 15:07:37,497 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-04 15:07:37,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:37,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-03-04 15:07:37,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:37,964 INFO L124 PetriNetUnfolderBase]: 1890/4135 cut-off events. [2025-03-04 15:07:37,965 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-03-04 15:07:37,968 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-04 15:07:37,980 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 113 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-03-04 15:07:37,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 144 transitions, 554 flow [2025-03-04 15:07:37,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:37,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-03-04 15:07:37,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-03-04 15:07:37,981 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 169 flow. Second operand 4 states and 252 transitions. [2025-03-04 15:07:37,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 144 transitions, 554 flow [2025-03-04 15:07:37,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 144 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:37,986 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 190 flow [2025-03-04 15:07:37,987 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-04 15:07:37,987 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-03-04 15:07:37,988 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 190 flow [2025-03-04 15:07:37,988 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-04 15:07:37,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:37,988 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-04 15:07:37,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:07:37,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:37,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:37,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1160182554, now seen corresponding path program 1 times [2025-03-04 15:07:37,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:37,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531777393] [2025-03-04 15:07:37,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:37,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:38,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-04 15:07:38,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-04 15:07:38,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:38,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:38,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:38,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:38,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531777393] [2025-03-04 15:07:38,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531777393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:38,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:38,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:07:38,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443896536] [2025-03-04 15:07:38,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:38,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:38,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:38,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:38,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:07:38,217 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-04 15:07:38,217 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-04 15:07:38,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:38,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-04 15:07:38,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:38,558 INFO L124 PetriNetUnfolderBase]: 1715/3852 cut-off events. [2025-03-04 15:07:38,558 INFO L125 PetriNetUnfolderBase]: For 790/910 co-relation queries the response was YES. [2025-03-04 15:07:38,562 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-04 15:07:38,573 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 75 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-03-04 15:07:38,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 468 flow [2025-03-04 15:07:38,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:07:38,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:07:38,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2025-03-04 15:07:38,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2025-03-04 15:07:38,575 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 190 flow. Second operand 5 states and 252 transitions. [2025-03-04 15:07:38,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 468 flow [2025-03-04 15:07:38,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:38,577 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 196 flow [2025-03-04 15:07:38,577 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-04 15:07:38,578 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-03-04 15:07:38,578 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 196 flow [2025-03-04 15:07:38,578 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-04 15:07:38,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:38,578 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-04 15:07:38,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:07:38,578 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:38,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:38,579 INFO L85 PathProgramCache]: Analyzing trace with hash 898811421, now seen corresponding path program 1 times [2025-03-04 15:07:38,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:38,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028950272] [2025-03-04 15:07:38,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:38,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:38,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:07:38,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:07:38,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:38,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:39,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:39,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:39,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028950272] [2025-03-04 15:07:39,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028950272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:39,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:39,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:39,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932839878] [2025-03-04 15:07:39,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:39,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:39,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:39,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:39,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:39,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-04 15:07:39,374 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-04 15:07:39,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:39,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-04 15:07:39,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:39,935 INFO L124 PetriNetUnfolderBase]: 2309/4799 cut-off events. [2025-03-04 15:07:39,935 INFO L125 PetriNetUnfolderBase]: For 925/1077 co-relation queries the response was YES. [2025-03-04 15:07:39,941 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-04 15:07:39,954 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 135 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-03-04 15:07:39,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 169 transitions, 783 flow [2025-03-04 15:07:39,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:07:39,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:07:39,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 379 transitions. [2025-03-04 15:07:39,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4896640826873385 [2025-03-04 15:07:39,956 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 196 flow. Second operand 9 states and 379 transitions. [2025-03-04 15:07:39,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 169 transitions, 783 flow [2025-03-04 15:07:39,960 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 169 transitions, 773 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:39,964 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 223 flow [2025-03-04 15:07:39,964 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-04 15:07:39,964 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2025-03-04 15:07:39,965 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 223 flow [2025-03-04 15:07:39,965 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-04 15:07:39,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:39,965 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:39,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 15:07:39,965 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:39,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:39,965 INFO L85 PathProgramCache]: Analyzing trace with hash -165116390, now seen corresponding path program 1 times [2025-03-04 15:07:39,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:39,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377298671] [2025-03-04 15:07:39,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:39,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:39,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:07:39,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:07:39,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:39,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:40,024 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-04 15:07:40,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377298671] [2025-03-04 15:07:40,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377298671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:40,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117344294] [2025-03-04 15:07:40,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:40,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:40,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:40,027 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:07:40,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:07:40,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-04 15:07:40,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-04 15:07:40,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:40,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:40,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:07:40,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:40,171 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-04 15:07:40,172 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:07:40,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117344294] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:40,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:07:40,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:07:40,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831001173] [2025-03-04 15:07:40,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:40,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:40,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:40,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:40,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:07:40,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-03-04 15:07:40,179 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-04 15:07:40,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:40,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-03-04 15:07:40,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:40,540 INFO L124 PetriNetUnfolderBase]: 2140/4297 cut-off events. [2025-03-04 15:07:40,541 INFO L125 PetriNetUnfolderBase]: For 819/903 co-relation queries the response was YES. [2025-03-04 15:07:40,547 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-04 15:07:40,559 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 106 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-03-04 15:07:40,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 613 flow [2025-03-04 15:07:40,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-04 15:07:40,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-03-04 15:07:40,560 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 223 flow. Second operand 4 states and 233 transitions. [2025-03-04 15:07:40,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 613 flow [2025-03-04 15:07:40,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 139 transitions, 591 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:40,564 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 221 flow [2025-03-04 15:07:40,564 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-04 15:07:40,565 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2025-03-04 15:07:40,565 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 221 flow [2025-03-04 15:07:40,565 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-04 15:07:40,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:40,565 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-04 15:07:40,572 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-04 15:07:40,766 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-04 15:07:40,766 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:40,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:40,766 INFO L85 PathProgramCache]: Analyzing trace with hash 2093351021, now seen corresponding path program 1 times [2025-03-04 15:07:40,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:40,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263292211] [2025-03-04 15:07:40,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:40,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:40,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:07:40,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:07:40,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:40,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:41,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:41,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:41,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263292211] [2025-03-04 15:07:41,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263292211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:41,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:41,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:41,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431596820] [2025-03-04 15:07:41,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:41,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:41,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:41,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:41,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:41,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-03-04 15:07:41,361 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-04 15:07:41,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:41,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-03-04 15:07:41,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:41,994 INFO L124 PetriNetUnfolderBase]: 2277/4734 cut-off events. [2025-03-04 15:07:41,994 INFO L125 PetriNetUnfolderBase]: For 2384/2456 co-relation queries the response was YES. [2025-03-04 15:07:42,002 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-04 15:07:42,017 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 134 selfloop transitions, 8 changer transitions 0/167 dead transitions. [2025-03-04 15:07:42,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 167 transitions, 866 flow [2025-03-04 15:07:42,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 15:07:42,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 15:07:42,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-03-04 15:07:42,019 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2025-03-04 15:07:42,019 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 221 flow. Second operand 9 states and 378 transitions. [2025-03-04 15:07:42,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 167 transitions, 866 flow [2025-03-04 15:07:42,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 167 transitions, 783 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:42,025 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 220 flow [2025-03-04 15:07:42,025 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-04 15:07:42,026 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-03-04 15:07:42,026 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 220 flow [2025-03-04 15:07:42,026 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-04 15:07:42,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:42,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:07:42,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:07:42,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:42,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:42,027 INFO L85 PathProgramCache]: Analyzing trace with hash -823640014, now seen corresponding path program 1 times [2025-03-04 15:07:42,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:42,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110844974] [2025-03-04 15:07:42,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:42,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:42,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 15:07:42,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 15:07:42,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:42,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:42,063 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-04 15:07:42,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:42,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110844974] [2025-03-04 15:07:42,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110844974] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:42,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:42,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:42,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456112777] [2025-03-04 15:07:42,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:42,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:42,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:42,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:42,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:42,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-03-04 15:07:42,069 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-04 15:07:42,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:42,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-03-04 15:07:42,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:42,419 INFO L124 PetriNetUnfolderBase]: 1994/4203 cut-off events. [2025-03-04 15:07:42,420 INFO L125 PetriNetUnfolderBase]: For 1066/1110 co-relation queries the response was YES. [2025-03-04 15:07:42,424 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-04 15:07:42,432 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 99 selfloop transitions, 6 changer transitions 6/138 dead transitions. [2025-03-04 15:07:42,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 620 flow [2025-03-04 15:07:42,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:42,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-03-04 15:07:42,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-03-04 15:07:42,435 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 220 flow. Second operand 4 states and 233 transitions. [2025-03-04 15:07:42,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 620 flow [2025-03-04 15:07:42,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 586 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:07:42,439 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 220 flow [2025-03-04 15:07:42,439 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-04 15:07:42,440 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2025-03-04 15:07:42,440 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 220 flow [2025-03-04 15:07:42,441 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-04 15:07:42,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:42,441 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-04 15:07:42,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:07:42,441 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:42,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:42,441 INFO L85 PathProgramCache]: Analyzing trace with hash 469342208, now seen corresponding path program 1 times [2025-03-04 15:07:42,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:42,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084893047] [2025-03-04 15:07:42,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:42,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:42,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-04 15:07:42,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-04 15:07:42,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:42,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:42,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:42,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084893047] [2025-03-04 15:07:42,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084893047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:42,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:42,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:42,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899977334] [2025-03-04 15:07:42,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:42,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:42,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:42,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:42,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:42,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:07:42,498 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-04 15:07:42,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:42,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:07:42,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:42,957 INFO L124 PetriNetUnfolderBase]: 2829/5808 cut-off events. [2025-03-04 15:07:42,957 INFO L125 PetriNetUnfolderBase]: For 3596/3606 co-relation queries the response was YES. [2025-03-04 15:07:42,964 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-04 15:07:42,978 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 93 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-03-04 15:07:42,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 578 flow [2025-03-04 15:07:42,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:42,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:42,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-03-04 15:07:42,980 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-03-04 15:07:42,980 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 220 flow. Second operand 4 states and 220 transitions. [2025-03-04 15:07:42,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 578 flow [2025-03-04 15:07:42,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:07:42,986 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 240 flow [2025-03-04 15:07:42,986 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-04 15:07:42,986 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 12 predicate places. [2025-03-04 15:07:42,986 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 240 flow [2025-03-04 15:07:42,987 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-04 15:07:42,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:42,987 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-04 15:07:42,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:07:42,987 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1665662611, now seen corresponding path program 1 times [2025-03-04 15:07:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486272428] [2025-03-04 15:07:42,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:42,997 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-04 15:07:43,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-04 15:07:43,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:43,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:43,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:43,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:43,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486272428] [2025-03-04 15:07:43,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486272428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:43,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:43,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:43,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202939979] [2025-03-04 15:07:43,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:43,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:43,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:43,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:43,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:43,340 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-04 15:07:43,342 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-04 15:07:43,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:43,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-04 15:07:43,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:43,965 INFO L124 PetriNetUnfolderBase]: 2968/6034 cut-off events. [2025-03-04 15:07:43,965 INFO L125 PetriNetUnfolderBase]: For 2660/2726 co-relation queries the response was YES. [2025-03-04 15:07:43,976 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-04 15:07:43,993 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 15 changer transitions 2/192 dead transitions. [2025-03-04 15:07:43,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 1000 flow [2025-03-04 15:07:43,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:07:43,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:07:43,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2025-03-04 15:07:43,995 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174418604651163 [2025-03-04 15:07:43,995 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 240 flow. Second operand 10 states and 445 transitions. [2025-03-04 15:07:43,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 1000 flow [2025-03-04 15:07:44,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 192 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:44,002 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 312 flow [2025-03-04 15:07:44,003 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-04 15:07:44,003 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-03-04 15:07:44,003 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 312 flow [2025-03-04 15:07:44,003 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-04 15:07:44,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:44,004 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-04 15:07:44,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 15:07:44,004 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:44,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:44,004 INFO L85 PathProgramCache]: Analyzing trace with hash 95934146, now seen corresponding path program 1 times [2025-03-04 15:07:44,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:44,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622871264] [2025-03-04 15:07:44,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:44,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:44,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-04 15:07:44,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-04 15:07:44,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:44,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:44,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:44,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:44,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622871264] [2025-03-04 15:07:44,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622871264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:44,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:44,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:07:44,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662322141] [2025-03-04 15:07:44,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:44,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:44,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:44,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:44,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:44,360 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:07:44,361 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-04 15:07:44,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:44,361 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:07:44,361 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:44,924 INFO L124 PetriNetUnfolderBase]: 2853/5963 cut-off events. [2025-03-04 15:07:44,924 INFO L125 PetriNetUnfolderBase]: For 3464/3530 co-relation queries the response was YES. [2025-03-04 15:07:44,938 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-04 15:07:44,956 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 14 changer transitions 2/194 dead transitions. [2025-03-04 15:07:44,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 194 transitions, 1075 flow [2025-03-04 15:07:44,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:07:44,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:07:44,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2025-03-04 15:07:44,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536046511627907 [2025-03-04 15:07:44,958 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 312 flow. Second operand 10 states and 461 transitions. [2025-03-04 15:07:44,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 194 transitions, 1075 flow [2025-03-04 15:07:44,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 194 transitions, 1063 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:07:44,967 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 362 flow [2025-03-04 15:07:44,968 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-04 15:07:44,968 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2025-03-04 15:07:44,968 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 362 flow [2025-03-04 15:07:44,968 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-04 15:07:44,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:44,969 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-04 15:07:44,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:07:44,969 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:44,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:44,969 INFO L85 PathProgramCache]: Analyzing trace with hash 202224693, now seen corresponding path program 1 times [2025-03-04 15:07:44,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:44,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016485291] [2025-03-04 15:07:44,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:44,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:44,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:07:44,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:07:44,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:44,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:45,024 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-04 15:07:45,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016485291] [2025-03-04 15:07:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016485291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:45,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40151099] [2025-03-04 15:07:45,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:45,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:45,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:45,027 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:07:45,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:07:45,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-04 15:07:45,119 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-04 15:07:45,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:45,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:45,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:07:45,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:45,148 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-04 15:07:45,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:07:45,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40151099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:45,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:07:45,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-03-04 15:07:45,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352771068] [2025-03-04 15:07:45,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:45,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:07:45,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:45,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:07:45,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:07:45,158 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-03-04 15:07:45,159 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-04 15:07:45,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:45,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-03-04 15:07:45,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:45,592 INFO L124 PetriNetUnfolderBase]: 3140/6153 cut-off events. [2025-03-04 15:07:45,592 INFO L125 PetriNetUnfolderBase]: For 4513/4547 co-relation queries the response was YES. [2025-03-04 15:07:45,606 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-04 15:07:45,624 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 84 selfloop transitions, 5 changer transitions 0/114 dead transitions. [2025-03-04 15:07:45,624 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 640 flow [2025-03-04 15:07:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:45,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:45,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-03-04 15:07:45,625 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2025-03-04 15:07:45,626 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 362 flow. Second operand 4 states and 195 transitions. [2025-03-04 15:07:45,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 640 flow [2025-03-04 15:07:45,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 622 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-03-04 15:07:45,639 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 346 flow [2025-03-04 15:07:45,639 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-04 15:07:45,640 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-03-04 15:07:45,640 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 346 flow [2025-03-04 15:07:45,640 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-04 15:07:45,640 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:45,640 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-04 15:07:45,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:07:45,841 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-04 15:07:45,841 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:45,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:45,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1973998939, now seen corresponding path program 1 times [2025-03-04 15:07:45,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:45,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844334446] [2025-03-04 15:07:45,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:45,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:45,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-04 15:07:45,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-04 15:07:45,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:45,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:45,885 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-04 15:07:45,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:45,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844334446] [2025-03-04 15:07:45,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844334446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:45,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:45,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:45,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982559499] [2025-03-04 15:07:45,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:45,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:07:45,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:45,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:07:45,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:07:45,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-03-04 15:07:45,898 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-04 15:07:45,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:45,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-03-04 15:07:45,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:46,305 INFO L124 PetriNetUnfolderBase]: 2784/5687 cut-off events. [2025-03-04 15:07:46,306 INFO L125 PetriNetUnfolderBase]: For 4472/4492 co-relation queries the response was YES. [2025-03-04 15:07:46,319 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-04 15:07:46,333 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 88 selfloop transitions, 6 changer transitions 0/119 dead transitions. [2025-03-04 15:07:46,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 656 flow [2025-03-04 15:07:46,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:07:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:07:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-03-04 15:07:46,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-03-04 15:07:46,335 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 346 flow. Second operand 4 states and 200 transitions. [2025-03-04 15:07:46,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 656 flow [2025-03-04 15:07:46,344 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 646 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:07:46,345 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 348 flow [2025-03-04 15:07:46,345 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-04 15:07:46,345 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2025-03-04 15:07:46,345 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 348 flow [2025-03-04 15:07:46,346 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-04 15:07:46,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:46,346 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-04 15:07:46,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:07:46,346 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:46,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:46,346 INFO L85 PathProgramCache]: Analyzing trace with hash -886420645, now seen corresponding path program 1 times [2025-03-04 15:07:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:46,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407594947] [2025-03-04 15:07:46,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:46,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:46,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-04 15:07:46,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-04 15:07:46,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:46,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:46,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:46,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:46,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407594947] [2025-03-04 15:07:46,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407594947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:46,401 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:46,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:46,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156006544] [2025-03-04 15:07:46,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:46,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:07:46,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:46,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:07:46,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:07:46,402 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-04 15:07:46,402 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-04 15:07:46,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:46,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-04 15:07:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:46,674 INFO L124 PetriNetUnfolderBase]: 1726/3929 cut-off events. [2025-03-04 15:07:46,674 INFO L125 PetriNetUnfolderBase]: For 4062/4062 co-relation queries the response was YES. [2025-03-04 15:07:46,680 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-04 15:07:46,688 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 64 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-03-04 15:07:46,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 97 transitions, 534 flow [2025-03-04 15:07:46,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:07:46,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:07:46,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-04 15:07:46,689 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-04 15:07:46,689 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 348 flow. Second operand 3 states and 166 transitions. [2025-03-04 15:07:46,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 97 transitions, 534 flow [2025-03-04 15:07:46,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 508 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-03-04 15:07:46,697 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 303 flow [2025-03-04 15:07:46,697 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-04 15:07:46,697 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-03-04 15:07:46,698 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 303 flow [2025-03-04 15:07:46,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:46,698 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:46,698 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-04 15:07:46,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:07:46,698 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:46,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:46,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1834171490, now seen corresponding path program 1 times [2025-03-04 15:07:46,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:46,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122363061] [2025-03-04 15:07:46,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:46,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:46,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-04 15:07:46,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-04 15:07:46,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:46,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:47,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:47,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:47,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122363061] [2025-03-04 15:07:47,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122363061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:47,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:47,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 15:07:47,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357125097] [2025-03-04 15:07:47,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:47,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 15:07:47,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:47,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 15:07:47,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:07:47,056 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:07:47,056 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-04 15:07:47,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:47,057 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:07:47,057 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:47,570 INFO L124 PetriNetUnfolderBase]: 1760/3862 cut-off events. [2025-03-04 15:07:47,570 INFO L125 PetriNetUnfolderBase]: For 3541/3543 co-relation queries the response was YES. [2025-03-04 15:07:47,579 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-04 15:07:47,588 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 109 selfloop transitions, 9 changer transitions 2/145 dead transitions. [2025-03-04 15:07:47,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 832 flow [2025-03-04 15:07:47,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:07:47,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:07:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 357 transitions. [2025-03-04 15:07:47,590 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5188953488372093 [2025-03-04 15:07:47,590 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 303 flow. Second operand 8 states and 357 transitions. [2025-03-04 15:07:47,590 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 832 flow [2025-03-04 15:07:47,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:07:47,601 INFO L231 Difference]: Finished difference. Result has 105 places, 79 transitions, 311 flow [2025-03-04 15:07:47,601 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-04 15:07:47,602 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-03-04 15:07:47,602 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 79 transitions, 311 flow [2025-03-04 15:07:47,602 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-04 15:07:47,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:47,602 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-04 15:07:47,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:07:47,603 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:47,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:47,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1891934825, now seen corresponding path program 1 times [2025-03-04 15:07:47,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:47,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041364814] [2025-03-04 15:07:47,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:47,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:47,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:07:47,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:07:47,638 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:47,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:48,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:48,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041364814] [2025-03-04 15:07:48,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041364814] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:48,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:48,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:07:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869368786] [2025-03-04 15:07:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:48,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:07:48,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:48,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:07:48,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:07:48,183 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-04 15:07:48,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-04 15:07:48,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:48,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-04 15:07:48,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:48,673 INFO L124 PetriNetUnfolderBase]: 2162/4614 cut-off events. [2025-03-04 15:07:48,673 INFO L125 PetriNetUnfolderBase]: For 4416/4416 co-relation queries the response was YES. [2025-03-04 15:07:48,680 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-04 15:07:48,688 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 147 selfloop transitions, 12 changer transitions 2/183 dead transitions. [2025-03-04 15:07:48,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 183 transitions, 1076 flow [2025-03-04 15:07:48,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:07:48,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:07:48,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 455 transitions. [2025-03-04 15:07:48,690 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4809725158562368 [2025-03-04 15:07:48,690 INFO L175 Difference]: Start difference. First operand has 105 places, 79 transitions, 311 flow. Second operand 11 states and 455 transitions. [2025-03-04 15:07:48,690 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 183 transitions, 1076 flow [2025-03-04 15:07:48,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 183 transitions, 1060 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:07:48,698 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 360 flow [2025-03-04 15:07:48,699 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-04 15:07:48,699 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2025-03-04 15:07:48,699 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 360 flow [2025-03-04 15:07:48,699 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-04 15:07:48,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:48,699 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-04 15:07:48,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:07:48,700 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:48,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:48,700 INFO L85 PathProgramCache]: Analyzing trace with hash 739624328, now seen corresponding path program 1 times [2025-03-04 15:07:48,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:48,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762141505] [2025-03-04 15:07:48,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:48,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:48,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-04 15:07:48,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-04 15:07:48,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:48,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:48,750 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-04 15:07:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:48,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762141505] [2025-03-04 15:07:48,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762141505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:48,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:48,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:07:48,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571164751] [2025-03-04 15:07:48,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:48,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:07:48,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:48,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:07:48,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:07:48,753 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-03-04 15:07:48,754 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-04 15:07:48,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:48,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-03-04 15:07:48,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:49,011 INFO L124 PetriNetUnfolderBase]: 1680/3798 cut-off events. [2025-03-04 15:07:49,011 INFO L125 PetriNetUnfolderBase]: For 4278/4284 co-relation queries the response was YES. [2025-03-04 15:07:49,019 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-04 15:07:49,026 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 71 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-03-04 15:07:49,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 101 transitions, 575 flow [2025-03-04 15:07:49,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:07:49,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:07:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-03-04 15:07:49,027 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-03-04 15:07:49,027 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 360 flow. Second operand 3 states and 166 transitions. [2025-03-04 15:07:49,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 101 transitions, 575 flow [2025-03-04 15:07:49,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 101 transitions, 562 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:07:49,036 INFO L231 Difference]: Finished difference. Result has 110 places, 82 transitions, 343 flow [2025-03-04 15:07:49,036 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-04 15:07:49,036 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2025-03-04 15:07:49,036 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 343 flow [2025-03-04 15:07:49,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:07:49,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:49,036 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-04 15:07:49,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:07:49,037 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:49,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash 645781617, now seen corresponding path program 1 times [2025-03-04 15:07:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:49,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113079836] [2025-03-04 15:07:49,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:49,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:49,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-04 15:07:49,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-04 15:07:49,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:49,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:49,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:49,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:49,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113079836] [2025-03-04 15:07:49,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113079836] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:49,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:49,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 15:07:49,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054986560] [2025-03-04 15:07:49,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:49,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:07:49,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:49,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:07:49,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:07:49,213 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-03-04 15:07:49,213 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-04 15:07:49,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:49,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-03-04 15:07:49,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:49,492 INFO L124 PetriNetUnfolderBase]: 1676/3747 cut-off events. [2025-03-04 15:07:49,493 INFO L125 PetriNetUnfolderBase]: For 3887/3887 co-relation queries the response was YES. [2025-03-04 15:07:49,501 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-04 15:07:49,507 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 59 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2025-03-04 15:07:49,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 97 transitions, 554 flow [2025-03-04 15:07:49,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:07:49,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:07:49,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-03-04 15:07:49,508 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2025-03-04 15:07:49,508 INFO L175 Difference]: Start difference. First operand has 110 places, 82 transitions, 343 flow. Second operand 5 states and 226 transitions. [2025-03-04 15:07:49,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 97 transitions, 554 flow [2025-03-04 15:07:49,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:07:49,517 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 361 flow [2025-03-04 15:07:49,517 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-04 15:07:49,517 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2025-03-04 15:07:49,517 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 361 flow [2025-03-04 15:07:49,517 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-04 15:07:49,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:49,517 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-04 15:07:49,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:07:49,517 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:49,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:49,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1675858379, now seen corresponding path program 1 times [2025-03-04 15:07:49,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:49,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940882527] [2025-03-04 15:07:49,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:49,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:49,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-04 15:07:49,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-04 15:07:49,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:49,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:50,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:50,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940882527] [2025-03-04 15:07:50,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940882527] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:07:50,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:07:50,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:07:50,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138739301] [2025-03-04 15:07:50,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:07:50,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:07:50,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:50,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:07:50,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:07:50,043 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-04 15:07:50,044 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-04 15:07:50,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:07:50,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-04 15:07:50,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:07:50,595 INFO L124 PetriNetUnfolderBase]: 1808/3867 cut-off events. [2025-03-04 15:07:50,595 INFO L125 PetriNetUnfolderBase]: For 4482/4484 co-relation queries the response was YES. [2025-03-04 15:07:50,605 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-04 15:07:50,613 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 141 selfloop transitions, 14 changer transitions 18/196 dead transitions. [2025-03-04 15:07:50,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 196 transitions, 1201 flow [2025-03-04 15:07:50,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:07:50,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:07:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 534 transitions. [2025-03-04 15:07:50,615 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4776386404293381 [2025-03-04 15:07:50,615 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 361 flow. Second operand 13 states and 534 transitions. [2025-03-04 15:07:50,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 196 transitions, 1201 flow [2025-03-04 15:07:50,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 1177 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:07:50,626 INFO L231 Difference]: Finished difference. Result has 122 places, 85 transitions, 394 flow [2025-03-04 15:07:50,627 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-04 15:07:50,627 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2025-03-04 15:07:50,627 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 85 transitions, 394 flow [2025-03-04 15:07:50,627 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-04 15:07:50,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:07:50,627 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-04 15:07:50,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:07:50,628 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:07:50,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:07:50,628 INFO L85 PathProgramCache]: Analyzing trace with hash 394201899, now seen corresponding path program 1 times [2025-03-04 15:07:50,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:07:50,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020792437] [2025-03-04 15:07:50,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:50,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:07:50,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:07:50,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:07:50,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:50,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:51,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:51,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:07:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020792437] [2025-03-04 15:07:51,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020792437] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:07:51,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781906508] [2025-03-04 15:07:51,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:07:51,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:07:51,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:07:51,266 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:07:51,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:07:51,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:07:51,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:07:51,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:07:51,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:07:51,404 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-04 15:07:51,406 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:07:51,435 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-04 15:07:51,499 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:51,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:51,518 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-04 15:07:51,519 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-04 15:07:51,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:51,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:51,567 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-04 15:07:51,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:51,618 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-04 15:07:51,675 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:07:51,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:51,690 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-03-04 15:07:51,691 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-04 15:07:51,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:51,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:07:51,733 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-04 15:07:51,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 15:07:51,770 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-04 15:07:51,834 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-04 15:07:51,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:51,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:07:56,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:07:56,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781906508] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:07:56,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:07:56,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-03-04 15:07:56,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481456199] [2025-03-04 15:07:56,340 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:07:56,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 15:07:56,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:07:56,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 15:07:56,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2025-03-04 15:08:00,395 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-04 15:08:00,827 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:08:00,828 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-04 15:08:00,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:00,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:08:00,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:01,915 INFO L124 PetriNetUnfolderBase]: 1748/3799 cut-off events. [2025-03-04 15:08:01,915 INFO L125 PetriNetUnfolderBase]: For 4496/4498 co-relation queries the response was YES. [2025-03-04 15:08:01,924 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-04 15:08:01,930 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 139 selfloop transitions, 15 changer transitions 17/196 dead transitions. [2025-03-04 15:08:01,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 196 transitions, 1218 flow [2025-03-04 15:08:01,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:01,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:01,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 558 transitions. [2025-03-04 15:08:01,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4991055456171735 [2025-03-04 15:08:01,932 INFO L175 Difference]: Start difference. First operand has 122 places, 85 transitions, 394 flow. Second operand 13 states and 558 transitions. [2025-03-04 15:08:01,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 196 transitions, 1218 flow [2025-03-04 15:08:01,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 196 transitions, 1196 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-03-04 15:08:01,950 INFO L231 Difference]: Finished difference. Result has 126 places, 85 transitions, 407 flow [2025-03-04 15:08:01,950 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-04 15:08:01,950 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2025-03-04 15:08:01,950 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 85 transitions, 407 flow [2025-03-04 15:08:01,951 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-04 15:08:01,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:01,952 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-04 15:08:01,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 15:08:02,156 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-04 15:08:02,156 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:02,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:02,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1213459165, now seen corresponding path program 1 times [2025-03-04 15:08:02,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:02,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958600410] [2025-03-04 15:08:02,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:02,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:02,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 15:08:02,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:08:02,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:02,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:02,423 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-04 15:08:02,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:02,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958600410] [2025-03-04 15:08:02,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958600410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:02,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:02,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 15:08:02,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868195221] [2025-03-04 15:08:02,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:02,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 15:08:02,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:02,424 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 15:08:02,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:08:02,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-03-04 15:08:02,442 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-04 15:08:02,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:02,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-03-04 15:08:02,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:02,886 INFO L124 PetriNetUnfolderBase]: 1928/4172 cut-off events. [2025-03-04 15:08:02,886 INFO L125 PetriNetUnfolderBase]: For 4689/4689 co-relation queries the response was YES. [2025-03-04 15:08:02,896 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-04 15:08:02,903 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 102 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-03-04 15:08:02,903 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 143 transitions, 900 flow [2025-03-04 15:08:02,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:02,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:02,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-03-04 15:08:02,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2025-03-04 15:08:02,904 INFO L175 Difference]: Start difference. First operand has 126 places, 85 transitions, 407 flow. Second operand 8 states and 330 transitions. [2025-03-04 15:08:02,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 143 transitions, 900 flow [2025-03-04 15:08:02,913 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 872 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-03-04 15:08:02,914 INFO L231 Difference]: Finished difference. Result has 120 places, 87 transitions, 427 flow [2025-03-04 15:08:02,914 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-04 15:08:02,915 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2025-03-04 15:08:02,915 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 87 transitions, 427 flow [2025-03-04 15:08:02,915 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-04 15:08:02,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:02,915 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-04 15:08:02,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:08:02,915 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:02,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:02,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1549495869, now seen corresponding path program 1 times [2025-03-04 15:08:02,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:02,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843786123] [2025-03-04 15:08:02,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:02,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:02,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:08:02,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:08:02,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:02,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:04,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:04,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:04,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843786123] [2025-03-04 15:08:04,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843786123] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:04,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:04,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 15:08:04,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317055604] [2025-03-04 15:08:04,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:04,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-04 15:08:04,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:04,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-04 15:08:04,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 15:08:04,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 86 [2025-03-04 15:08:04,202 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-04 15:08:04,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:04,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 86 [2025-03-04 15:08:04,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:05,225 INFO L124 PetriNetUnfolderBase]: 2274/4901 cut-off events. [2025-03-04 15:08:05,225 INFO L125 PetriNetUnfolderBase]: For 5375/5375 co-relation queries the response was YES. [2025-03-04 15:08:05,239 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-04 15:08:05,248 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 192 selfloop transitions, 20 changer transitions 12/247 dead transitions. [2025-03-04 15:08:05,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 247 transitions, 1605 flow [2025-03-04 15:08:05,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-04 15:08:05,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-03-04 15:08:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 594 transitions. [2025-03-04 15:08:05,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4316860465116279 [2025-03-04 15:08:05,250 INFO L175 Difference]: Start difference. First operand has 120 places, 87 transitions, 427 flow. Second operand 16 states and 594 transitions. [2025-03-04 15:08:05,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 247 transitions, 1605 flow [2025-03-04 15:08:05,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 247 transitions, 1578 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-03-04 15:08:05,262 INFO L231 Difference]: Finished difference. Result has 137 places, 94 transitions, 532 flow [2025-03-04 15:08:05,262 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-04 15:08:05,262 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 59 predicate places. [2025-03-04 15:08:05,262 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 94 transitions, 532 flow [2025-03-04 15:08:05,262 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-04 15:08:05,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:05,262 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-04 15:08:05,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:08:05,263 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:05,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:05,263 INFO L85 PathProgramCache]: Analyzing trace with hash -998562279, now seen corresponding path program 1 times [2025-03-04 15:08:05,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:05,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265072277] [2025-03-04 15:08:05,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:05,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:05,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:08:05,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:08:05,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:05,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:06,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265072277] [2025-03-04 15:08:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265072277] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292843553] [2025-03-04 15:08:06,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:06,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:06,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:06,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:06,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:08:06,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:08:06,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:08:06,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:06,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:06,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-04 15:08:06,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:06,498 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-04 15:08:06,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:06,627 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-04 15:08:06,649 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-04 15:08:06,692 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-03-04 15:08:06,692 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-04 15:08:06,723 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-04 15:08:06,736 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-04 15:08:06,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:06,754 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:06,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292843553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:06,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:06,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2025-03-04 15:08:06,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466144156] [2025-03-04 15:08:06,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 15:08:06,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 15:08:06,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-03-04 15:08:06,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-04 15:08:06,766 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-04 15:08:06,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:06,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-04 15:08:06,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:07,418 INFO L124 PetriNetUnfolderBase]: 2259/4906 cut-off events. [2025-03-04 15:08:07,419 INFO L125 PetriNetUnfolderBase]: For 6493/6493 co-relation queries the response was YES. [2025-03-04 15:08:07,433 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-04 15:08:07,443 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 71 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2025-03-04 15:08:07,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 118 transitions, 831 flow [2025-03-04 15:08:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:07,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:07,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-03-04 15:08:07,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4748062015503876 [2025-03-04 15:08:07,444 INFO L175 Difference]: Start difference. First operand has 137 places, 94 transitions, 532 flow. Second operand 6 states and 245 transitions. [2025-03-04 15:08:07,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 118 transitions, 831 flow [2025-03-04 15:08:07,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 803 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-03-04 15:08:07,458 INFO L231 Difference]: Finished difference. Result has 129 places, 93 transitions, 550 flow [2025-03-04 15:08:07,459 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-04 15:08:07,459 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 51 predicate places. [2025-03-04 15:08:07,459 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 93 transitions, 550 flow [2025-03-04 15:08:07,460 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-04 15:08:07,460 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:07,460 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-04 15:08:07,468 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 15:08:07,660 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-04 15:08:07,661 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:07,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:07,661 INFO L85 PathProgramCache]: Analyzing trace with hash -206399880, now seen corresponding path program 1 times [2025-03-04 15:08:07,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:07,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156023149] [2025-03-04 15:08:07,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:07,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:08:07,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:08:07,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:07,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:08,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:08:08,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:08,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156023149] [2025-03-04 15:08:08,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156023149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:08,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:08,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 15:08:08,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342207224] [2025-03-04 15:08:08,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:08,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:08:08,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:08,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:08:08,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:08:08,457 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:08:08,457 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-04 15:08:08,457 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:08,457 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:08:08,457 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:09,250 INFO L124 PetriNetUnfolderBase]: 2327/5055 cut-off events. [2025-03-04 15:08:09,250 INFO L125 PetriNetUnfolderBase]: For 7558/7562 co-relation queries the response was YES. [2025-03-04 15:08:09,262 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-04 15:08:09,270 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 151 selfloop transitions, 17 changer transitions 14/207 dead transitions. [2025-03-04 15:08:09,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 207 transitions, 1430 flow [2025-03-04 15:08:09,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 15:08:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 15:08:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 561 transitions. [2025-03-04 15:08:09,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.501788908765653 [2025-03-04 15:08:09,272 INFO L175 Difference]: Start difference. First operand has 129 places, 93 transitions, 550 flow. Second operand 13 states and 561 transitions. [2025-03-04 15:08:09,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 207 transitions, 1430 flow [2025-03-04 15:08:09,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 207 transitions, 1374 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 15:08:09,285 INFO L231 Difference]: Finished difference. Result has 141 places, 98 transitions, 599 flow [2025-03-04 15:08:09,285 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-04 15:08:09,285 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 63 predicate places. [2025-03-04 15:08:09,286 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 98 transitions, 599 flow [2025-03-04 15:08:09,286 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-04 15:08:09,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:09,286 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-04 15:08:09,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:08:09,286 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:09,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:09,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1045320147, now seen corresponding path program 1 times [2025-03-04 15:08:09,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:09,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288267269] [2025-03-04 15:08:09,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:09,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:09,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 15:08:09,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:09,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:09,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:10,064 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-04 15:08:10,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288267269] [2025-03-04 15:08:10,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288267269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:10,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1857561711] [2025-03-04 15:08:10,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:10,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:10,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:10,067 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:10,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:08:10,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-04 15:08:10,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-04 15:08:10,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:10,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:10,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-03-04 15:08:10,216 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:10,224 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-04 15:08:10,265 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:10,273 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:08:10,273 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-04 15:08:10,308 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-04 15:08:10,354 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-04 15:08:10,404 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:10,412 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-03-04 15:08:10,413 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-04 15:08:10,449 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-04 15:08:10,495 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-04 15:08:10,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:10,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 29 treesize of output 13 [2025-03-04 15:08:10,598 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-04 15:08:10,625 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-04 15:08:10,668 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-04 15:08:10,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:11,334 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-04 15:08:11,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1857561711] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:11,334 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:11,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2025-03-04 15:08:11,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752914036] [2025-03-04 15:08:11,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:11,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-04 15:08:11,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:11,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-04 15:08:11,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2025-03-04 15:08:11,540 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-03-04 15:08:11,541 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-04 15:08:11,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:11,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-03-04 15:08:11,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:14,261 INFO L124 PetriNetUnfolderBase]: 2565/5645 cut-off events. [2025-03-04 15:08:14,262 INFO L125 PetriNetUnfolderBase]: For 8405/8405 co-relation queries the response was YES. [2025-03-04 15:08:14,273 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-04 15:08:14,282 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 236 selfloop transitions, 35 changer transitions 17/313 dead transitions. [2025-03-04 15:08:14,282 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 313 transitions, 2106 flow [2025-03-04 15:08:14,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-04 15:08:14,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-03-04 15:08:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1116 transitions. [2025-03-04 15:08:14,284 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2025-03-04 15:08:14,284 INFO L175 Difference]: Start difference. First operand has 141 places, 98 transitions, 599 flow. Second operand 27 states and 1116 transitions. [2025-03-04 15:08:14,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 313 transitions, 2106 flow [2025-03-04 15:08:14,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 313 transitions, 2050 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-03-04 15:08:14,299 INFO L231 Difference]: Finished difference. Result has 152 places, 106 transitions, 679 flow [2025-03-04 15:08:14,299 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-04 15:08:14,300 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 74 predicate places. [2025-03-04 15:08:14,300 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 106 transitions, 679 flow [2025-03-04 15:08:14,300 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-04 15:08:14,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:14,300 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-04 15:08:14,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:08:14,500 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-04 15:08:14,501 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:14,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:14,501 INFO L85 PathProgramCache]: Analyzing trace with hash 562969654, now seen corresponding path program 1 times [2025-03-04 15:08:14,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:14,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813927776] [2025-03-04 15:08:14,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:14,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:14,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 15:08:14,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 15:08:14,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:14,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:15,934 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-04 15:08:15,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813927776] [2025-03-04 15:08:15,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813927776] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:15,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568989843] [2025-03-04 15:08:15,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:15,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:15,936 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:15,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:08:16,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-03-04 15:08:16,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-03-04 15:08:16,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:16,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:16,081 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-03-04 15:08:16,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:16,189 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-04 15:08:16,230 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-04 15:08:16,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:16,306 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-03-04 15:08:16,306 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-04 15:08:16,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-04 15:08:16,443 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-04 15:08:16,460 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-03-04 15:08:16,460 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-04 15:08:16,575 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-03-04 15:08:16,575 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-04 15:08:16,623 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-04 15:08:16,639 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-04 15:08:16,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:08:16,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568989843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:16,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:08:16,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 25 [2025-03-04 15:08:16,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529180044] [2025-03-04 15:08:16,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:16,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:08:16,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:16,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:08:16,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-03-04 15:08:16,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-03-04 15:08:16,676 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-04 15:08:16,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:16,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-03-04 15:08:16,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:17,286 INFO L124 PetriNetUnfolderBase]: 2615/5624 cut-off events. [2025-03-04 15:08:17,286 INFO L125 PetriNetUnfolderBase]: For 7890/7902 co-relation queries the response was YES. [2025-03-04 15:08:17,301 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-04 15:08:17,311 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 94 selfloop transitions, 35 changer transitions 1/153 dead transitions. [2025-03-04 15:08:17,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1146 flow [2025-03-04 15:08:17,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:08:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:08:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-03-04 15:08:17,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2025-03-04 15:08:17,313 INFO L175 Difference]: Start difference. First operand has 152 places, 106 transitions, 679 flow. Second operand 8 states and 330 transitions. [2025-03-04 15:08:17,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1146 flow [2025-03-04 15:08:17,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 153 transitions, 1058 flow, removed 21 selfloop flow, removed 18 redundant places. [2025-03-04 15:08:17,328 INFO L231 Difference]: Finished difference. Result has 140 places, 105 transitions, 657 flow [2025-03-04 15:08:17,328 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-04 15:08:17,328 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 62 predicate places. [2025-03-04 15:08:17,328 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 657 flow [2025-03-04 15:08:17,328 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-04 15:08:17,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:17,329 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-04 15:08:17,336 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:08:17,529 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-04 15:08:17,529 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:17,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:17,530 INFO L85 PathProgramCache]: Analyzing trace with hash -932074256, now seen corresponding path program 1 times [2025-03-04 15:08:17,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:17,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825850951] [2025-03-04 15:08:17,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:17,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:17,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-03-04 15:08:17,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-03-04 15:08:17,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:17,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:18,092 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-04 15:08:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825850951] [2025-03-04 15:08:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825850951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:08:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:08:18,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 15:08:18,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290492093] [2025-03-04 15:08:18,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:08:18,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 15:08:18,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:18,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 15:08:18,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:08:18,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-03-04 15:08:18,098 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-04 15:08:18,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:18,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-03-04 15:08:18,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:18,585 INFO L124 PetriNetUnfolderBase]: 2585/5672 cut-off events. [2025-03-04 15:08:18,585 INFO L125 PetriNetUnfolderBase]: For 7616/7616 co-relation queries the response was YES. [2025-03-04 15:08:18,598 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-04 15:08:18,609 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 78 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2025-03-04 15:08:18,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 963 flow [2025-03-04 15:08:18,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:08:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:08:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2025-03-04 15:08:18,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2025-03-04 15:08:18,610 INFO L175 Difference]: Start difference. First operand has 140 places, 105 transitions, 657 flow. Second operand 6 states and 261 transitions. [2025-03-04 15:08:18,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 127 transitions, 963 flow [2025-03-04 15:08:18,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 127 transitions, 905 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-03-04 15:08:18,623 INFO L231 Difference]: Finished difference. Result has 138 places, 104 transitions, 647 flow [2025-03-04 15:08:18,623 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-04 15:08:18,623 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2025-03-04 15:08:18,623 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 647 flow [2025-03-04 15:08:18,623 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-04 15:08:18,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:18,623 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-04 15:08:18,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 15:08:18,623 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:18,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1037194721, now seen corresponding path program 1 times [2025-03-04 15:08:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:18,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705551858] [2025-03-04 15:08:18,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:18,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 15:08:18,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 15:08:18,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:18,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:19,919 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-04 15:08:19,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:19,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705551858] [2025-03-04 15:08:19,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705551858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:19,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848350715] [2025-03-04 15:08:19,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:19,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:19,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:19,921 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:19,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:08:20,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-04 15:08:20,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-04 15:08:20,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:20,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:20,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-03-04 15:08:20,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:20,076 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-04 15:08:20,128 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-04 15:08:20,163 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-04 15:08:20,231 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-04 15:08:20,304 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-04 15:08:20,355 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-04 15:08:20,441 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-04 15:08:20,537 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-04 15:08:20,598 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-04 15:08:20,679 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-04 15:08:20,731 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-04 15:08:20,785 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-04 15:08:20,857 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-04 15:08:20,861 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-04 15:08:20,880 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-04 15:08:20,881 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:08:22,865 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-04 15:08:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848350715] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:08:22,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:08:22,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 19] total 50 [2025-03-04 15:08:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32176078] [2025-03-04 15:08:22,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:08:22,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-03-04 15:08:22,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:08:22,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-03-04 15:08:22,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2143, Unknown=0, NotChecked=0, Total=2652 [2025-03-04 15:08:23,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-03-04 15:08:23,164 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-04 15:08:23,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:08:23,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-03-04 15:08:23,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:08:37,805 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-04 15:08:39,000 INFO L124 PetriNetUnfolderBase]: 2824/6108 cut-off events. [2025-03-04 15:08:39,000 INFO L125 PetriNetUnfolderBase]: For 8076/8076 co-relation queries the response was YES. [2025-03-04 15:08:39,012 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-04 15:08:39,024 INFO L140 encePairwiseOnDemand]: 67/86 looper letters, 314 selfloop transitions, 53 changer transitions 59/448 dead transitions. [2025-03-04 15:08:39,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 448 transitions, 2960 flow [2025-03-04 15:08:39,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-03-04 15:08:39,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-03-04 15:08:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1764 transitions. [2025-03-04 15:08:39,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44590495449949447 [2025-03-04 15:08:39,026 INFO L175 Difference]: Start difference. First operand has 138 places, 104 transitions, 647 flow. Second operand 46 states and 1764 transitions. [2025-03-04 15:08:39,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 448 transitions, 2960 flow [2025-03-04 15:08:39,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 448 transitions, 2890 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-03-04 15:08:39,042 INFO L231 Difference]: Finished difference. Result has 184 places, 119 transitions, 822 flow [2025-03-04 15:08:39,042 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-04 15:08:39,043 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 106 predicate places. [2025-03-04 15:08:39,043 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 119 transitions, 822 flow [2025-03-04 15:08:39,043 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-04 15:08:39,043 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:08:39,043 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-04 15:08:39,050 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-04 15:08:39,244 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-04 15:08:39,244 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-03-04 15:08:39,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:08:39,244 INFO L85 PathProgramCache]: Analyzing trace with hash 530635870, now seen corresponding path program 1 times [2025-03-04 15:08:39,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:08:39,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352697385] [2025-03-04 15:08:39,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:39,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:08:39,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:08:39,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:08:39,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:39,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,319 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-04 15:08:41,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:08:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352697385] [2025-03-04 15:08:41,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352697385] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:08:41,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160249290] [2025-03-04 15:08:41,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:08:41,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:08:41,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:08:41,321 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:08:41,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:08:41,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-04 15:08:41,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-04 15:08:41,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:08:41,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:08:41,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-03-04 15:08:41,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:08:41,531 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-04 15:08:41,807 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-04 15:08:41,808 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-04 15:08:41,945 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-04 15:08:42,186 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-04 15:08:42,502 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-04 15:08:42,502 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-04 15:08:42,654 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-04 15:08:42,853 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-04 15:08:43,322 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-04 15:08:43,498 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-04 15:08:43,833 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-03-04 15:08:43,833 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-04 15:08:44,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-04 15:08:44,130 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-04 15:08:44,466 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-04 15:08:44,471 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-04 15:08:44,540 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-04 15:08:44,540 INFO L312 TraceCheckSpWp]: Computing backward predicates...