./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 c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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-?-c00e63d-m [2025-02-06 18:29:27,486 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:29:27,542 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:29:27,549 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:29:27,552 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:29:27,581 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:29:27,581 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:29:27,582 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:29:27,583 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:29:27,583 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:29:27,584 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:29:27,584 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:29:27,584 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:29:27,584 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:29:27,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:29:27,585 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:29:27,586 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:29:27,586 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:29:27,586 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:29:27,587 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:29:27,587 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:29:27,587 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-jdk21/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-02-06 18:29:27,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:29:27,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:29:27,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:29:27,844 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:29:27,844 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:29:27,845 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue.i [2025-02-06 18:29:29,086 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81475b2bf/c02340d05ba440a8a2b4246b5aa50765/FLAG82ffefac0 [2025-02-06 18:29:29,431 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:29:29,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue.i [2025-02-06 18:29:29,446 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81475b2bf/c02340d05ba440a8a2b4246b5aa50765/FLAG82ffefac0 [2025-02-06 18:29:29,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/81475b2bf/c02340d05ba440a8a2b4246b5aa50765 [2025-02-06 18:29:29,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:29:29,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:29:29,660 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:29:29,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:29:29,663 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:29:29,664 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:29:29" (1/1) ... [2025-02-06 18:29:29,665 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c85e35f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:29, skipping insertion in model container [2025-02-06 18:29:29,665 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:29:29" (1/1) ... [2025-02-06 18:29:29,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:29:30,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:29:30,144 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:29:30,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:29:30,256 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:29:30,257 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30 WrapperNode [2025-02-06 18:29:30,258 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:29:30,259 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:29:30,259 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:29:30,259 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:29:30,263 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,276 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,302 INFO L138 Inliner]: procedures = 274, calls = 107, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 307 [2025-02-06 18:29:30,302 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:29:30,303 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:29:30,303 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:29:30,303 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:29:30,312 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,312 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,334 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-02-06 18:29:30,335 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,335 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,348 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,352 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,353 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,357 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:29:30,358 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:29:30,358 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:29:30,358 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:29:30,359 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (1/1) ... [2025-02-06 18:29:30,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:29:30,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:30,387 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:29:30,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:29:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 18:29:30,409 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 18:29:30,409 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 18:29:30,410 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 18:29:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:29:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:29:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:29:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:29:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:29:30,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:29:30,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:29:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:29:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:29:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-02-06 18:29:30,412 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:29:30,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:29:30,414 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:29:30,560 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:29:30,561 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:29:31,016 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:29:31,016 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:29:31,324 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:29:31,324 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:29:31,324 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:29:31 BoogieIcfgContainer [2025-02-06 18:29:31,324 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:29:31,328 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:29:31,328 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:29:31,332 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:29:31,332 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:29:29" (1/3) ... [2025-02-06 18:29:31,333 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2933046a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:29:31, skipping insertion in model container [2025-02-06 18:29:31,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:30" (2/3) ... [2025-02-06 18:29:31,334 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2933046a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:29:31, skipping insertion in model container [2025-02-06 18:29:31,334 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:29:31" (3/3) ... [2025-02-06 18:29:31,335 INFO L128 eAbstractionObserver]: Analyzing ICFG queue.i [2025-02-06 18:29:31,350 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:29:31,353 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-02-06 18:29:31,353 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:29:31,465 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:29:31,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 83 places, 86 transitions, 186 flow [2025-02-06 18:29:31,547 INFO L124 PetriNetUnfolderBase]: 10/84 cut-off events. [2025-02-06 18:29:31,549 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:29:31,554 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-02-06 18:29:31,555 INFO L82 GeneralOperation]: Start removeDead. Operand has 83 places, 86 transitions, 186 flow [2025-02-06 18:29:31,563 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 78 places, 80 transitions, 169 flow [2025-02-06 18:29:31,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:29:31,584 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;@1302e85a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:29:31,584 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-06 18:29:31,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:29:31,594 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2025-02-06 18:29:31,594 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:29:31,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:31,595 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:31,595 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:31,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:31,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1490407634, now seen corresponding path program 1 times [2025-02-06 18:29:31,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:31,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792666840] [2025-02-06 18:29:31,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:31,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:31,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:29:31,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:29:31,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:31,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:32,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:32,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:32,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792666840] [2025-02-06 18:29:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792666840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:32,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:32,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:32,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071551896] [2025-02-06 18:29:32,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:32,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:32,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:32,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:32,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:32,396 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:29:32,398 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-02-06 18:29:32,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:32,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:29:32,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:32,919 INFO L124 PetriNetUnfolderBase]: 1236/2529 cut-off events. [2025-02-06 18:29:32,919 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-06 18:29:32,928 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-02-06 18:29:32,948 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 74 selfloop transitions, 6 changer transitions 0/110 dead transitions. [2025-02-06 18:29:32,948 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 110 transitions, 395 flow [2025-02-06 18:29:32,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:32,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 210 transitions. [2025-02-06 18:29:32,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6104651162790697 [2025-02-06 18:29:32,963 INFO L175 Difference]: Start difference. First operand has 78 places, 80 transitions, 169 flow. Second operand 4 states and 210 transitions. [2025-02-06 18:29:32,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 110 transitions, 395 flow [2025-02-06 18:29:32,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 110 transitions, 388 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:32,974 INFO L231 Difference]: Finished difference. Result has 81 places, 83 transitions, 204 flow [2025-02-06 18:29:32,977 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-02-06 18:29:32,981 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 3 predicate places. [2025-02-06 18:29:32,982 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 83 transitions, 204 flow [2025-02-06 18:29:32,983 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-02-06 18:29:32,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:32,983 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:32,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:29:32,984 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:32,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:32,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1042004321, now seen corresponding path program 1 times [2025-02-06 18:29:32,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:32,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359644338] [2025-02-06 18:29:32,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:32,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:33,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:29:33,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:29:33,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:33,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:33,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359644338] [2025-02-06 18:29:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359644338] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:33,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:33,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:33,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522994651] [2025-02-06 18:29:33,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:33,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:33,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:33,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:33,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:33,500 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:29:33,501 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-02-06 18:29:33,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:33,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:29:33,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:34,004 INFO L124 PetriNetUnfolderBase]: 1242/2582 cut-off events. [2025-02-06 18:29:34,005 INFO L125 PetriNetUnfolderBase]: For 454/457 co-relation queries the response was YES. [2025-02-06 18:29:34,010 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-02-06 18:29:34,025 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 82 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-02-06 18:29:34,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 118 transitions, 460 flow [2025-02-06 18:29:34,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:29:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:29:34,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 250 transitions. [2025-02-06 18:29:34,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-02-06 18:29:34,029 INFO L175 Difference]: Start difference. First operand has 81 places, 83 transitions, 204 flow. Second operand 5 states and 250 transitions. [2025-02-06 18:29:34,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 118 transitions, 460 flow [2025-02-06 18:29:34,034 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 118 transitions, 454 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:34,038 INFO L231 Difference]: Finished difference. Result has 85 places, 84 transitions, 221 flow [2025-02-06 18:29:34,039 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-02-06 18:29:34,039 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 7 predicate places. [2025-02-06 18:29:34,040 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 84 transitions, 221 flow [2025-02-06 18:29:34,041 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-02-06 18:29:34,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:34,041 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:34,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:29:34,041 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:34,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:34,042 INFO L85 PathProgramCache]: Analyzing trace with hash 638797541, now seen corresponding path program 1 times [2025-02-06 18:29:34,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:34,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634646218] [2025-02-06 18:29:34,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:34,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:34,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:29:34,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:29:34,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:34,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:34,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:34,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:34,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634646218] [2025-02-06 18:29:34,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634646218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:34,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:34,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:34,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976036701] [2025-02-06 18:29:34,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:34,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:34,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:34,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:34,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:29:34,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:29:34,333 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-02-06 18:29:34,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:34,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:29:34,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:34,775 INFO L124 PetriNetUnfolderBase]: 1322/2692 cut-off events. [2025-02-06 18:29:34,776 INFO L125 PetriNetUnfolderBase]: For 532/548 co-relation queries the response was YES. [2025-02-06 18:29:34,780 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-02-06 18:29:34,791 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 103 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2025-02-06 18:29:34,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 144 transitions, 589 flow [2025-02-06 18:29:34,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:29:34,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:29:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 341 transitions. [2025-02-06 18:29:34,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5664451827242525 [2025-02-06 18:29:34,795 INFO L175 Difference]: Start difference. First operand has 85 places, 84 transitions, 221 flow. Second operand 7 states and 341 transitions. [2025-02-06 18:29:34,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 144 transitions, 589 flow [2025-02-06 18:29:34,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 144 transitions, 575 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:34,801 INFO L231 Difference]: Finished difference. Result has 91 places, 90 transitions, 276 flow [2025-02-06 18:29:34,801 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-02-06 18:29:34,802 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-02-06 18:29:34,803 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 90 transitions, 276 flow [2025-02-06 18:29:34,803 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-02-06 18:29:34,803 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:34,804 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:34,804 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:29:34,804 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:34,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:34,805 INFO L85 PathProgramCache]: Analyzing trace with hash -846753598, now seen corresponding path program 1 times [2025-02-06 18:29:34,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:34,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538867915] [2025-02-06 18:29:34,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:34,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:34,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:29:34,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:29:34,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:34,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538867915] [2025-02-06 18:29:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538867915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059014252] [2025-02-06 18:29:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:34,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:29:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:34,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:29:34,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:29:34,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-02-06 18:29:34,898 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-02-06 18:29:34,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:34,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-02-06 18:29:34,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:35,195 INFO L124 PetriNetUnfolderBase]: 1023/2377 cut-off events. [2025-02-06 18:29:35,195 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-02-06 18:29:35,200 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-02-06 18:29:35,210 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 64 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2025-02-06 18:29:35,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 97 transitions, 374 flow [2025-02-06 18:29:35,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:29:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:29:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 176 transitions. [2025-02-06 18:29:35,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6821705426356589 [2025-02-06 18:29:35,216 INFO L175 Difference]: Start difference. First operand has 91 places, 90 transitions, 276 flow. Second operand 3 states and 176 transitions. [2025-02-06 18:29:35,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 97 transitions, 374 flow [2025-02-06 18:29:35,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 97 transitions, 335 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-02-06 18:29:35,224 INFO L231 Difference]: Finished difference. Result has 75 places, 76 transitions, 169 flow [2025-02-06 18:29:35,226 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-02-06 18:29:35,227 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, -3 predicate places. [2025-02-06 18:29:35,227 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 76 transitions, 169 flow [2025-02-06 18:29:35,228 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-02-06 18:29:35,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:35,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:35,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:29:35,228 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:35,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:35,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1981394715, now seen corresponding path program 1 times [2025-02-06 18:29:35,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:35,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286381966] [2025-02-06 18:29:35,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:35,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:35,243 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-06 18:29:35,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-06 18:29:35,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:35,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:35,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:35,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286381966] [2025-02-06 18:29:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286381966] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614799053] [2025-02-06 18:29:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:35,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:35,292 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:35,292 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:35,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-02-06 18:29:35,306 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-02-06 18:29:35,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:35,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-02-06 18:29:35,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:35,819 INFO L124 PetriNetUnfolderBase]: 1890/4135 cut-off events. [2025-02-06 18:29:35,819 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-02-06 18:29:35,824 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-02-06 18:29:35,838 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 113 selfloop transitions, 3 changer transitions 0/144 dead transitions. [2025-02-06 18:29:35,838 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 144 transitions, 554 flow [2025-02-06 18:29:35,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:35,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:35,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 252 transitions. [2025-02-06 18:29:35,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325581395348837 [2025-02-06 18:29:35,840 INFO L175 Difference]: Start difference. First operand has 75 places, 76 transitions, 169 flow. Second operand 4 states and 252 transitions. [2025-02-06 18:29:35,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 144 transitions, 554 flow [2025-02-06 18:29:35,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 144 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:35,844 INFO L231 Difference]: Finished difference. Result has 79 places, 78 transitions, 190 flow [2025-02-06 18:29:35,844 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-02-06 18:29:35,845 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 1 predicate places. [2025-02-06 18:29:35,846 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 78 transitions, 190 flow [2025-02-06 18:29:35,846 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-02-06 18:29:35,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:35,847 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-02-06 18:29:35,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:29:35,847 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:35,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:35,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1160182554, now seen corresponding path program 1 times [2025-02-06 18:29:35,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:35,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561093597] [2025-02-06 18:29:35,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:35,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:35,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-06 18:29:35,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-06 18:29:35,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:35,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:36,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:36,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:36,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561093597] [2025-02-06 18:29:36,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561093597] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:36,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:36,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:29:36,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124044141] [2025-02-06 18:29:36,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:36,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:36,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:36,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:36,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:29:36,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-02-06 18:29:36,145 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-02-06 18:29:36,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:36,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-02-06 18:29:36,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:36,568 INFO L124 PetriNetUnfolderBase]: 1715/3852 cut-off events. [2025-02-06 18:29:36,569 INFO L125 PetriNetUnfolderBase]: For 790/910 co-relation queries the response was YES. [2025-02-06 18:29:36,575 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-02-06 18:29:36,590 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 75 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-02-06 18:29:36,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 110 transitions, 468 flow [2025-02-06 18:29:36,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:29:36,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:29:36,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 252 transitions. [2025-02-06 18:29:36,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.586046511627907 [2025-02-06 18:29:36,592 INFO L175 Difference]: Start difference. First operand has 79 places, 78 transitions, 190 flow. Second operand 5 states and 252 transitions. [2025-02-06 18:29:36,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 110 transitions, 468 flow [2025-02-06 18:29:36,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 110 transitions, 460 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:36,595 INFO L231 Difference]: Finished difference. Result has 82 places, 77 transitions, 196 flow [2025-02-06 18:29:36,595 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-02-06 18:29:36,596 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 4 predicate places. [2025-02-06 18:29:36,596 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 77 transitions, 196 flow [2025-02-06 18:29:36,596 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-02-06 18:29:36,596 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:36,596 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-02-06 18:29:36,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:29:36,597 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:36,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:36,597 INFO L85 PathProgramCache]: Analyzing trace with hash 898811421, now seen corresponding path program 1 times [2025-02-06 18:29:36,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:36,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257298327] [2025-02-06 18:29:36,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:36,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:36,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:29:36,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:29:36,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:36,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:37,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:37,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:37,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257298327] [2025-02-06 18:29:37,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257298327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:37,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:37,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:37,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576808246] [2025-02-06 18:29:37,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:37,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:37,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:37,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:37,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:37,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-02-06 18:29:37,660 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-02-06 18:29:37,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:37,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-02-06 18:29:37,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:38,403 INFO L124 PetriNetUnfolderBase]: 2309/4799 cut-off events. [2025-02-06 18:29:38,403 INFO L125 PetriNetUnfolderBase]: For 925/1077 co-relation queries the response was YES. [2025-02-06 18:29:38,409 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-02-06 18:29:38,428 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 135 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-02-06 18:29:38,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 169 transitions, 783 flow [2025-02-06 18:29:38,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:29:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:29:38,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 379 transitions. [2025-02-06 18:29:38,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4896640826873385 [2025-02-06 18:29:38,431 INFO L175 Difference]: Start difference. First operand has 82 places, 77 transitions, 196 flow. Second operand 9 states and 379 transitions. [2025-02-06 18:29:38,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 169 transitions, 783 flow [2025-02-06 18:29:38,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 169 transitions, 773 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:38,435 INFO L231 Difference]: Finished difference. Result has 89 places, 80 transitions, 223 flow [2025-02-06 18:29:38,435 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-02-06 18:29:38,436 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 11 predicate places. [2025-02-06 18:29:38,436 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 80 transitions, 223 flow [2025-02-06 18:29:38,436 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-02-06 18:29:38,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:38,437 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:38,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:29:38,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:38,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:38,437 INFO L85 PathProgramCache]: Analyzing trace with hash -165116390, now seen corresponding path program 1 times [2025-02-06 18:29:38,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:38,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567098903] [2025-02-06 18:29:38,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:38,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:38,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:29:38,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:29:38,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:38,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:38,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:38,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567098903] [2025-02-06 18:29:38,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567098903] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:29:38,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114127997] [2025-02-06 18:29:38,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:38,519 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:29:38,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:29:38,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:29:38,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:29:38,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:38,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:38,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:29:38,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:29:38,702 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:38,702 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:29:38,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114127997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:38,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:29:38,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-06 18:29:38,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573807920] [2025-02-06 18:29:38,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:38,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:38,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:38,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:38,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:29:38,711 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-02-06 18:29:38,712 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-02-06 18:29:38,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:38,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-02-06 18:29:38,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:39,204 INFO L124 PetriNetUnfolderBase]: 2140/4297 cut-off events. [2025-02-06 18:29:39,204 INFO L125 PetriNetUnfolderBase]: For 819/903 co-relation queries the response was YES. [2025-02-06 18:29:39,210 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-02-06 18:29:39,222 INFO L140 encePairwiseOnDemand]: 82/86 looper letters, 106 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-02-06 18:29:39,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 139 transitions, 613 flow [2025-02-06 18:29:39,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-02-06 18:29:39,224 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-02-06 18:29:39,224 INFO L175 Difference]: Start difference. First operand has 89 places, 80 transitions, 223 flow. Second operand 4 states and 233 transitions. [2025-02-06 18:29:39,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 139 transitions, 613 flow [2025-02-06 18:29:39,227 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 139 transitions, 591 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:39,229 INFO L231 Difference]: Finished difference. Result has 87 places, 79 transitions, 221 flow [2025-02-06 18:29:39,229 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-02-06 18:29:39,230 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 9 predicate places. [2025-02-06 18:29:39,230 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 79 transitions, 221 flow [2025-02-06 18:29:39,230 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-02-06 18:29:39,230 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:39,230 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-02-06 18:29:39,238 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:29:39,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:39,435 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:39,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:39,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2093351021, now seen corresponding path program 1 times [2025-02-06 18:29:39,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:39,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264067873] [2025-02-06 18:29:39,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:39,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:39,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:29:39,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:29:39,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:39,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:40,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:40,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:40,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264067873] [2025-02-06 18:29:40,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264067873] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:40,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:40,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:40,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809435277] [2025-02-06 18:29:40,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:40,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:40,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:40,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:40,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:40,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 86 [2025-02-06 18:29:40,279 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-02-06 18:29:40,280 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:40,280 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 86 [2025-02-06 18:29:40,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:41,036 INFO L124 PetriNetUnfolderBase]: 2277/4734 cut-off events. [2025-02-06 18:29:41,037 INFO L125 PetriNetUnfolderBase]: For 2384/2456 co-relation queries the response was YES. [2025-02-06 18:29:41,046 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-02-06 18:29:41,062 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 134 selfloop transitions, 8 changer transitions 0/167 dead transitions. [2025-02-06 18:29:41,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 167 transitions, 866 flow [2025-02-06 18:29:41,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:29:41,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:29:41,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-02-06 18:29:41,065 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4883720930232558 [2025-02-06 18:29:41,065 INFO L175 Difference]: Start difference. First operand has 87 places, 79 transitions, 221 flow. Second operand 9 states and 378 transitions. [2025-02-06 18:29:41,065 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 167 transitions, 866 flow [2025-02-06 18:29:41,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 167 transitions, 783 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:41,071 INFO L231 Difference]: Finished difference. Result has 91 places, 78 transitions, 220 flow [2025-02-06 18:29:41,071 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-02-06 18:29:41,072 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 13 predicate places. [2025-02-06 18:29:41,072 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 78 transitions, 220 flow [2025-02-06 18:29:41,072 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-02-06 18:29:41,072 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:41,073 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:41,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:29:41,073 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:41,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:41,073 INFO L85 PathProgramCache]: Analyzing trace with hash -823640014, now seen corresponding path program 1 times [2025-02-06 18:29:41,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:41,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943634022] [2025-02-06 18:29:41,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:41,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:41,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:29:41,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:29:41,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:41,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:29:41,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:41,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943634022] [2025-02-06 18:29:41,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943634022] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:41,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:41,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:41,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175504582] [2025-02-06 18:29:41,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:41,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:41,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:41,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:41,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:41,128 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-02-06 18:29:41,128 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-02-06 18:29:41,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:41,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-02-06 18:29:41,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:41,586 INFO L124 PetriNetUnfolderBase]: 1994/4203 cut-off events. [2025-02-06 18:29:41,586 INFO L125 PetriNetUnfolderBase]: For 1066/1110 co-relation queries the response was YES. [2025-02-06 18:29:41,593 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-02-06 18:29:41,603 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 99 selfloop transitions, 6 changer transitions 6/138 dead transitions. [2025-02-06 18:29:41,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 138 transitions, 620 flow [2025-02-06 18:29:41,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:41,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:41,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 233 transitions. [2025-02-06 18:29:41,605 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6773255813953488 [2025-02-06 18:29:41,605 INFO L175 Difference]: Start difference. First operand has 91 places, 78 transitions, 220 flow. Second operand 4 states and 233 transitions. [2025-02-06 18:29:41,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 138 transitions, 620 flow [2025-02-06 18:29:41,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 586 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:29:41,611 INFO L231 Difference]: Finished difference. Result has 88 places, 76 transitions, 220 flow [2025-02-06 18:29:41,611 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-02-06 18:29:41,612 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 10 predicate places. [2025-02-06 18:29:41,612 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 76 transitions, 220 flow [2025-02-06 18:29:41,612 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-02-06 18:29:41,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:41,613 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-02-06 18:29:41,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:29:41,613 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:41,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 469342208, now seen corresponding path program 1 times [2025-02-06 18:29:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:41,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484084604] [2025-02-06 18:29:41,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:41,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:41,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 18:29:41,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 18:29:41,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:41,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:41,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:41,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:41,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484084604] [2025-02-06 18:29:41,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484084604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:41,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:41,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:41,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599616207] [2025-02-06 18:29:41,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:41,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:41,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:41,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:41,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:41,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:29:41,686 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-02-06 18:29:41,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:41,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:29:41,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:42,222 INFO L124 PetriNetUnfolderBase]: 2829/5808 cut-off events. [2025-02-06 18:29:42,222 INFO L125 PetriNetUnfolderBase]: For 3596/3606 co-relation queries the response was YES. [2025-02-06 18:29:42,232 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-02-06 18:29:42,248 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 93 selfloop transitions, 3 changer transitions 0/121 dead transitions. [2025-02-06 18:29:42,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 121 transitions, 578 flow [2025-02-06 18:29:42,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:42,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:42,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 220 transitions. [2025-02-06 18:29:42,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6395348837209303 [2025-02-06 18:29:42,250 INFO L175 Difference]: Start difference. First operand has 88 places, 76 transitions, 220 flow. Second operand 4 states and 220 transitions. [2025-02-06 18:29:42,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 121 transitions, 578 flow [2025-02-06 18:29:42,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 121 transitions, 556 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:29:42,258 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 240 flow [2025-02-06 18:29:42,259 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-02-06 18:29:42,259 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 12 predicate places. [2025-02-06 18:29:42,259 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 240 flow [2025-02-06 18:29:42,259 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-02-06 18:29:42,260 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:42,260 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-02-06 18:29:42,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:29:42,260 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:42,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:42,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1665662611, now seen corresponding path program 1 times [2025-02-06 18:29:42,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:42,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53641792] [2025-02-06 18:29:42,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:42,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:42,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:29:42,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:29:42,301 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:42,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:42,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53641792] [2025-02-06 18:29:42,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53641792] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:42,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:42,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:42,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418066422] [2025-02-06 18:29:42,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:42,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:42,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:42,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:42,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:42,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-02-06 18:29:42,746 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-02-06 18:29:42,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:42,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-02-06 18:29:42,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:43,535 INFO L124 PetriNetUnfolderBase]: 2968/6034 cut-off events. [2025-02-06 18:29:43,535 INFO L125 PetriNetUnfolderBase]: For 2660/2726 co-relation queries the response was YES. [2025-02-06 18:29:43,555 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-02-06 18:29:43,577 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 15 changer transitions 2/192 dead transitions. [2025-02-06 18:29:43,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 192 transitions, 1000 flow [2025-02-06 18:29:43,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:29:43,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:29:43,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2025-02-06 18:29:43,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5174418604651163 [2025-02-06 18:29:43,580 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 240 flow. Second operand 10 states and 445 transitions. [2025-02-06 18:29:43,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 192 transitions, 1000 flow [2025-02-06 18:29:43,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 192 transitions, 997 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:43,591 INFO L231 Difference]: Finished difference. Result has 101 places, 85 transitions, 312 flow [2025-02-06 18:29:43,591 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-02-06 18:29:43,593 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-02-06 18:29:43,593 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 85 transitions, 312 flow [2025-02-06 18:29:43,593 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-02-06 18:29:43,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:43,593 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-02-06 18:29:43,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:29:43,594 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:43,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:43,594 INFO L85 PathProgramCache]: Analyzing trace with hash 95934146, now seen corresponding path program 1 times [2025-02-06 18:29:43,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:43,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269229554] [2025-02-06 18:29:43,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:43,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:43,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:29:43,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:29:43,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:43,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:44,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:44,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:44,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269229554] [2025-02-06 18:29:44,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269229554] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:44,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:44,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:44,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508139124] [2025-02-06 18:29:44,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:44,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:44,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:44,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:44,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:44,066 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:29:44,067 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-02-06 18:29:44,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:44,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:29:44,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:44,842 INFO L124 PetriNetUnfolderBase]: 2853/5963 cut-off events. [2025-02-06 18:29:44,842 INFO L125 PetriNetUnfolderBase]: For 3464/3530 co-relation queries the response was YES. [2025-02-06 18:29:44,865 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-02-06 18:29:44,886 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 150 selfloop transitions, 14 changer transitions 2/194 dead transitions. [2025-02-06 18:29:44,887 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 194 transitions, 1075 flow [2025-02-06 18:29:44,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:29:44,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:29:44,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2025-02-06 18:29:44,889 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536046511627907 [2025-02-06 18:29:44,889 INFO L175 Difference]: Start difference. First operand has 101 places, 85 transitions, 312 flow. Second operand 10 states and 461 transitions. [2025-02-06 18:29:44,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 194 transitions, 1075 flow [2025-02-06 18:29:44,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 194 transitions, 1063 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:29:44,900 INFO L231 Difference]: Finished difference. Result has 107 places, 88 transitions, 362 flow [2025-02-06 18:29:44,901 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-02-06 18:29:44,901 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 29 predicate places. [2025-02-06 18:29:44,901 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 88 transitions, 362 flow [2025-02-06 18:29:44,902 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-02-06 18:29:44,902 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:44,902 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-02-06 18:29:44,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:29:44,902 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:44,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash 202224693, now seen corresponding path program 1 times [2025-02-06 18:29:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:44,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458188069] [2025-02-06 18:29:44,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:44,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:44,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:29:44,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:29:44,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:44,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:44,982 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:44,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458188069] [2025-02-06 18:29:44,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458188069] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:29:44,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024950207] [2025-02-06 18:29:44,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:44,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:44,983 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:44,985 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:29:44,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:29:45,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:29:45,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:29:45,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:45,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:45,116 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:29:45,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:29:45,164 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:45,164 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:29:45,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024950207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:45,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:29:45,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-06 18:29:45,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108552025] [2025-02-06 18:29:45,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:45,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:45,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:45,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:45,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:29:45,178 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-02-06 18:29:45,179 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-02-06 18:29:45,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:45,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-02-06 18:29:45,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:45,914 INFO L124 PetriNetUnfolderBase]: 3140/6153 cut-off events. [2025-02-06 18:29:45,914 INFO L125 PetriNetUnfolderBase]: For 4513/4547 co-relation queries the response was YES. [2025-02-06 18:29:45,940 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-02-06 18:29:45,967 INFO L140 encePairwiseOnDemand]: 81/86 looper letters, 84 selfloop transitions, 5 changer transitions 0/114 dead transitions. [2025-02-06 18:29:45,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 114 transitions, 640 flow [2025-02-06 18:29:45,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:45,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2025-02-06 18:29:45,969 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5668604651162791 [2025-02-06 18:29:45,969 INFO L175 Difference]: Start difference. First operand has 107 places, 88 transitions, 362 flow. Second operand 4 states and 195 transitions. [2025-02-06 18:29:45,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 114 transitions, 640 flow [2025-02-06 18:29:45,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 622 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-02-06 18:29:45,987 INFO L231 Difference]: Finished difference. Result has 101 places, 86 transitions, 346 flow [2025-02-06 18:29:45,987 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-02-06 18:29:45,988 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 23 predicate places. [2025-02-06 18:29:45,988 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 86 transitions, 346 flow [2025-02-06 18:29:45,988 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-02-06 18:29:45,988 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:45,988 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-02-06 18:29:45,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:29:46,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:46,193 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:46,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:46,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1973998939, now seen corresponding path program 1 times [2025-02-06 18:29:46,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:46,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838746249] [2025-02-06 18:29:46,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:46,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:46,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:29:46,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:29:46,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:46,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:29:46,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:46,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838746249] [2025-02-06 18:29:46,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838746249] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:46,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:46,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:46,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075014054] [2025-02-06 18:29:46,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:46,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:46,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:46,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:46,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:46,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-02-06 18:29:46,259 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-02-06 18:29:46,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:46,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-02-06 18:29:46,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:46,809 INFO L124 PetriNetUnfolderBase]: 2784/5687 cut-off events. [2025-02-06 18:29:46,809 INFO L125 PetriNetUnfolderBase]: For 4472/4492 co-relation queries the response was YES. [2025-02-06 18:29:46,818 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-02-06 18:29:46,836 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 88 selfloop transitions, 6 changer transitions 0/119 dead transitions. [2025-02-06 18:29:46,836 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 119 transitions, 656 flow [2025-02-06 18:29:46,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-02-06 18:29:46,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5813953488372093 [2025-02-06 18:29:46,838 INFO L175 Difference]: Start difference. First operand has 101 places, 86 transitions, 346 flow. Second operand 4 states and 200 transitions. [2025-02-06 18:29:46,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 119 transitions, 656 flow [2025-02-06 18:29:46,849 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 119 transitions, 646 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:46,850 INFO L231 Difference]: Finished difference. Result has 100 places, 85 transitions, 348 flow [2025-02-06 18:29:46,851 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-02-06 18:29:46,851 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 22 predicate places. [2025-02-06 18:29:46,852 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 85 transitions, 348 flow [2025-02-06 18:29:46,852 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-02-06 18:29:46,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:46,852 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-02-06 18:29:46,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:29:46,852 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:46,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:46,853 INFO L85 PathProgramCache]: Analyzing trace with hash -886420645, now seen corresponding path program 1 times [2025-02-06 18:29:46,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:46,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705369266] [2025-02-06 18:29:46,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:46,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:46,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:29:46,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:29:46,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:46,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:46,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:46,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705369266] [2025-02-06 18:29:46,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705369266] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:46,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:46,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:46,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430149415] [2025-02-06 18:29:46,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:46,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:29:46,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:46,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:29:46,935 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:29:46,935 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-02-06 18:29:46,935 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-02-06 18:29:46,935 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:46,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-02-06 18:29:46,936 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:47,269 INFO L124 PetriNetUnfolderBase]: 1726/3929 cut-off events. [2025-02-06 18:29:47,270 INFO L125 PetriNetUnfolderBase]: For 4062/4062 co-relation queries the response was YES. [2025-02-06 18:29:47,282 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-02-06 18:29:47,296 INFO L140 encePairwiseOnDemand]: 80/86 looper letters, 64 selfloop transitions, 6 changer transitions 0/97 dead transitions. [2025-02-06 18:29:47,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 97 transitions, 534 flow [2025-02-06 18:29:47,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:29:47,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:29:47,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-02-06 18:29:47,298 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-02-06 18:29:47,298 INFO L175 Difference]: Start difference. First operand has 100 places, 85 transitions, 348 flow. Second operand 3 states and 166 transitions. [2025-02-06 18:29:47,298 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 97 transitions, 534 flow [2025-02-06 18:29:47,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 97 transitions, 508 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:47,308 INFO L231 Difference]: Finished difference. Result has 99 places, 80 transitions, 303 flow [2025-02-06 18:29:47,309 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-02-06 18:29:47,309 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 21 predicate places. [2025-02-06 18:29:47,309 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 80 transitions, 303 flow [2025-02-06 18:29:47,309 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-02-06 18:29:47,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:47,310 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-02-06 18:29:47,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:29:47,310 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:47,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:47,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1834171490, now seen corresponding path program 1 times [2025-02-06 18:29:47,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:47,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077877504] [2025-02-06 18:29:47,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:47,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:47,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:29:47,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:29:47,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:47,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:47,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:47,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:47,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077877504] [2025-02-06 18:29:47,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077877504] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:47,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:47,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:29:47,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750789216] [2025-02-06 18:29:47,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:47,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:47,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:47,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:47,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:47,785 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:29:47,786 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-02-06 18:29:47,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:47,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:29:47,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:48,330 INFO L124 PetriNetUnfolderBase]: 1760/3862 cut-off events. [2025-02-06 18:29:48,331 INFO L125 PetriNetUnfolderBase]: For 3541/3543 co-relation queries the response was YES. [2025-02-06 18:29:48,338 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-02-06 18:29:48,351 INFO L140 encePairwiseOnDemand]: 76/86 looper letters, 109 selfloop transitions, 9 changer transitions 2/145 dead transitions. [2025-02-06 18:29:48,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 145 transitions, 832 flow [2025-02-06 18:29:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:29:48,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:29:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 357 transitions. [2025-02-06 18:29:48,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5188953488372093 [2025-02-06 18:29:48,353 INFO L175 Difference]: Start difference. First operand has 99 places, 80 transitions, 303 flow. Second operand 8 states and 357 transitions. [2025-02-06 18:29:48,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 145 transitions, 832 flow [2025-02-06 18:29:48,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 145 transitions, 820 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:48,364 INFO L231 Difference]: Finished difference. Result has 105 places, 79 transitions, 311 flow [2025-02-06 18:29:48,364 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-02-06 18:29:48,364 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 27 predicate places. [2025-02-06 18:29:48,365 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 79 transitions, 311 flow [2025-02-06 18:29:48,365 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-02-06 18:29:48,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:48,365 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-02-06 18:29:48,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:29:48,365 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:48,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:48,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1891934825, now seen corresponding path program 1 times [2025-02-06 18:29:48,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:48,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177550741] [2025-02-06 18:29:48,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:48,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:48,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 18:29:48,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 18:29:48,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:48,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:49,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:49,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:49,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177550741] [2025-02-06 18:29:49,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177550741] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:49,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:49,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:29:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97861962] [2025-02-06 18:29:49,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:49,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:29:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:49,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:29:49,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:29:49,088 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-02-06 18:29:49,089 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-02-06 18:29:49,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:49,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-02-06 18:29:49,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:49,767 INFO L124 PetriNetUnfolderBase]: 2162/4614 cut-off events. [2025-02-06 18:29:49,768 INFO L125 PetriNetUnfolderBase]: For 4416/4416 co-relation queries the response was YES. [2025-02-06 18:29:49,779 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-02-06 18:29:49,793 INFO L140 encePairwiseOnDemand]: 75/86 looper letters, 147 selfloop transitions, 12 changer transitions 2/183 dead transitions. [2025-02-06 18:29:49,793 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 183 transitions, 1076 flow [2025-02-06 18:29:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:29:49,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:29:49,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 455 transitions. [2025-02-06 18:29:49,795 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4809725158562368 [2025-02-06 18:29:49,795 INFO L175 Difference]: Start difference. First operand has 105 places, 79 transitions, 311 flow. Second operand 11 states and 455 transitions. [2025-02-06 18:29:49,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 183 transitions, 1076 flow [2025-02-06 18:29:49,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 183 transitions, 1060 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:29:49,806 INFO L231 Difference]: Finished difference. Result has 113 places, 84 transitions, 360 flow [2025-02-06 18:29:49,807 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-02-06 18:29:49,807 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 35 predicate places. [2025-02-06 18:29:49,807 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 84 transitions, 360 flow [2025-02-06 18:29:49,807 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-02-06 18:29:49,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:49,808 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-02-06 18:29:49,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:29:49,808 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:49,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:49,809 INFO L85 PathProgramCache]: Analyzing trace with hash 739624328, now seen corresponding path program 1 times [2025-02-06 18:29:49,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:49,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344062705] [2025-02-06 18:29:49,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:49,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:49,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 18:29:49,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 18:29:49,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:49,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:49,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:49,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344062705] [2025-02-06 18:29:49,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344062705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:49,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:49,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564046701] [2025-02-06 18:29:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:49,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:29:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:49,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:29:49,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:29:49,896 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 86 [2025-02-06 18:29:49,897 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-02-06 18:29:49,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:49,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 86 [2025-02-06 18:29:49,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:50,271 INFO L124 PetriNetUnfolderBase]: 1680/3798 cut-off events. [2025-02-06 18:29:50,272 INFO L125 PetriNetUnfolderBase]: For 4278/4284 co-relation queries the response was YES. [2025-02-06 18:29:50,287 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-02-06 18:29:50,299 INFO L140 encePairwiseOnDemand]: 83/86 looper letters, 71 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2025-02-06 18:29:50,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 101 transitions, 575 flow [2025-02-06 18:29:50,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:29:50,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:29:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-02-06 18:29:50,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6434108527131783 [2025-02-06 18:29:50,301 INFO L175 Difference]: Start difference. First operand has 113 places, 84 transitions, 360 flow. Second operand 3 states and 166 transitions. [2025-02-06 18:29:50,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 101 transitions, 575 flow [2025-02-06 18:29:50,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 101 transitions, 562 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:29:50,315 INFO L231 Difference]: Finished difference. Result has 110 places, 82 transitions, 343 flow [2025-02-06 18:29:50,315 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-02-06 18:29:50,315 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 32 predicate places. [2025-02-06 18:29:50,315 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 82 transitions, 343 flow [2025-02-06 18:29:50,315 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-02-06 18:29:50,316 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:50,316 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-02-06 18:29:50,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:29:50,316 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:50,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:50,316 INFO L85 PathProgramCache]: Analyzing trace with hash 645781617, now seen corresponding path program 1 times [2025-02-06 18:29:50,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:50,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787867838] [2025-02-06 18:29:50,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:50,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:50,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 18:29:50,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 18:29:50,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:50,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:50,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:50,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:50,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787867838] [2025-02-06 18:29:50,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787867838] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:50,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:50,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:29:50,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901935868] [2025-02-06 18:29:50,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:50,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:29:50,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:50,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:29:50,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 18:29:50,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 86 [2025-02-06 18:29:50,585 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-02-06 18:29:50,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:50,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 86 [2025-02-06 18:29:50,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:51,035 INFO L124 PetriNetUnfolderBase]: 1676/3747 cut-off events. [2025-02-06 18:29:51,035 INFO L125 PetriNetUnfolderBase]: For 3887/3887 co-relation queries the response was YES. [2025-02-06 18:29:51,049 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-02-06 18:29:51,061 INFO L140 encePairwiseOnDemand]: 78/86 looper letters, 59 selfloop transitions, 12 changer transitions 0/97 dead transitions. [2025-02-06 18:29:51,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 97 transitions, 554 flow [2025-02-06 18:29:51,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:29:51,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:29:51,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 226 transitions. [2025-02-06 18:29:51,062 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5255813953488372 [2025-02-06 18:29:51,062 INFO L175 Difference]: Start difference. First operand has 110 places, 82 transitions, 343 flow. Second operand 5 states and 226 transitions. [2025-02-06 18:29:51,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 97 transitions, 554 flow [2025-02-06 18:29:51,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 97 transitions, 550 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:29:51,075 INFO L231 Difference]: Finished difference. Result has 111 places, 81 transitions, 361 flow [2025-02-06 18:29:51,076 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-02-06 18:29:51,076 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 33 predicate places. [2025-02-06 18:29:51,076 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 81 transitions, 361 flow [2025-02-06 18:29:51,076 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-02-06 18:29:51,076 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:51,076 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-02-06 18:29:51,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:29:51,077 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:51,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:51,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1675858379, now seen corresponding path program 1 times [2025-02-06 18:29:51,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:51,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093891238] [2025-02-06 18:29:51,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:51,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 18:29:51,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 18:29:51,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:51,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:51,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:51,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093891238] [2025-02-06 18:29:51,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093891238] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:51,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:29:51,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510041109] [2025-02-06 18:29:51,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:51,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:29:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:51,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:29:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:29:51,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-02-06 18:29:51,875 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-02-06 18:29:51,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:51,876 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-02-06 18:29:51,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:52,586 INFO L124 PetriNetUnfolderBase]: 1808/3867 cut-off events. [2025-02-06 18:29:52,586 INFO L125 PetriNetUnfolderBase]: For 4482/4484 co-relation queries the response was YES. [2025-02-06 18:29:52,603 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-02-06 18:29:52,616 INFO L140 encePairwiseOnDemand]: 70/86 looper letters, 141 selfloop transitions, 14 changer transitions 18/196 dead transitions. [2025-02-06 18:29:52,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 196 transitions, 1201 flow [2025-02-06 18:29:52,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 18:29:52,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 18:29:52,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 534 transitions. [2025-02-06 18:29:52,619 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4776386404293381 [2025-02-06 18:29:52,619 INFO L175 Difference]: Start difference. First operand has 111 places, 81 transitions, 361 flow. Second operand 13 states and 534 transitions. [2025-02-06 18:29:52,619 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 196 transitions, 1201 flow [2025-02-06 18:29:52,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 196 transitions, 1177 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:52,639 INFO L231 Difference]: Finished difference. Result has 122 places, 85 transitions, 394 flow [2025-02-06 18:29:52,640 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-02-06 18:29:52,640 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 44 predicate places. [2025-02-06 18:29:52,640 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 85 transitions, 394 flow [2025-02-06 18:29:52,640 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-02-06 18:29:52,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:52,641 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-02-06 18:29:52,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:29:52,641 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:52,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 394201899, now seen corresponding path program 1 times [2025-02-06 18:29:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:52,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93473509] [2025-02-06 18:29:52,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:52,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:29:52,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:29:52,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:52,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:53,616 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:53,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93473509] [2025-02-06 18:29:53,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93473509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:29:53,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021887852] [2025-02-06 18:29:53,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:53,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:53,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:53,620 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:29:53,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 18:29:53,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:29:53,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:29:53,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:53,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:53,790 INFO L256 TraceCheckSpWp]: Trace formula consists of 461 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-02-06 18:29:53,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:29:53,836 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-02-06 18:29:53,917 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:29:53,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:29:53,945 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-02-06 18:29:53,946 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-02-06 18:29:54,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:29:54,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:29:54,005 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-02-06 18:29:54,081 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:29:54,081 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-02-06 18:29:54,167 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:29:54,168 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:29:54,191 INFO L349 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2025-02-06 18:29:54,191 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-02-06 18:29:54,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:29:54,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:29:54,248 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-02-06 18:29:54,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:29:54,287 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-02-06 18:29:54,373 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-02-06 18:29:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:54,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:29:59,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:59,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021887852] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:29:59,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:29:59,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 27 [2025-02-06 18:29:59,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192847261] [2025-02-06 18:29:59,364 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:29:59,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:29:59,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:59,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:29:59,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=593, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:30:03,433 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-02-06 18:30:03,551 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:30:03,553 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-02-06 18:30:03,553 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:03,553 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:30:03,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:05,020 INFO L124 PetriNetUnfolderBase]: 1748/3799 cut-off events. [2025-02-06 18:30:05,021 INFO L125 PetriNetUnfolderBase]: For 4496/4498 co-relation queries the response was YES. [2025-02-06 18:30:05,030 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-02-06 18:30:05,038 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 139 selfloop transitions, 15 changer transitions 17/196 dead transitions. [2025-02-06 18:30:05,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 196 transitions, 1218 flow [2025-02-06 18:30:05,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 18:30:05,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 18:30:05,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 558 transitions. [2025-02-06 18:30:05,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4991055456171735 [2025-02-06 18:30:05,039 INFO L175 Difference]: Start difference. First operand has 122 places, 85 transitions, 394 flow. Second operand 13 states and 558 transitions. [2025-02-06 18:30:05,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 196 transitions, 1218 flow [2025-02-06 18:30:05,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 196 transitions, 1196 flow, removed 1 selfloop flow, removed 9 redundant places. [2025-02-06 18:30:05,054 INFO L231 Difference]: Finished difference. Result has 126 places, 85 transitions, 407 flow [2025-02-06 18:30:05,054 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-02-06 18:30:05,055 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 48 predicate places. [2025-02-06 18:30:05,055 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 85 transitions, 407 flow [2025-02-06 18:30:05,055 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-02-06 18:30:05,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:05,056 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-02-06 18:30:05,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-06 18:30:05,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:05,257 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:05,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:05,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1213459165, now seen corresponding path program 1 times [2025-02-06 18:30:05,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:05,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207647307] [2025-02-06 18:30:05,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:05,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:05,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:30:05,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:30:05,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:05,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:05,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:30:05,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:05,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207647307] [2025-02-06 18:30:05,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207647307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:05,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:05,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:30:05,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112038212] [2025-02-06 18:30:05,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:05,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:30:05,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:05,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:30:05,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:30:05,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 86 [2025-02-06 18:30:05,659 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-02-06 18:30:05,659 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:05,659 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 86 [2025-02-06 18:30:05,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:06,157 INFO L124 PetriNetUnfolderBase]: 1928/4172 cut-off events. [2025-02-06 18:30:06,157 INFO L125 PetriNetUnfolderBase]: For 4689/4689 co-relation queries the response was YES. [2025-02-06 18:30:06,168 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-02-06 18:30:06,177 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 102 selfloop transitions, 19 changer transitions 0/143 dead transitions. [2025-02-06 18:30:06,177 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 143 transitions, 900 flow [2025-02-06 18:30:06,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:30:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:30:06,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-02-06 18:30:06,178 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2025-02-06 18:30:06,178 INFO L175 Difference]: Start difference. First operand has 126 places, 85 transitions, 407 flow. Second operand 8 states and 330 transitions. [2025-02-06 18:30:06,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 143 transitions, 900 flow [2025-02-06 18:30:06,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 143 transitions, 872 flow, removed 1 selfloop flow, removed 11 redundant places. [2025-02-06 18:30:06,194 INFO L231 Difference]: Finished difference. Result has 120 places, 87 transitions, 427 flow [2025-02-06 18:30:06,195 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-02-06 18:30:06,195 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 42 predicate places. [2025-02-06 18:30:06,195 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 87 transitions, 427 flow [2025-02-06 18:30:06,195 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-02-06 18:30:06,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:06,196 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-02-06 18:30:06,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:30:06,196 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:06,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:06,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1549495869, now seen corresponding path program 1 times [2025-02-06 18:30:06,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:06,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173804020] [2025-02-06 18:30:06,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:06,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:06,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 18:30:06,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 18:30:06,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:06,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:07,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:07,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:07,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173804020] [2025-02-06 18:30:07,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173804020] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:07,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:07,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-02-06 18:30:07,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776455239] [2025-02-06 18:30:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:07,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 18:30:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:07,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 18:30:07,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-02-06 18:30:07,952 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 86 [2025-02-06 18:30:07,952 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-02-06 18:30:07,952 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:07,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 86 [2025-02-06 18:30:07,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:09,008 INFO L124 PetriNetUnfolderBase]: 2274/4901 cut-off events. [2025-02-06 18:30:09,008 INFO L125 PetriNetUnfolderBase]: For 5375/5375 co-relation queries the response was YES. [2025-02-06 18:30:09,023 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-02-06 18:30:09,035 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 192 selfloop transitions, 20 changer transitions 12/247 dead transitions. [2025-02-06 18:30:09,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 247 transitions, 1605 flow [2025-02-06 18:30:09,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 18:30:09,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-02-06 18:30:09,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 594 transitions. [2025-02-06 18:30:09,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4316860465116279 [2025-02-06 18:30:09,037 INFO L175 Difference]: Start difference. First operand has 120 places, 87 transitions, 427 flow. Second operand 16 states and 594 transitions. [2025-02-06 18:30:09,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 247 transitions, 1605 flow [2025-02-06 18:30:09,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 247 transitions, 1578 flow, removed 8 selfloop flow, removed 3 redundant places. [2025-02-06 18:30:09,055 INFO L231 Difference]: Finished difference. Result has 137 places, 94 transitions, 532 flow [2025-02-06 18:30:09,055 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-02-06 18:30:09,055 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 59 predicate places. [2025-02-06 18:30:09,055 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 94 transitions, 532 flow [2025-02-06 18:30:09,056 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-02-06 18:30:09,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:09,056 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-02-06 18:30:09,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 18:30:09,056 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:09,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:09,057 INFO L85 PathProgramCache]: Analyzing trace with hash -998562279, now seen corresponding path program 1 times [2025-02-06 18:30:09,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:09,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242608871] [2025-02-06 18:30:09,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:09,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:09,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 18:30:09,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 18:30:09,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:09,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:10,134 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:10,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242608871] [2025-02-06 18:30:10,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242608871] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:10,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035337779] [2025-02-06 18:30:10,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:10,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:10,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:10,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:30:10,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:30:10,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 18:30:10,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 18:30:10,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:10,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:10,311 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-02-06 18:30:10,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:10,429 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-02-06 18:30:10,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:30:10,540 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-02-06 18:30:10,571 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-02-06 18:30:10,617 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2025-02-06 18:30:10,617 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-02-06 18:30:10,653 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-02-06 18:30:10,661 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-02-06 18:30:10,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:10,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:30:10,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2035337779] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:10,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:30:10,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [10] total 17 [2025-02-06 18:30:10,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664608406] [2025-02-06 18:30:10,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:10,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:30:10,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:10,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:30:10,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2025-02-06 18:30:10,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-02-06 18:30:10,695 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-02-06 18:30:10,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:10,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-02-06 18:30:10,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:11,229 INFO L124 PetriNetUnfolderBase]: 2259/4906 cut-off events. [2025-02-06 18:30:11,229 INFO L125 PetriNetUnfolderBase]: For 6493/6493 co-relation queries the response was YES. [2025-02-06 18:30:11,239 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-02-06 18:30:11,247 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 71 selfloop transitions, 25 changer transitions 0/118 dead transitions. [2025-02-06 18:30:11,247 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 118 transitions, 831 flow [2025-02-06 18:30:11,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:30:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:30:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 245 transitions. [2025-02-06 18:30:11,248 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4748062015503876 [2025-02-06 18:30:11,248 INFO L175 Difference]: Start difference. First operand has 137 places, 94 transitions, 532 flow. Second operand 6 states and 245 transitions. [2025-02-06 18:30:11,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 118 transitions, 831 flow [2025-02-06 18:30:11,262 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 118 transitions, 803 flow, removed 2 selfloop flow, removed 11 redundant places. [2025-02-06 18:30:11,263 INFO L231 Difference]: Finished difference. Result has 129 places, 93 transitions, 550 flow [2025-02-06 18:30:11,263 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-02-06 18:30:11,263 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 51 predicate places. [2025-02-06 18:30:11,263 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 93 transitions, 550 flow [2025-02-06 18:30:11,263 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-02-06 18:30:11,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:11,263 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-02-06 18:30:11,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:30:11,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-06 18:30:11,464 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:11,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:11,465 INFO L85 PathProgramCache]: Analyzing trace with hash -206399880, now seen corresponding path program 1 times [2025-02-06 18:30:11,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:11,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575296732] [2025-02-06 18:30:11,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:11,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:11,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-02-06 18:30:11,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-02-06 18:30:11,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:11,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:12,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:12,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575296732] [2025-02-06 18:30:12,419 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575296732] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:12,419 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:12,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:30:12,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304592542] [2025-02-06 18:30:12,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:12,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:30:12,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:12,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:30:12,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:30:12,460 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:30:12,461 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-02-06 18:30:12,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:12,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:30:12,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:13,362 INFO L124 PetriNetUnfolderBase]: 2327/5055 cut-off events. [2025-02-06 18:30:13,362 INFO L125 PetriNetUnfolderBase]: For 7558/7562 co-relation queries the response was YES. [2025-02-06 18:30:13,374 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-02-06 18:30:13,382 INFO L140 encePairwiseOnDemand]: 72/86 looper letters, 151 selfloop transitions, 17 changer transitions 14/207 dead transitions. [2025-02-06 18:30:13,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 207 transitions, 1430 flow [2025-02-06 18:30:13,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 18:30:13,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 18:30:13,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 561 transitions. [2025-02-06 18:30:13,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.501788908765653 [2025-02-06 18:30:13,384 INFO L175 Difference]: Start difference. First operand has 129 places, 93 transitions, 550 flow. Second operand 13 states and 561 transitions. [2025-02-06 18:30:13,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 207 transitions, 1430 flow [2025-02-06 18:30:13,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 207 transitions, 1374 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:30:13,398 INFO L231 Difference]: Finished difference. Result has 141 places, 98 transitions, 599 flow [2025-02-06 18:30:13,398 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-02-06 18:30:13,399 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 63 predicate places. [2025-02-06 18:30:13,399 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 98 transitions, 599 flow [2025-02-06 18:30:13,399 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-02-06 18:30:13,399 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:13,399 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-02-06 18:30:13,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:30:13,400 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:13,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:13,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1045320147, now seen corresponding path program 1 times [2025-02-06 18:30:13,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:13,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118234310] [2025-02-06 18:30:13,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:13,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:13,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 18:30:13,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 18:30:13,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:13,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:14,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:14,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:14,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118234310] [2025-02-06 18:30:14,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118234310] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:14,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726188667] [2025-02-06 18:30:14,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:14,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:14,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:14,746 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:30:14,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:30:14,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-02-06 18:30:14,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-02-06 18:30:14,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:14,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:14,932 INFO L256 TraceCheckSpWp]: Trace formula consists of 531 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-06 18:30:14,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:14,949 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-02-06 18:30:15,001 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:15,011 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-06 18:30:15,012 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-02-06 18:30:15,051 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-02-06 18:30:15,107 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-02-06 18:30:15,165 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:15,176 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-06 18:30:15,176 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-02-06 18:30:15,219 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-02-06 18:30:15,266 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-02-06 18:30:15,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:30:15,353 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-02-06 18:30:15,374 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-02-06 18:30:15,399 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-02-06 18:30:15,447 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:15,447 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:30:16,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:16,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726188667] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:30:16,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:30:16,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 14] total 35 [2025-02-06 18:30:16,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149554415] [2025-02-06 18:30:16,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:30:16,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-02-06 18:30:16,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:16,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-02-06 18:30:16,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1044, Unknown=0, NotChecked=0, Total=1260 [2025-02-06 18:30:16,407 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 86 [2025-02-06 18:30:16,409 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-02-06 18:30:16,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:16,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 86 [2025-02-06 18:30:16,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:19,369 INFO L124 PetriNetUnfolderBase]: 2565/5645 cut-off events. [2025-02-06 18:30:19,369 INFO L125 PetriNetUnfolderBase]: For 8405/8405 co-relation queries the response was YES. [2025-02-06 18:30:19,381 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-02-06 18:30:19,390 INFO L140 encePairwiseOnDemand]: 71/86 looper letters, 236 selfloop transitions, 35 changer transitions 17/313 dead transitions. [2025-02-06 18:30:19,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 313 transitions, 2106 flow [2025-02-06 18:30:19,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 18:30:19,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-06 18:30:19,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 1116 transitions. [2025-02-06 18:30:19,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4806201550387597 [2025-02-06 18:30:19,393 INFO L175 Difference]: Start difference. First operand has 141 places, 98 transitions, 599 flow. Second operand 27 states and 1116 transitions. [2025-02-06 18:30:19,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 313 transitions, 2106 flow [2025-02-06 18:30:19,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 313 transitions, 2050 flow, removed 4 selfloop flow, removed 17 redundant places. [2025-02-06 18:30:19,415 INFO L231 Difference]: Finished difference. Result has 152 places, 106 transitions, 679 flow [2025-02-06 18:30:19,416 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-02-06 18:30:19,416 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 74 predicate places. [2025-02-06 18:30:19,416 INFO L471 AbstractCegarLoop]: Abstraction has has 152 places, 106 transitions, 679 flow [2025-02-06 18:30:19,417 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-02-06 18:30:19,417 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:19,417 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-02-06 18:30:19,425 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-06 18:30:19,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-02-06 18:30:19,618 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:19,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:19,619 INFO L85 PathProgramCache]: Analyzing trace with hash 562969654, now seen corresponding path program 1 times [2025-02-06 18:30:19,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:19,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40530935] [2025-02-06 18:30:19,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:19,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:19,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 18:30:19,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 18:30:19,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:19,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:21,655 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:21,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40530935] [2025-02-06 18:30:21,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40530935] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750143982] [2025-02-06 18:30:21,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:21,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:21,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:21,658 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:30:21,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-06 18:30:21,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 18:30:21,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 18:30:21,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:21,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:21,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 536 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 18:30:21,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:22,002 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-02-06 18:30:22,043 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-02-06 18:30:22,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:30:22,119 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-02-06 18:30:22,119 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-02-06 18:30:22,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:30:22,283 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:22,304 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-02-06 18:30:22,304 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-02-06 18:30:22,466 INFO L349 Elim1Store]: treesize reduction 30, result has 44.4 percent of original size [2025-02-06 18:30:22,467 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-02-06 18:30:22,558 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-02-06 18:30:22,578 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:30:22,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:30:22,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750143982] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:22,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:30:22,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [16] total 25 [2025-02-06 18:30:22,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856557024] [2025-02-06 18:30:22,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:22,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:30:22,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:22,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:30:22,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2025-02-06 18:30:22,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 86 [2025-02-06 18:30:22,629 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-02-06 18:30:22,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:22,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 86 [2025-02-06 18:30:22,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:23,330 INFO L124 PetriNetUnfolderBase]: 2615/5624 cut-off events. [2025-02-06 18:30:23,330 INFO L125 PetriNetUnfolderBase]: For 7890/7902 co-relation queries the response was YES. [2025-02-06 18:30:23,341 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-02-06 18:30:23,349 INFO L140 encePairwiseOnDemand]: 74/86 looper letters, 94 selfloop transitions, 35 changer transitions 1/153 dead transitions. [2025-02-06 18:30:23,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 153 transitions, 1146 flow [2025-02-06 18:30:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:30:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:30:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 330 transitions. [2025-02-06 18:30:23,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4796511627906977 [2025-02-06 18:30:23,351 INFO L175 Difference]: Start difference. First operand has 152 places, 106 transitions, 679 flow. Second operand 8 states and 330 transitions. [2025-02-06 18:30:23,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 153 transitions, 1146 flow [2025-02-06 18:30:23,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 153 transitions, 1058 flow, removed 21 selfloop flow, removed 18 redundant places. [2025-02-06 18:30:23,364 INFO L231 Difference]: Finished difference. Result has 140 places, 105 transitions, 657 flow [2025-02-06 18:30:23,364 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-02-06 18:30:23,364 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 62 predicate places. [2025-02-06 18:30:23,364 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 105 transitions, 657 flow [2025-02-06 18:30:23,364 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-02-06 18:30:23,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:23,364 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-02-06 18:30:23,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-06 18:30:23,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 18:30:23,565 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:23,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:23,566 INFO L85 PathProgramCache]: Analyzing trace with hash -932074256, now seen corresponding path program 1 times [2025-02-06 18:30:23,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:23,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374997949] [2025-02-06 18:30:23,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:23,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:23,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 18:30:23,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 18:30:23,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:23,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:24,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:24,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:24,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374997949] [2025-02-06 18:30:24,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374997949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:24,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:24,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:30:24,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5299440] [2025-02-06 18:30:24,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:24,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:30:24,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:24,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:30:24,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:30:24,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 86 [2025-02-06 18:30:24,398 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-02-06 18:30:24,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:24,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 86 [2025-02-06 18:30:24,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:24,958 INFO L124 PetriNetUnfolderBase]: 2585/5672 cut-off events. [2025-02-06 18:30:24,958 INFO L125 PetriNetUnfolderBase]: For 7616/7616 co-relation queries the response was YES. [2025-02-06 18:30:24,971 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-02-06 18:30:24,982 INFO L140 encePairwiseOnDemand]: 77/86 looper letters, 78 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2025-02-06 18:30:24,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 127 transitions, 963 flow [2025-02-06 18:30:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:30:24,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:30:24,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 261 transitions. [2025-02-06 18:30:24,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5058139534883721 [2025-02-06 18:30:24,983 INFO L175 Difference]: Start difference. First operand has 140 places, 105 transitions, 657 flow. Second operand 6 states and 261 transitions. [2025-02-06 18:30:24,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 127 transitions, 963 flow [2025-02-06 18:30:24,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 127 transitions, 905 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-02-06 18:30:24,995 INFO L231 Difference]: Finished difference. Result has 138 places, 104 transitions, 647 flow [2025-02-06 18:30:24,995 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-02-06 18:30:25,000 INFO L279 CegarLoopForPetriNet]: 78 programPoint places, 60 predicate places. [2025-02-06 18:30:25,000 INFO L471 AbstractCegarLoop]: Abstraction has has 138 places, 104 transitions, 647 flow [2025-02-06 18:30:25,001 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-02-06 18:30:25,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:25,001 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-02-06 18:30:25,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 18:30:25,001 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:25,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:25,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1037194721, now seen corresponding path program 1 times [2025-02-06 18:30:25,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:25,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661575645] [2025-02-06 18:30:25,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:25,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:25,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:30:25,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:30:25,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:25,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:26,634 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:26,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661575645] [2025-02-06 18:30:26,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661575645] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:26,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863284129] [2025-02-06 18:30:26,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:26,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:26,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:26,637 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:30:26,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-06 18:30:26,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-02-06 18:30:26,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-02-06 18:30:26,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:26,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:26,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 99 conjuncts are in the unsatisfiable core [2025-02-06 18:30:26,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:26,821 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-02-06 18:30:26,882 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-02-06 18:30:26,922 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-02-06 18:30:27,007 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-02-06 18:30:27,095 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-02-06 18:30:27,150 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-02-06 18:30:27,251 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-02-06 18:30:27,361 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-02-06 18:30:27,424 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-02-06 18:30:27,535 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-02-06 18:30:27,583 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-02-06 18:30:27,647 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-02-06 18:30:27,727 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-02-06 18:30:27,733 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-02-06 18:30:27,755 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:27,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:30:29,818 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:29,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863284129] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:30:29,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:30:29,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 19] total 50 [2025-02-06 18:30:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417447892] [2025-02-06 18:30:29,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:30:29,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2025-02-06 18:30:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:29,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2025-02-06 18:30:29,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=509, Invalid=2143, Unknown=0, NotChecked=0, Total=2652 [2025-02-06 18:30:30,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 86 [2025-02-06 18:30:30,149 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-02-06 18:30:30,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:30,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 86 [2025-02-06 18:30:30,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:36,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]