./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-node-symm.wvr.c --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/weaver/chl-node-symm.wvr.c -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 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:48:48,214 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:48:48,274 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:48:48,279 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:48:48,279 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:48:48,302 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:48:48,303 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:48:48,303 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:48:48,304 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:48:48,304 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:48:48,304 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:48:48,304 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:48:48,304 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:48:48,304 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:48:48,304 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:48:48,304 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:48:48,304 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:48:48,305 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:48:48,306 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:48:48,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:48:48,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:48:48,307 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:48:48,307 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 -> 9db11e263e78e3a6bd75c2a0c3dda64920ec857df2fbb1d0b7b1072a48f36a31 [2025-02-06 18:48:48,562 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:48:48,571 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:48:48,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:48:48,575 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:48:48,576 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:48:48,578 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-06 18:48:49,826 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae6d2de6/02a2d225b6634fafa387d0969cedc374/FLAG9475b3dda [2025-02-06 18:48:50,102 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:48:50,103 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-symm.wvr.c [2025-02-06 18:48:50,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae6d2de6/02a2d225b6634fafa387d0969cedc374/FLAG9475b3dda [2025-02-06 18:48:50,127 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8ae6d2de6/02a2d225b6634fafa387d0969cedc374 [2025-02-06 18:48:50,130 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:48:50,132 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:48:50,133 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:48:50,134 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:48:50,138 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:48:50,139 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,140 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19211522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50, skipping insertion in model container [2025-02-06 18:48:50,140 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,156 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:48:50,311 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:48:50,324 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:48:50,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:48:50,371 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:48:50,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50 WrapperNode [2025-02-06 18:48:50,373 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:48:50,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:48:50,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:48:50,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:48:50,378 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:48:50" (1/1) ... [2025-02-06 18:48:50,387 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:48:50" (1/1) ... [2025-02-06 18:48:50,419 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 19, calls inlined = 25, statements flattened = 325 [2025-02-06 18:48:50,419 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:48:50,419 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:48:50,420 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:48:50,420 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:48:50,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,427 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,433 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,460 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-02-06 18:48:50,461 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,461 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,472 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,485 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:48:50,486 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:48:50,486 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:48:50,486 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:48:50,487 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (1/1) ... [2025-02-06 18:48:50,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:48:50,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:50,520 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:48:50,524 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:48:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:48:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 18:48:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 18:48:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 18:48:50,544 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:48:50,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 18:48:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:48:50,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:48:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:48:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:48:50,546 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:48:50,547 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:48:50,670 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:48:50,672 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:48:51,187 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:48:51,187 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:48:51,480 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:48:51,480 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:48:51,481 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:48:51 BoogieIcfgContainer [2025-02-06 18:48:51,481 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:48:51,483 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:48:51,483 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:48:51,488 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:48:51,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:48:50" (1/3) ... [2025-02-06 18:48:51,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f1e8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:48:51, skipping insertion in model container [2025-02-06 18:48:51,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:48:50" (2/3) ... [2025-02-06 18:48:51,489 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39f1e8ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:48:51, skipping insertion in model container [2025-02-06 18:48:51,489 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:48:51" (3/3) ... [2025-02-06 18:48:51,490 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-symm.wvr.c [2025-02-06 18:48:51,505 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:48:51,508 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-symm.wvr.c that has 3 procedures, 88 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-02-06 18:48:51,508 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:48:51,573 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:48:51,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 97 transitions, 208 flow [2025-02-06 18:48:51,652 INFO L124 PetriNetUnfolderBase]: 10/95 cut-off events. [2025-02-06 18:48:51,656 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:48:51,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 95 events. 10/95 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 252 event pairs, 0 based on Foata normal form. 0/55 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2025-02-06 18:48:51,659 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 97 transitions, 208 flow [2025-02-06 18:48:51,664 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 91 places, 94 transitions, 200 flow [2025-02-06 18:48:51,671 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:48:51,682 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;@51000f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:48:51,682 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-02-06 18:48:51,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:48:51,687 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-02-06 18:48:51,687 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:48:51,687 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:51,688 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1] [2025-02-06 18:48:51,688 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:51,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 29570, now seen corresponding path program 1 times [2025-02-06 18:48:51,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:51,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306427327] [2025-02-06 18:48:51,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:51,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:51,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2 statements into 1 equivalence classes. [2025-02-06 18:48:51,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2 of 2 statements. [2025-02-06 18:48:51,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:51,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:51,890 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:48:51,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:51,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306427327] [2025-02-06 18:48:51,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306427327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:51,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:51,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:51,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221403480] [2025-02-06 18:48:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:51,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:51,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:51,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:51,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:51,944 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:51,947 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 94 transitions, 200 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:51,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:51,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:51,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:52,174 INFO L124 PetriNetUnfolderBase]: 285/731 cut-off events. [2025-02-06 18:48:52,174 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-02-06 18:48:52,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1209 conditions, 731 events. 285/731 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4323 event pairs, 176 based on Foata normal form. 4/575 useless extension candidates. Maximal degree in co-relation 1096. Up to 450 conditions per place. [2025-02-06 18:48:52,183 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 41 selfloop transitions, 1 changer transitions 2/90 dead transitions. [2025-02-06 18:48:52,184 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 90 transitions, 278 flow [2025-02-06 18:48:52,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:52,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2025-02-06 18:48:52,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2025-02-06 18:48:52,199 INFO L175 Difference]: Start difference. First operand has 91 places, 94 transitions, 200 flow. Second operand 3 states and 194 transitions. [2025-02-06 18:48:52,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 90 transitions, 278 flow [2025-02-06 18:48:52,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 270 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:48:52,208 INFO L231 Difference]: Finished difference. Result has 85 places, 88 transitions, 181 flow [2025-02-06 18:48:52,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=85, PETRI_TRANSITIONS=88} [2025-02-06 18:48:52,215 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-02-06 18:48:52,216 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 88 transitions, 181 flow [2025-02-06 18:48:52,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:52,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:52,217 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-06 18:48:52,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:48:52,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:52,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:52,219 INFO L85 PathProgramCache]: Analyzing trace with hash 917489, now seen corresponding path program 1 times [2025-02-06 18:48:52,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:52,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166833925] [2025-02-06 18:48:52,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:52,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:52,229 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-06 18:48:52,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-06 18:48:52,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:52,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:52,278 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:48:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:52,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166833925] [2025-02-06 18:48:52,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166833925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:52,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:52,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:52,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687890963] [2025-02-06 18:48:52,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:52,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:52,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:52,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:52,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:52,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:52,288 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 88 transitions, 181 flow. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:52,288 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:52,288 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:52,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:52,440 INFO L124 PetriNetUnfolderBase]: 285/727 cut-off events. [2025-02-06 18:48:52,440 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:48:52,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 727 events. 285/727 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4310 event pairs, 176 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1180. Up to 447 conditions per place. [2025-02-06 18:48:52,445 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 39 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-02-06 18:48:52,445 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 86 transitions, 257 flow [2025-02-06 18:48:52,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:52,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-02-06 18:48:52,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-02-06 18:48:52,447 INFO L175 Difference]: Start difference. First operand has 85 places, 88 transitions, 181 flow. Second operand 3 states and 189 transitions. [2025-02-06 18:48:52,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 86 transitions, 257 flow [2025-02-06 18:48:52,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 256 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:52,449 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 178 flow [2025-02-06 18:48:52,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-02-06 18:48:52,450 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -9 predicate places. [2025-02-06 18:48:52,451 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 178 flow [2025-02-06 18:48:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 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:48:52,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:52,451 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:48:52,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:48:52,451 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash 881734808, now seen corresponding path program 1 times [2025-02-06 18:48:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557559341] [2025-02-06 18:48:52,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:52,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:48:52,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:48:52,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:52,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:52,585 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:48:52,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:52,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557559341] [2025-02-06 18:48:52,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557559341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:52,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:52,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:48:52,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661629718] [2025-02-06 18:48:52,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:52,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:52,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:52,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:52,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:48:52,596 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:52,597 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:48:52,597 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:52,597 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:52,597 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:52,789 INFO L124 PetriNetUnfolderBase]: 287/735 cut-off events. [2025-02-06 18:48:52,789 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 18:48:52,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1205 conditions, 735 events. 287/735 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4329 event pairs, 176 based on Foata normal form. 2/577 useless extension candidates. Maximal degree in co-relation 1198. Up to 454 conditions per place. [2025-02-06 18:48:52,796 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 42 selfloop transitions, 8 changer transitions 0/92 dead transitions. [2025-02-06 18:48:52,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 290 flow [2025-02-06 18:48:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:52,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-02-06 18:48:52,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-02-06 18:48:52,799 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 178 flow. Second operand 4 states and 250 transitions. [2025-02-06 18:48:52,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 290 flow [2025-02-06 18:48:52,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:52,805 INFO L231 Difference]: Finished difference. Result has 86 places, 92 transitions, 235 flow [2025-02-06 18:48:52,805 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=177, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=86, PETRI_TRANSITIONS=92} [2025-02-06 18:48:52,806 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-02-06 18:48:52,806 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 92 transitions, 235 flow [2025-02-06 18:48:52,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 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:48:52,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:52,807 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-02-06 18:48:52,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:48:52,807 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:52,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:52,808 INFO L85 PathProgramCache]: Analyzing trace with hash 881734859, now seen corresponding path program 1 times [2025-02-06 18:48:52,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:52,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497783895] [2025-02-06 18:48:52,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:52,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:52,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-02-06 18:48:52,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-02-06 18:48:52,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:52,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:52,876 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:48:52,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:52,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497783895] [2025-02-06 18:48:52,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497783895] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:52,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:52,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:52,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214559587] [2025-02-06 18:48:52,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:52,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:52,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:52,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:52,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:52,888 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:52,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 92 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:48:52,889 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:52,889 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:52,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:53,034 INFO L124 PetriNetUnfolderBase]: 287/733 cut-off events. [2025-02-06 18:48:53,035 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 18:48:53,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1227 conditions, 733 events. 287/733 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4343 event pairs, 176 based on Foata normal form. 2/580 useless extension candidates. Maximal degree in co-relation 1218. Up to 455 conditions per place. [2025-02-06 18:48:53,039 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 47 selfloop transitions, 1 changer transitions 0/90 dead transitions. [2025-02-06 18:48:53,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 90 transitions, 327 flow [2025-02-06 18:48:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2025-02-06 18:48:53,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6563573883161512 [2025-02-06 18:48:53,043 INFO L175 Difference]: Start difference. First operand has 86 places, 92 transitions, 235 flow. Second operand 3 states and 191 transitions. [2025-02-06 18:48:53,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 90 transitions, 327 flow [2025-02-06 18:48:53,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 90 transitions, 321 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:53,046 INFO L231 Difference]: Finished difference. Result has 85 places, 90 transitions, 227 flow [2025-02-06 18:48:53,046 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=225, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=227, PETRI_PLACES=85, PETRI_TRANSITIONS=90} [2025-02-06 18:48:53,047 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -6 predicate places. [2025-02-06 18:48:53,047 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 90 transitions, 227 flow [2025-02-06 18:48:53,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:48:53,047 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:53,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:48:53,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:48:53,047 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:53,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:53,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1563977666, now seen corresponding path program 1 times [2025-02-06 18:48:53,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:53,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-02-06 18:48:53,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:53,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:48:53,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:48:53,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:53,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:53,092 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:48:53,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:53,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352221423] [2025-02-06 18:48:53,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352221423] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:53,092 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:53,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-02-06 18:48:53,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2814990] [2025-02-06 18:48:53,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:53,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:48:53,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:53,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:48:53,093 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:48:53,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:53,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 90 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:48:53,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:53,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:53,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:53,217 INFO L124 PetriNetUnfolderBase]: 287/731 cut-off events. [2025-02-06 18:48:53,217 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 18:48:53,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1220 conditions, 731 events. 287/731 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4315 event pairs, 176 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 1210. Up to 453 conditions per place. [2025-02-06 18:48:53,221 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 45 selfloop transitions, 1 changer transitions 0/88 dead transitions. [2025-02-06 18:48:53,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 88 transitions, 315 flow [2025-02-06 18:48:53,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:48:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:48:53,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2025-02-06 18:48:53,223 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494845360824743 [2025-02-06 18:48:53,223 INFO L175 Difference]: Start difference. First operand has 85 places, 90 transitions, 227 flow. Second operand 3 states and 189 transitions. [2025-02-06 18:48:53,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 88 transitions, 315 flow [2025-02-06 18:48:53,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 88 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:53,226 INFO L231 Difference]: Finished difference. Result has 84 places, 88 transitions, 224 flow [2025-02-06 18:48:53,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=224, PETRI_PLACES=84, PETRI_TRANSITIONS=88} [2025-02-06 18:48:53,227 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -7 predicate places. [2025-02-06 18:48:53,227 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 88 transitions, 224 flow [2025-02-06 18:48:53,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 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:48:53,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:53,228 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-02-06 18:48:53,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:48:53,228 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:53,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:53,229 INFO L85 PathProgramCache]: Analyzing trace with hash -257479206, now seen corresponding path program 1 times [2025-02-06 18:48:53,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642600593] [2025-02-06 18:48:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:53,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:48:53,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:48:53,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:53,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:53,339 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:48:53,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642600593] [2025-02-06 18:48:53,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642600593] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:48:53,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [393345377] [2025-02-06 18:48:53,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:53,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:53,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:53,344 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:48:53,345 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:48:53,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-02-06 18:48:53,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-02-06 18:48:53,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:53,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:53,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:48:53,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:48:53,460 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:48:53,460 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:48:53,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [393345377] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:53,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:48:53,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 18:48:53,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984952284] [2025-02-06 18:48:53,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:53,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:48:53,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:53,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:48:53,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:48:53,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:53,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 88 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:48:53,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:53,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:53,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:53,669 INFO L124 PetriNetUnfolderBase]: 287/729 cut-off events. [2025-02-06 18:48:53,670 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2025-02-06 18:48:53,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 729 events. 287/729 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4303 event pairs, 176 based on Foata normal form. 2/575 useless extension candidates. Maximal degree in co-relation 1208. Up to 444 conditions per place. [2025-02-06 18:48:53,675 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 34 selfloop transitions, 14 changer transitions 0/86 dead transitions. [2025-02-06 18:48:53,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 312 flow [2025-02-06 18:48:53,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:48:53,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:48:53,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 344 transitions. [2025-02-06 18:48:53,680 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5910652920962199 [2025-02-06 18:48:53,680 INFO L175 Difference]: Start difference. First operand has 84 places, 88 transitions, 224 flow. Second operand 6 states and 344 transitions. [2025-02-06 18:48:53,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 312 flow [2025-02-06 18:48:53,682 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 86 transitions, 311 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:53,685 INFO L231 Difference]: Finished difference. Result has 86 places, 86 transitions, 243 flow [2025-02-06 18:48:53,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=86, PETRI_TRANSITIONS=86} [2025-02-06 18:48:53,687 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, -5 predicate places. [2025-02-06 18:48:53,687 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 86 transitions, 243 flow [2025-02-06 18:48:53,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 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:48:53,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:53,688 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-02-06 18:48:53,694 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:48:53,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:53,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:53,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:53,889 INFO L85 PathProgramCache]: Analyzing trace with hash 608080049, now seen corresponding path program 1 times [2025-02-06 18:48:53,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:53,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182426126] [2025-02-06 18:48:53,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:53,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:53,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:48:53,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:48:53,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:53,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182426126] [2025-02-06 18:48:53,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182426126] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:48:53,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691770302] [2025-02-06 18:48:53,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:53,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:53,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:53,988 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:48:53,989 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:48:54,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:48:54,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:48:54,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:54,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:54,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:48:54,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:48:54,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:54,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:48:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:48:54,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691770302] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:48:54,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:48:54,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:48:54,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883442365] [2025-02-06 18:48:54,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:48:54,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:48:54,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:54,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:48:54,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:48:54,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:54,196 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 86 transitions, 243 flow. Second operand has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 0 states have call successors, (0), 0 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:48:54,196 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:54,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:54,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:54,438 INFO L124 PetriNetUnfolderBase]: 293/753 cut-off events. [2025-02-06 18:48:54,438 INFO L125 PetriNetUnfolderBase]: For 50/50 co-relation queries the response was YES. [2025-02-06 18:48:54,440 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1311 conditions, 753 events. 293/753 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4461 event pairs, 176 based on Foata normal form. 6/599 useless extension candidates. Maximal degree in co-relation 1300. Up to 458 conditions per place. [2025-02-06 18:48:54,443 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 40 selfloop transitions, 26 changer transitions 0/104 dead transitions. [2025-02-06 18:48:54,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 104 transitions, 483 flow [2025-02-06 18:48:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:48:54,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:48:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-02-06 18:48:54,447 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-02-06 18:48:54,447 INFO L175 Difference]: Start difference. First operand has 86 places, 86 transitions, 243 flow. Second operand 10 states and 562 transitions. [2025-02-06 18:48:54,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 104 transitions, 483 flow [2025-02-06 18:48:54,451 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 104 transitions, 423 flow, removed 16 selfloop flow, removed 4 redundant places. [2025-02-06 18:48:54,454 INFO L231 Difference]: Finished difference. Result has 94 places, 104 transitions, 379 flow [2025-02-06 18:48:54,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=379, PETRI_PLACES=94, PETRI_TRANSITIONS=104} [2025-02-06 18:48:54,454 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 3 predicate places. [2025-02-06 18:48:54,454 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 104 transitions, 379 flow [2025-02-06 18:48:54,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.166666666666664) internal successors, (602), 12 states have internal predecessors, (602), 0 states have call successors, (0), 0 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:48:54,455 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:54,455 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:48:54,465 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:48:54,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:54,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:54,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1755288568, now seen corresponding path program 1 times [2025-02-06 18:48:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:54,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-02-06 18:48:54,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:54,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-06 18:48:54,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-06 18:48:54,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:54,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:54,737 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:48:54,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:54,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307157604] [2025-02-06 18:48:54,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307157604] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:54,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:54,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:48:54,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647540997] [2025-02-06 18:48:54,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:54,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:54,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:54,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:54,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:48:54,746 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:54,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 104 transitions, 379 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:48:54,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:54,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:54,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:54,934 INFO L124 PetriNetUnfolderBase]: 295/761 cut-off events. [2025-02-06 18:48:54,934 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-02-06 18:48:54,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1339 conditions, 761 events. 295/761 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4539 event pairs, 176 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 1326. Up to 478 conditions per place. [2025-02-06 18:48:54,938 INFO L140 encePairwiseOnDemand]: 85/97 looper letters, 66 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2025-02-06 18:48:54,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 539 flow [2025-02-06 18:48:54,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:54,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 250 transitions. [2025-02-06 18:48:54,941 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6443298969072165 [2025-02-06 18:48:54,941 INFO L175 Difference]: Start difference. First operand has 94 places, 104 transitions, 379 flow. Second operand 4 states and 250 transitions. [2025-02-06 18:48:54,941 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 539 flow [2025-02-06 18:48:54,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 517 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-06 18:48:54,945 INFO L231 Difference]: Finished difference. Result has 97 places, 110 transitions, 415 flow [2025-02-06 18:48:54,946 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=415, PETRI_PLACES=97, PETRI_TRANSITIONS=110} [2025-02-06 18:48:54,947 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 6 predicate places. [2025-02-06 18:48:54,947 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 110 transitions, 415 flow [2025-02-06 18:48:54,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:48:54,947 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:54,947 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:48:54,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 18:48:54,947 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:54,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:54,947 INFO L85 PathProgramCache]: Analyzing trace with hash 575769812, now seen corresponding path program 1 times [2025-02-06 18:48:54,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:54,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-02-06 18:48:54,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:54,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:54,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-06 18:48:54,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-06 18:48:54,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:54,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:55,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:48:55,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:55,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156491126] [2025-02-06 18:48:55,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156491126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:55,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:55,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:48:55,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818313106] [2025-02-06 18:48:55,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:55,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:55,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:55,056 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:55,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:48:55,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:55,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 110 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:48:55,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:55,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:55,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:55,191 INFO L124 PetriNetUnfolderBase]: 294/760 cut-off events. [2025-02-06 18:48:55,191 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 18:48:55,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1349 conditions, 760 events. 294/760 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 4473 event pairs, 176 based on Foata normal form. 1/609 useless extension candidates. Maximal degree in co-relation 1333. Up to 474 conditions per place. [2025-02-06 18:48:55,195 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 66 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2025-02-06 18:48:55,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 109 transitions, 549 flow [2025-02-06 18:48:55,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:55,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:55,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-06 18:48:55,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-02-06 18:48:55,197 INFO L175 Difference]: Start difference. First operand has 97 places, 110 transitions, 415 flow. Second operand 4 states and 239 transitions. [2025-02-06 18:48:55,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 109 transitions, 549 flow [2025-02-06 18:48:55,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 109 transitions, 543 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:48:55,202 INFO L231 Difference]: Finished difference. Result has 99 places, 109 transitions, 411 flow [2025-02-06 18:48:55,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=411, PETRI_PLACES=99, PETRI_TRANSITIONS=109} [2025-02-06 18:48:55,203 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 8 predicate places. [2025-02-06 18:48:55,203 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 109 transitions, 411 flow [2025-02-06 18:48:55,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 0 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:48:55,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:55,203 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:48:55,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:48:55,203 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:55,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash -349184558, now seen corresponding path program 1 times [2025-02-06 18:48:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:55,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022862739] [2025-02-06 18:48:55,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:55,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-06 18:48:55,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-06 18:48:55,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:55,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:55,293 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:48:55,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:55,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022862739] [2025-02-06 18:48:55,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022862739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:55,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:55,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:48:55,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512029992] [2025-02-06 18:48:55,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:55,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:55,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:55,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:55,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:48:55,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:55,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 109 transitions, 411 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:48:55,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:55,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:55,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:55,429 INFO L124 PetriNetUnfolderBase]: 293/759 cut-off events. [2025-02-06 18:48:55,429 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-02-06 18:48:55,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 759 events. 293/759 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4411 event pairs, 176 based on Foata normal form. 1/608 useless extension candidates. Maximal degree in co-relation 1328. Up to 473 conditions per place. [2025-02-06 18:48:55,433 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 65 selfloop transitions, 3 changer transitions 0/108 dead transitions. [2025-02-06 18:48:55,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 108 transitions, 543 flow [2025-02-06 18:48:55,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:55,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-06 18:48:55,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-02-06 18:48:55,435 INFO L175 Difference]: Start difference. First operand has 99 places, 109 transitions, 411 flow. Second operand 4 states and 239 transitions. [2025-02-06 18:48:55,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 108 transitions, 543 flow [2025-02-06 18:48:55,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 108 transitions, 539 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:48:55,437 INFO L231 Difference]: Finished difference. Result has 100 places, 108 transitions, 409 flow [2025-02-06 18:48:55,438 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=409, PETRI_PLACES=100, PETRI_TRANSITIONS=108} [2025-02-06 18:48:55,439 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 9 predicate places. [2025-02-06 18:48:55,439 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 108 transitions, 409 flow [2025-02-06 18:48:55,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:48:55,439 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:55,439 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1, 1] [2025-02-06 18:48:55,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:48:55,439 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:55,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:55,439 INFO L85 PathProgramCache]: Analyzing trace with hash -446996429, now seen corresponding path program 2 times [2025-02-06 18:48:55,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:55,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304941679] [2025-02-06 18:48:55,440 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:48:55,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:55,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 18:48:55,453 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 18:48:55,453 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:48:55,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:55,501 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:48:55,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304941679] [2025-02-06 18:48:55,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304941679] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:48:55,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211908299] [2025-02-06 18:48:55,501 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:48:55,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:55,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:55,505 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:48:55,505 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:48:55,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 18 statements into 2 equivalence classes. [2025-02-06 18:48:55,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 6 of 18 statements. [2025-02-06 18:48:55,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:48:55,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:55,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:48:55,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:48:55,589 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:48:55,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:48:55,609 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-06 18:48:55,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211908299] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:48:55,610 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:48:55,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-06 18:48:55,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061331774] [2025-02-06 18:48:55,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:48:55,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:48:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:55,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:48:55,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:48:55,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-02-06 18:48:55,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 108 transitions, 409 flow. Second operand has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:48:55,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:55,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-02-06 18:48:55,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:55,772 INFO L124 PetriNetUnfolderBase]: 293/757 cut-off events. [2025-02-06 18:48:55,772 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-02-06 18:48:55,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1336 conditions, 757 events. 293/757 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 4395 event pairs, 176 based on Foata normal form. 2/607 useless extension candidates. Maximal degree in co-relation 1319. Up to 453 conditions per place. [2025-02-06 18:48:55,775 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 37 selfloop transitions, 31 changer transitions 0/106 dead transitions. [2025-02-06 18:48:55,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 525 flow [2025-02-06 18:48:55,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:48:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:48:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-02-06 18:48:55,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-02-06 18:48:55,778 INFO L175 Difference]: Start difference. First operand has 100 places, 108 transitions, 409 flow. Second operand 5 states and 267 transitions. [2025-02-06 18:48:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 525 flow [2025-02-06 18:48:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 106 transitions, 501 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-02-06 18:48:55,781 INFO L231 Difference]: Finished difference. Result has 96 places, 106 transitions, 427 flow [2025-02-06 18:48:55,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=427, PETRI_PLACES=96, PETRI_TRANSITIONS=106} [2025-02-06 18:48:55,783 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 5 predicate places. [2025-02-06 18:48:55,783 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 106 transitions, 427 flow [2025-02-06 18:48:55,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 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:48:55,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:55,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:48:55,790 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:48:55,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:55,984 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:55,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:55,985 INFO L85 PathProgramCache]: Analyzing trace with hash -370650077, now seen corresponding path program 1 times [2025-02-06 18:48:55,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:55,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802546258] [2025-02-06 18:48:55,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:55,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:55,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:48:56,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:48:56,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:56,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:56,062 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:48:56,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:56,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802546258] [2025-02-06 18:48:56,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802546258] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:48:56,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254471581] [2025-02-06 18:48:56,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:56,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:56,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:56,067 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:48:56,069 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:48:56,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:48:56,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:48:56,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:56,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:56,138 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-06 18:48:56,139 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:48:56,246 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:48:56,246 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:48:56,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:48:56,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254471581] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:48:56,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:48:56,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-06 18:48:56,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479692753] [2025-02-06 18:48:56,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:48:56,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 18:48:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:56,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 18:48:56,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2025-02-06 18:48:56,579 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-02-06 18:48:56,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 106 transitions, 427 flow. Second operand has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:48:56,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:56,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-02-06 18:48:56,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:57,125 INFO L124 PetriNetUnfolderBase]: 580/1484 cut-off events. [2025-02-06 18:48:57,126 INFO L125 PetriNetUnfolderBase]: For 122/122 co-relation queries the response was YES. [2025-02-06 18:48:57,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2599 conditions, 1484 events. 580/1484 cut-off events. For 122/122 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 10365 event pairs, 352 based on Foata normal form. 3/1178 useless extension candidates. Maximal degree in co-relation 2586. Up to 453 conditions per place. [2025-02-06 18:48:57,131 INFO L140 encePairwiseOnDemand]: 81/97 looper letters, 74 selfloop transitions, 47 changer transitions 0/155 dead transitions. [2025-02-06 18:48:57,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 155 transitions, 879 flow [2025-02-06 18:48:57,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-06 18:48:57,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-02-06 18:48:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 835 transitions. [2025-02-06 18:48:57,134 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4782359679266896 [2025-02-06 18:48:57,134 INFO L175 Difference]: Start difference. First operand has 96 places, 106 transitions, 427 flow. Second operand 18 states and 835 transitions. [2025-02-06 18:48:57,134 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 155 transitions, 879 flow [2025-02-06 18:48:57,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 155 transitions, 787 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:48:57,137 INFO L231 Difference]: Finished difference. Result has 109 places, 126 transitions, 621 flow [2025-02-06 18:48:57,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=621, PETRI_PLACES=109, PETRI_TRANSITIONS=126} [2025-02-06 18:48:57,138 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 18 predicate places. [2025-02-06 18:48:57,138 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 126 transitions, 621 flow [2025-02-06 18:48:57,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 42.8421052631579) internal successors, (814), 19 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:48:57,138 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:57,138 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:48:57,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-06 18:48:57,343 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,SelfDestructingSolverStorable11 [2025-02-06 18:48:57,343 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:57,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:57,343 INFO L85 PathProgramCache]: Analyzing trace with hash -470521624, now seen corresponding path program 1 times [2025-02-06 18:48:57,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:57,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-02-06 18:48:57,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:57,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:57,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:48:57,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:48:57,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:57,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:57,445 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:48:57,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013887822] [2025-02-06 18:48:57,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013887822] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:48:57,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494471966] [2025-02-06 18:48:57,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:57,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:57,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:57,448 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:48:57,450 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:48:57,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:48:57,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:48:57,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:57,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:57,529 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:48:57,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:48:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:48:57,554 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:48:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-06 18:48:57,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494471966] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:48:57,598 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:48:57,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-02-06 18:48:57,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395159232] [2025-02-06 18:48:57,598 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:48:57,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:48:57,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:57,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:48:57,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:48:57,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:57,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 126 transitions, 621 flow. Second operand has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 0 states have call successors, (0), 0 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:48:57,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:57,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:57,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:57,897 INFO L124 PetriNetUnfolderBase]: 589/1520 cut-off events. [2025-02-06 18:48:57,897 INFO L125 PetriNetUnfolderBase]: For 224/224 co-relation queries the response was YES. [2025-02-06 18:48:57,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2747 conditions, 1520 events. 589/1520 cut-off events. For 224/224 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10742 event pairs, 352 based on Foata normal form. 9/1229 useless extension candidates. Maximal degree in co-relation 2734. Up to 936 conditions per place. [2025-02-06 18:48:57,906 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 75 selfloop transitions, 44 changer transitions 0/153 dead transitions. [2025-02-06 18:48:57,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 153 transitions, 1027 flow [2025-02-06 18:48:57,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:48:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:48:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 562 transitions. [2025-02-06 18:48:57,908 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5793814432989691 [2025-02-06 18:48:57,909 INFO L175 Difference]: Start difference. First operand has 109 places, 126 transitions, 621 flow. Second operand 10 states and 562 transitions. [2025-02-06 18:48:57,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 153 transitions, 1027 flow [2025-02-06 18:48:57,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 153 transitions, 943 flow, removed 25 selfloop flow, removed 4 redundant places. [2025-02-06 18:48:57,913 INFO L231 Difference]: Finished difference. Result has 117 places, 153 transitions, 841 flow [2025-02-06 18:48:57,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=573, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=841, PETRI_PLACES=117, PETRI_TRANSITIONS=153} [2025-02-06 18:48:57,914 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 26 predicate places. [2025-02-06 18:48:57,914 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 153 transitions, 841 flow [2025-02-06 18:48:57,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 50.833333333333336) internal successors, (610), 12 states have internal predecessors, (610), 0 states have call successors, (0), 0 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:48:57,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:57,914 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:48:57,922 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-06 18:48:58,115 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,SelfDestructingSolverStorable12 [2025-02-06 18:48:58,115 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:58,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:58,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1477729040, now seen corresponding path program 1 times [2025-02-06 18:48:58,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:58,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-02-06 18:48:58,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:58,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:58,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:48:58,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:48:58,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:58,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:58,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:48:58,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:58,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58516808] [2025-02-06 18:48:58,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58516808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:58,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:58,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:48:58,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717716113] [2025-02-06 18:48:58,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:58,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:58,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:58,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:58,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:48:58,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-02-06 18:48:58,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 153 transitions, 841 flow. Second operand has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:48:58,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:58,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-02-06 18:48:58,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:58,542 INFO L124 PetriNetUnfolderBase]: 1107/2530 cut-off events. [2025-02-06 18:48:58,543 INFO L125 PetriNetUnfolderBase]: For 255/255 co-relation queries the response was YES. [2025-02-06 18:48:58,548 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4612 conditions, 2530 events. 1107/2530 cut-off events. For 255/255 co-relation queries the response was YES. Maximal size of possible extension queue 191. Compared 18895 event pairs, 322 based on Foata normal form. 80/2123 useless extension candidates. Maximal degree in co-relation 4596. Up to 898 conditions per place. [2025-02-06 18:48:58,558 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 145 selfloop transitions, 5 changer transitions 0/180 dead transitions. [2025-02-06 18:48:58,558 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 180 transitions, 1197 flow [2025-02-06 18:48:58,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:58,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:58,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-02-06 18:48:58,560 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6804123711340206 [2025-02-06 18:48:58,560 INFO L175 Difference]: Start difference. First operand has 117 places, 153 transitions, 841 flow. Second operand 4 states and 264 transitions. [2025-02-06 18:48:58,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 180 transitions, 1197 flow [2025-02-06 18:48:58,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 180 transitions, 1159 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-02-06 18:48:58,567 INFO L231 Difference]: Finished difference. Result has 120 places, 155 transitions, 837 flow [2025-02-06 18:48:58,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=801, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=152, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=837, PETRI_PLACES=120, PETRI_TRANSITIONS=155} [2025-02-06 18:48:58,568 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 29 predicate places. [2025-02-06 18:48:58,568 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 155 transitions, 837 flow [2025-02-06 18:48:58,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.5) internal successors, (206), 4 states have internal predecessors, (206), 0 states have call successors, (0), 0 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:48:58,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:58,568 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:48:58,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 18:48:58,569 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:58,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:58,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1435040919, now seen corresponding path program 1 times [2025-02-06 18:48:58,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:58,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-02-06 18:48:58,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:58,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:58,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:48:58,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:48:58,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:58,603 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:58,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:48:58,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850821825] [2025-02-06 18:48:58,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850821825] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:48:58,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190070091] [2025-02-06 18:48:58,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:58,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:48:58,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:48:58,782 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:48:58,782 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:48:58,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-06 18:48:58,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-06 18:48:58,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:58,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:58,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:48:58,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:48:58,891 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:48:58,891 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:48:58,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190070091] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:58,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:48:58,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-02-06 18:48:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409978404] [2025-02-06 18:48:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:58,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:58,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:58,892 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:58,892 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:48:58,900 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:58,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 155 transitions, 837 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:48:58,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:58,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:58,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:59,083 INFO L124 PetriNetUnfolderBase]: 727/1958 cut-off events. [2025-02-06 18:48:59,084 INFO L125 PetriNetUnfolderBase]: For 624/672 co-relation queries the response was YES. [2025-02-06 18:48:59,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 1958 events. 727/1958 cut-off events. For 624/672 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15016 event pairs, 456 based on Foata normal form. 28/1645 useless extension candidates. Maximal degree in co-relation 3757. Up to 1173 conditions per place. [2025-02-06 18:48:59,096 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 112 selfloop transitions, 5 changer transitions 0/153 dead transitions. [2025-02-06 18:48:59,096 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 153 transitions, 1060 flow [2025-02-06 18:48:59,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:59,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:59,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-06 18:48:59,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-02-06 18:48:59,099 INFO L175 Difference]: Start difference. First operand has 120 places, 155 transitions, 837 flow. Second operand 4 states and 239 transitions. [2025-02-06 18:48:59,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 153 transitions, 1060 flow [2025-02-06 18:48:59,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 153 transitions, 1060 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 18:48:59,103 INFO L231 Difference]: Finished difference. Result has 123 places, 153 transitions, 836 flow [2025-02-06 18:48:59,104 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=826, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=836, PETRI_PLACES=123, PETRI_TRANSITIONS=153} [2025-02-06 18:48:59,104 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 32 predicate places. [2025-02-06 18:48:59,104 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 153 transitions, 836 flow [2025-02-06 18:48:59,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:48:59,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:59,104 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] [2025-02-06 18:48:59,115 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:48:59,309 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,SelfDestructingSolverStorable14 [2025-02-06 18:48:59,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:59,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1472991311, now seen corresponding path program 1 times [2025-02-06 18:48:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:59,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-02-06 18:48:59,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:59,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:59,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-06 18:48:59,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-06 18:48:59,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:59,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:48:59,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:48:59,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:48:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533687710] [2025-02-06 18:48:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533687710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:48:59,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:48:59,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:48:59,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708350996] [2025-02-06 18:48:59,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:48:59,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:48:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:48:59,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:48:59,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:48:59,405 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:48:59,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 153 transitions, 836 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:48:59,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:48:59,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:48:59,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:48:59,630 INFO L124 PetriNetUnfolderBase]: 725/1956 cut-off events. [2025-02-06 18:48:59,630 INFO L125 PetriNetUnfolderBase]: For 634/682 co-relation queries the response was YES. [2025-02-06 18:48:59,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3774 conditions, 1956 events. 725/1956 cut-off events. For 634/682 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 14901 event pairs, 456 based on Foata normal form. 28/1643 useless extension candidates. Maximal degree in co-relation 3753. Up to 1171 conditions per place. [2025-02-06 18:48:59,644 INFO L140 encePairwiseOnDemand]: 93/97 looper letters, 110 selfloop transitions, 5 changer transitions 0/151 dead transitions. [2025-02-06 18:48:59,644 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 1055 flow [2025-02-06 18:48:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:48:59,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:48:59,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 239 transitions. [2025-02-06 18:48:59,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.615979381443299 [2025-02-06 18:48:59,646 INFO L175 Difference]: Start difference. First operand has 123 places, 153 transitions, 836 flow. Second operand 4 states and 239 transitions. [2025-02-06 18:48:59,646 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 1055 flow [2025-02-06 18:48:59,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 151 transitions, 1049 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:48:59,652 INFO L231 Difference]: Finished difference. Result has 124 places, 151 transitions, 829 flow [2025-02-06 18:48:59,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=829, PETRI_PLACES=124, PETRI_TRANSITIONS=151} [2025-02-06 18:48:59,653 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 33 predicate places. [2025-02-06 18:48:59,653 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 151 transitions, 829 flow [2025-02-06 18:48:59,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:48:59,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:48:59,654 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] [2025-02-06 18:48:59,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:48:59,654 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:48:59,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:48:59,654 INFO L85 PathProgramCache]: Analyzing trace with hash -615288463, now seen corresponding path program 1 times [2025-02-06 18:48:59,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:48:59,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-02-06 18:48:59,655 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:48:59,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:48:59,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:48:59,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:48:59,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:48:59,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:00,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:00,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468582968] [2025-02-06 18:49:00,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468582968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:00,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1526397758] [2025-02-06 18:49:00,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:00,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:00,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:00,115 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:49:00,122 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:49:00,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:49:00,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:49:00,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:00,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:00,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 18:49:00,221 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:00,280 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 23 treesize of output 1 [2025-02-06 18:49:00,515 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 18:49:00,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 10 [2025-02-06 18:49:00,532 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:00,532 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:00,630 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 18 treesize of output 16 [2025-02-06 18:49:00,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 16 [2025-02-06 18:49:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1526397758] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:00,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-02-06 18:49:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002991631] [2025-02-06 18:49:00,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:00,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 18:49:00,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:00,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 18:49:00,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 18:49:00,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 97 [2025-02-06 18:49:00,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 151 transitions, 829 flow. Second operand has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 0 states have call successors, (0), 0 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:49:00,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:00,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 97 [2025-02-06 18:49:00,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:02,046 INFO L124 PetriNetUnfolderBase]: 2711/6818 cut-off events. [2025-02-06 18:49:02,047 INFO L125 PetriNetUnfolderBase]: For 1924/1968 co-relation queries the response was YES. [2025-02-06 18:49:02,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13238 conditions, 6818 events. 2711/6818 cut-off events. For 1924/1968 co-relation queries the response was YES. Maximal size of possible extension queue 425. Compared 63533 event pairs, 730 based on Foata normal form. 44/5905 useless extension candidates. Maximal degree in co-relation 13217. Up to 876 conditions per place. [2025-02-06 18:49:02,085 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 286 selfloop transitions, 46 changer transitions 0/366 dead transitions. [2025-02-06 18:49:02,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 366 transitions, 2446 flow [2025-02-06 18:49:02,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 18:49:02,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 18:49:02,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 812 transitions. [2025-02-06 18:49:02,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5580756013745705 [2025-02-06 18:49:02,088 INFO L175 Difference]: Start difference. First operand has 124 places, 151 transitions, 829 flow. Second operand 15 states and 812 transitions. [2025-02-06 18:49:02,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 366 transitions, 2446 flow [2025-02-06 18:49:02,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 366 transitions, 2432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:49:02,106 INFO L231 Difference]: Finished difference. Result has 139 places, 164 transitions, 1022 flow [2025-02-06 18:49:02,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1022, PETRI_PLACES=139, PETRI_TRANSITIONS=164} [2025-02-06 18:49:02,107 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 48 predicate places. [2025-02-06 18:49:02,107 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 164 transitions, 1022 flow [2025-02-06 18:49:02,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 45.05882352941177) internal successors, (766), 17 states have internal predecessors, (766), 0 states have call successors, (0), 0 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:49:02,107 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:02,107 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] [2025-02-06 18:49:02,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-06 18:49:02,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:02,308 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:02,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:02,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1894103014, now seen corresponding path program 1 times [2025-02-06 18:49:02,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:02,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146087965] [2025-02-06 18:49:02,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:02,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:49:02,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:49:02,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:02,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:02,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146087965] [2025-02-06 18:49:02,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146087965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:02,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880506046] [2025-02-06 18:49:02,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:02,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:02,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:02,641 INFO L229 MonitoredProcess]: Starting monitored process 9 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:49:02,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-06 18:49:02,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:49:02,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:49:02,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:02,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:02,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 18:49:02,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:02,771 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 15 treesize of output 1 [2025-02-06 18:49:02,881 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 17 treesize of output 9 [2025-02-06 18:49:02,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:02,885 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:02,976 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 20 treesize of output 18 [2025-02-06 18:49:02,980 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 20 [2025-02-06 18:49:03,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:03,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880506046] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:03,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:03,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2025-02-06 18:49:03,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432592712] [2025-02-06 18:49:03,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:03,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 18:49:03,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:03,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 18:49:03,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2025-02-06 18:49:03,201 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 97 [2025-02-06 18:49:03,202 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 164 transitions, 1022 flow. Second operand has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 0 states have call successors, (0), 0 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:49:03,202 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:03,202 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 97 [2025-02-06 18:49:03,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:04,339 INFO L124 PetriNetUnfolderBase]: 3243/7370 cut-off events. [2025-02-06 18:49:04,339 INFO L125 PetriNetUnfolderBase]: For 4221/4265 co-relation queries the response was YES. [2025-02-06 18:49:04,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15836 conditions, 7370 events. 3243/7370 cut-off events. For 4221/4265 co-relation queries the response was YES. Maximal size of possible extension queue 435. Compared 65102 event pairs, 912 based on Foata normal form. 124/6533 useless extension candidates. Maximal degree in co-relation 15812. Up to 1166 conditions per place. [2025-02-06 18:49:04,376 INFO L140 encePairwiseOnDemand]: 84/97 looper letters, 291 selfloop transitions, 46 changer transitions 0/368 dead transitions. [2025-02-06 18:49:04,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 368 transitions, 2592 flow [2025-02-06 18:49:04,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 18:49:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-02-06 18:49:04,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 781 transitions. [2025-02-06 18:49:04,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5367697594501718 [2025-02-06 18:49:04,378 INFO L175 Difference]: Start difference. First operand has 139 places, 164 transitions, 1022 flow. Second operand 15 states and 781 transitions. [2025-02-06 18:49:04,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 368 transitions, 2592 flow [2025-02-06 18:49:04,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 368 transitions, 2573 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-02-06 18:49:04,392 INFO L231 Difference]: Finished difference. Result has 150 places, 167 transitions, 1135 flow [2025-02-06 18:49:04,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=990, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=1135, PETRI_PLACES=150, PETRI_TRANSITIONS=167} [2025-02-06 18:49:04,392 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 59 predicate places. [2025-02-06 18:49:04,393 INFO L471 AbstractCegarLoop]: Abstraction has has 150 places, 167 transitions, 1135 flow [2025-02-06 18:49:04,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 43.1764705882353) internal successors, (734), 17 states have internal predecessors, (734), 0 states have call successors, (0), 0 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:49:04,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:04,393 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] [2025-02-06 18:49:04,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:04,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 18:49:04,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:04,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash 36281079, now seen corresponding path program 1 times [2025-02-06 18:49:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:04,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247368077] [2025-02-06 18:49:04,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:04,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:04,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 18:49:04,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 18:49:04,621 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:04,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:04,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:49:04,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:04,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247368077] [2025-02-06 18:49:04,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247368077] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:04,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:04,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:04,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179295614] [2025-02-06 18:49:04,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:04,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:04,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:04,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:04,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:04,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-02-06 18:49:04,691 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 167 transitions, 1135 flow. Second operand has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:49:04,691 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:04,691 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-02-06 18:49:04,691 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:05,512 INFO L124 PetriNetUnfolderBase]: 4403/10010 cut-off events. [2025-02-06 18:49:05,513 INFO L125 PetriNetUnfolderBase]: For 8819/8977 co-relation queries the response was YES. [2025-02-06 18:49:05,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22497 conditions, 10010 events. 4403/10010 cut-off events. For 8819/8977 co-relation queries the response was YES. Maximal size of possible extension queue 589. Compared 94204 event pairs, 1508 based on Foata normal form. 426/8935 useless extension candidates. Maximal degree in co-relation 22471. Up to 3692 conditions per place. [2025-02-06 18:49:05,573 INFO L140 encePairwiseOnDemand]: 89/97 looper letters, 178 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2025-02-06 18:49:05,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 218 transitions, 1809 flow [2025-02-06 18:49:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:05,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-02-06 18:49:05,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6752577319587629 [2025-02-06 18:49:05,574 INFO L175 Difference]: Start difference. First operand has 150 places, 167 transitions, 1135 flow. Second operand 4 states and 262 transitions. [2025-02-06 18:49:05,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 218 transitions, 1809 flow [2025-02-06 18:49:05,589 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 218 transitions, 1721 flow, removed 2 selfloop flow, removed 10 redundant places. [2025-02-06 18:49:05,591 INFO L231 Difference]: Finished difference. Result has 145 places, 169 transitions, 1109 flow [2025-02-06 18:49:05,591 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1073, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1109, PETRI_PLACES=145, PETRI_TRANSITIONS=169} [2025-02-06 18:49:05,592 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 54 predicate places. [2025-02-06 18:49:05,592 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 169 transitions, 1109 flow [2025-02-06 18:49:05,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.0) internal successors, (212), 4 states have internal predecessors, (212), 0 states have call successors, (0), 0 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:49:05,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:05,592 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:49:05,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:49:05,593 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:05,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:05,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1688678142, now seen corresponding path program 2 times [2025-02-06 18:49:05,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:05,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249872760] [2025-02-06 18:49:05,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:05,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:05,601 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 18:49:05,605 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-02-06 18:49:05,606 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:49:05,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:05,643 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 18:49:05,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249872760] [2025-02-06 18:49:05,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249872760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:05,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004065338] [2025-02-06 18:49:05,644 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:05,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:05,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:05,646 INFO L229 MonitoredProcess]: Starting monitored process 10 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:49:05,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-06 18:49:05,720 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 33 statements into 2 equivalence classes. [2025-02-06 18:49:05,737 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 33 statements. [2025-02-06 18:49:05,738 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 18:49:05,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:05,739 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 18:49:05,740 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:05,770 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 18:49:05,771 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:05,788 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-02-06 18:49:05,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004065338] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:05,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:05,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-06 18:49:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340729308] [2025-02-06 18:49:05,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:05,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:49:05,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:05,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:49:05,789 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:49:05,805 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-02-06 18:49:05,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 169 transitions, 1109 flow. Second operand has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:05,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:05,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-02-06 18:49:05,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:06,617 INFO L124 PetriNetUnfolderBase]: 3129/8529 cut-off events. [2025-02-06 18:49:06,618 INFO L125 PetriNetUnfolderBase]: For 7121/7329 co-relation queries the response was YES. [2025-02-06 18:49:06,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19077 conditions, 8529 events. 3129/8529 cut-off events. For 7121/7329 co-relation queries the response was YES. Maximal size of possible extension queue 526. Compared 87033 event pairs, 2120 based on Foata normal form. 149/7697 useless extension candidates. Maximal degree in co-relation 19051. Up to 4741 conditions per place. [2025-02-06 18:49:06,674 INFO L140 encePairwiseOnDemand]: 86/97 looper letters, 78 selfloop transitions, 50 changer transitions 0/167 dead transitions. [2025-02-06 18:49:06,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 167 transitions, 1345 flow [2025-02-06 18:49:06,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:49:06,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:49:06,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2025-02-06 18:49:06,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5505154639175258 [2025-02-06 18:49:06,676 INFO L175 Difference]: Start difference. First operand has 145 places, 169 transitions, 1109 flow. Second operand 5 states and 267 transitions. [2025-02-06 18:49:06,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 167 transitions, 1345 flow [2025-02-06 18:49:06,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 167 transitions, 1313 flow, removed 3 selfloop flow, removed 4 redundant places. [2025-02-06 18:49:06,702 INFO L231 Difference]: Finished difference. Result has 143 places, 167 transitions, 1157 flow [2025-02-06 18:49:06,702 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1057, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=50, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1157, PETRI_PLACES=143, PETRI_TRANSITIONS=167} [2025-02-06 18:49:06,702 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 52 predicate places. [2025-02-06 18:49:06,702 INFO L471 AbstractCegarLoop]: Abstraction has has 143 places, 167 transitions, 1157 flow [2025-02-06 18:49:06,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 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:49:06,703 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:06,703 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] [2025-02-06 18:49:06,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:06,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:06,904 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:06,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1412349620, now seen corresponding path program 1 times [2025-02-06 18:49:06,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:06,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-02-06 18:49:06,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:06,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:06,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 18:49:06,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 18:49:06,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:06,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:49:06,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:06,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406960763] [2025-02-06 18:49:06,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406960763] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:06,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294079129] [2025-02-06 18:49:06,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:06,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:06,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:06,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:06,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:06,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-02-06 18:49:06,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 167 transitions, 1157 flow. Second operand has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 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:49:06,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:06,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-02-06 18:49:06,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:07,820 INFO L124 PetriNetUnfolderBase]: 3899/9439 cut-off events. [2025-02-06 18:49:07,820 INFO L125 PetriNetUnfolderBase]: For 8544/8758 co-relation queries the response was YES. [2025-02-06 18:49:07,841 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21824 conditions, 9439 events. 3899/9439 cut-off events. For 8544/8758 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 90982 event pairs, 1482 based on Foata normal form. 270/8745 useless extension candidates. Maximal degree in co-relation 21800. Up to 3484 conditions per place. [2025-02-06 18:49:07,868 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 153 selfloop transitions, 11 changer transitions 0/193 dead transitions. [2025-02-06 18:49:07,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 193 transitions, 1557 flow [2025-02-06 18:49:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:07,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:07,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 261 transitions. [2025-02-06 18:49:07,870 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6726804123711341 [2025-02-06 18:49:07,870 INFO L175 Difference]: Start difference. First operand has 143 places, 167 transitions, 1157 flow. Second operand 4 states and 261 transitions. [2025-02-06 18:49:07,870 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 193 transitions, 1557 flow [2025-02-06 18:49:07,901 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 193 transitions, 1450 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:49:07,904 INFO L231 Difference]: Finished difference. Result has 141 places, 164 transitions, 1048 flow [2025-02-06 18:49:07,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1026, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1048, PETRI_PLACES=141, PETRI_TRANSITIONS=164} [2025-02-06 18:49:07,905 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 50 predicate places. [2025-02-06 18:49:07,905 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 164 transitions, 1048 flow [2025-02-06 18:49:07,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.75) internal successors, (211), 4 states have internal predecessors, (211), 0 states have call successors, (0), 0 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:49:07,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:07,905 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] [2025-02-06 18:49:07,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:49:07,905 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1412348627, now seen corresponding path program 1 times [2025-02-06 18:49:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:07,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553189965] [2025-02-06 18:49:07,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:07,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:07,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 18:49:07,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 18:49:07,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:07,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:08,443 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:08,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:08,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553189965] [2025-02-06 18:49:08,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553189965] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:08,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371448153] [2025-02-06 18:49:08,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:08,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:08,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:08,452 INFO L229 MonitoredProcess]: Starting monitored process 11 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:49:08,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-06 18:49:08,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 18:49:08,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 18:49:08,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:08,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:08,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-06 18:49:08,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:08,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:49:08,586 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 15 treesize of output 1 [2025-02-06 18:49:08,679 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:49:08,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:49:08,691 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 18 treesize of output 13 [2025-02-06 18:49:08,769 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 17 treesize of output 9 [2025-02-06 18:49:08,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:08,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:08,859 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_374 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_374) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-02-06 18:49:08,986 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:08,986 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-06 18:49:08,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:08,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 39 [2025-02-06 18:49:09,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2025-02-06 18:49:09,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-02-06 18:49:09,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371448153] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:09,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:09,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-02-06 18:49:09,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057503138] [2025-02-06 18:49:09,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:09,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 18:49:09,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:09,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 18:49:09,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=352, Unknown=1, NotChecked=38, Total=462 [2025-02-06 18:49:09,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-02-06 18:49:09,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 164 transitions, 1048 flow. Second operand has 22 states, 22 states have (on average 32.72727272727273) internal successors, (720), 22 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:49:09,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:09,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-02-06 18:49:09,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:10,058 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| Int)) (or (forall ((v_ArrVal_374 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118| v_ArrVal_374) c_~get_2~0.base) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_118|) 0)))) (<= 0 c_~id_0~0) (forall ((v_ArrVal_374 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_374) c_~get_2~0.base) .cse0)))))) is different from false [2025-02-06 18:49:12,243 INFO L124 PetriNetUnfolderBase]: 8984/17086 cut-off events. [2025-02-06 18:49:12,243 INFO L125 PetriNetUnfolderBase]: For 12010/12667 co-relation queries the response was YES. [2025-02-06 18:49:12,289 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42701 conditions, 17086 events. 8984/17086 cut-off events. For 12010/12667 co-relation queries the response was YES. Maximal size of possible extension queue 790. Compared 149392 event pairs, 1831 based on Foata normal form. 355/16441 useless extension candidates. Maximal degree in co-relation 42679. Up to 2617 conditions per place. [2025-02-06 18:49:12,341 INFO L140 encePairwiseOnDemand]: 80/97 looper letters, 395 selfloop transitions, 90 changer transitions 0/504 dead transitions. [2025-02-06 18:49:12,341 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 504 transitions, 3524 flow [2025-02-06 18:49:12,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-06 18:49:12,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-02-06 18:49:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 1198 transitions. [2025-02-06 18:49:12,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42587984358336295 [2025-02-06 18:49:12,344 INFO L175 Difference]: Start difference. First operand has 141 places, 164 transitions, 1048 flow. Second operand 29 states and 1198 transitions. [2025-02-06 18:49:12,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 504 transitions, 3524 flow [2025-02-06 18:49:12,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 504 transitions, 3476 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:49:12,422 INFO L231 Difference]: Finished difference. Result has 176 places, 214 transitions, 1732 flow [2025-02-06 18:49:12,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1032, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=1732, PETRI_PLACES=176, PETRI_TRANSITIONS=214} [2025-02-06 18:49:12,423 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 85 predicate places. [2025-02-06 18:49:12,423 INFO L471 AbstractCegarLoop]: Abstraction has has 176 places, 214 transitions, 1732 flow [2025-02-06 18:49:12,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 32.72727272727273) internal successors, (720), 22 states have internal predecessors, (720), 0 states have call successors, (0), 0 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:49:12,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:12,423 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] [2025-02-06 18:49:12,430 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-02-06 18:49:12,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:12,624 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:12,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:12,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1124714374, now seen corresponding path program 1 times [2025-02-06 18:49:12,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:12,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-02-06 18:49:12,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:12,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:12,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 18:49:12,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 18:49:12,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:12,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:13,097 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:13,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269030379] [2025-02-06 18:49:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269030379] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630750072] [2025-02-06 18:49:13,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:13,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:13,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:13,100 INFO L229 MonitoredProcess]: Starting monitored process 12 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:49:13,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-06 18:49:13,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 18:49:13,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 18:49:13,205 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:13,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:13,211 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-06 18:49:13,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:13,225 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:49:13,257 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 23 treesize of output 1 [2025-02-06 18:49:13,405 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:49:13,405 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:49:13,436 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 20 treesize of output 15 [2025-02-06 18:49:13,616 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 18:49:13,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 10 [2025-02-06 18:49:13,626 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:13,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:13,663 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_410 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_410) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 9223372039002259456)) is different from false [2025-02-06 18:49:13,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:13,748 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 18:49:13,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:13,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 33 [2025-02-06 18:49:13,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-02-06 18:49:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-02-06 18:49:13,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630750072] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:13,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:13,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-06 18:49:13,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4487649] [2025-02-06 18:49:13,799 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:13,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 18:49:13,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:13,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 18:49:13,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=381, Unknown=1, NotChecked=40, Total=506 [2025-02-06 18:49:13,835 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-02-06 18:49:13,836 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 176 places, 214 transitions, 1732 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:49:13,836 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:13,836 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-02-06 18:49:13,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:14,453 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* c_~id_0~0 4) c_~get_2~0.offset))) (and (<= 0 c_~id_0~0) (forall ((v_ArrVal_410 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_410) c_~get_2~0.base) .cse0) 9223372039002259456)) (forall ((|v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121|) 0)) (forall ((v_ArrVal_410 (Array Int Int))) (< (select (select (store |c_#memory_int#2| |v_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base_121| v_ArrVal_410) c_~get_2~0.base) .cse0) 9223372039002259456)))))) is different from false [2025-02-06 18:49:16,682 INFO L124 PetriNetUnfolderBase]: 9901/18824 cut-off events. [2025-02-06 18:49:16,682 INFO L125 PetriNetUnfolderBase]: For 36534/37047 co-relation queries the response was YES. [2025-02-06 18:49:16,778 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52028 conditions, 18824 events. 9901/18824 cut-off events. For 36534/37047 co-relation queries the response was YES. Maximal size of possible extension queue 896. Compared 166227 event pairs, 2220 based on Foata normal form. 170/17662 useless extension candidates. Maximal degree in co-relation 51996. Up to 3427 conditions per place. [2025-02-06 18:49:16,839 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 365 selfloop transitions, 61 changer transitions 0/453 dead transitions. [2025-02-06 18:49:16,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 453 transitions, 3949 flow [2025-02-06 18:49:16,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 18:49:16,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 18:49:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 936 transitions. [2025-02-06 18:49:16,840 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4386129334582943 [2025-02-06 18:49:16,840 INFO L175 Difference]: Start difference. First operand has 176 places, 214 transitions, 1732 flow. Second operand 22 states and 936 transitions. [2025-02-06 18:49:16,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 453 transitions, 3949 flow [2025-02-06 18:49:16,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 453 transitions, 3827 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-02-06 18:49:16,925 INFO L231 Difference]: Finished difference. Result has 192 places, 227 transitions, 1865 flow [2025-02-06 18:49:16,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=168, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1865, PETRI_PLACES=192, PETRI_TRANSITIONS=227} [2025-02-06 18:49:16,926 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 101 predicate places. [2025-02-06 18:49:16,926 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 227 transitions, 1865 flow [2025-02-06 18:49:16,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:49:16,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:16,926 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:49:16,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:17,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-02-06 18:49:17,127 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:17,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash 833135389, now seen corresponding path program 1 times [2025-02-06 18:49:17,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:17,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-02-06 18:49:17,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:17,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:17,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:49:17,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:49:17,151 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:17,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:17,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:17,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062331942] [2025-02-06 18:49:17,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062331942] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:17,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197154751] [2025-02-06 18:49:17,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:17,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:17,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:17,534 INFO L229 MonitoredProcess]: Starting monitored process 13 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:49:17,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-06 18:49:17,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:49:17,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:49:17,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:17,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:17,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 18:49:17,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:17,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:49:17,661 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 15 treesize of output 1 [2025-02-06 18:49:17,765 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:49:17,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:49:17,789 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 16 treesize of output 11 [2025-02-06 18:49:17,866 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:49:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:17,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:18,192 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:18,193 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 18:49:18,200 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:18,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 33 [2025-02-06 18:49:18,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-02-06 18:49:18,263 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:18,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197154751] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:18,264 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:18,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 24 [2025-02-06 18:49:18,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010568247] [2025-02-06 18:49:18,264 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:18,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-02-06 18:49:18,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:18,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-02-06 18:49:18,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=551, Unknown=5, NotChecked=0, Total=650 [2025-02-06 18:49:18,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-02-06 18:49:18,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 227 transitions, 1865 flow. Second operand has 26 states, 26 states have (on average 33.0) internal successors, (858), 26 states have internal predecessors, (858), 0 states have call successors, (0), 0 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:49:18,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:18,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-02-06 18:49:18,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:22,417 INFO L124 PetriNetUnfolderBase]: 9886/18456 cut-off events. [2025-02-06 18:49:22,417 INFO L125 PetriNetUnfolderBase]: For 25980/27001 co-relation queries the response was YES. [2025-02-06 18:49:22,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53251 conditions, 18456 events. 9886/18456 cut-off events. For 25980/27001 co-relation queries the response was YES. Maximal size of possible extension queue 803. Compared 158584 event pairs, 2556 based on Foata normal form. 940/18358 useless extension candidates. Maximal degree in co-relation 53217. Up to 3883 conditions per place. [2025-02-06 18:49:22,670 INFO L140 encePairwiseOnDemand]: 77/97 looper letters, 397 selfloop transitions, 102 changer transitions 18/541 dead transitions. [2025-02-06 18:49:22,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 541 transitions, 4310 flow [2025-02-06 18:49:22,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-02-06 18:49:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2025-02-06 18:49:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 1272 transitions. [2025-02-06 18:49:22,674 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4230129697372797 [2025-02-06 18:49:22,674 INFO L175 Difference]: Start difference. First operand has 192 places, 227 transitions, 1865 flow. Second operand 31 states and 1272 transitions. [2025-02-06 18:49:22,674 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 541 transitions, 4310 flow [2025-02-06 18:49:22,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 541 transitions, 4228 flow, removed 10 selfloop flow, removed 13 redundant places. [2025-02-06 18:49:22,814 INFO L231 Difference]: Finished difference. Result has 215 places, 253 transitions, 2234 flow [2025-02-06 18:49:22,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=1799, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=85, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=31, PETRI_FLOW=2234, PETRI_PLACES=215, PETRI_TRANSITIONS=253} [2025-02-06 18:49:22,815 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 124 predicate places. [2025-02-06 18:49:22,815 INFO L471 AbstractCegarLoop]: Abstraction has has 215 places, 253 transitions, 2234 flow [2025-02-06 18:49:22,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 33.0) internal successors, (858), 26 states have internal predecessors, (858), 0 states have call successors, (0), 0 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:49:22,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:22,815 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:49:22,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-06 18:49:23,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:23,016 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:23,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:23,016 INFO L85 PathProgramCache]: Analyzing trace with hash 506377403, now seen corresponding path program 1 times [2025-02-06 18:49:23,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:23,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627480167] [2025-02-06 18:49:23,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:23,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:23,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:49:23,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:49:23,047 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:23,047 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:23,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627480167] [2025-02-06 18:49:23,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627480167] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:23,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141006218] [2025-02-06 18:49:23,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:23,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:23,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:23,504 INFO L229 MonitoredProcess]: Starting monitored process 14 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:49:23,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-06 18:49:23,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:49:23,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:49:23,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:23,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:23,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-02-06 18:49:23,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:23,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:49:23,643 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 23 treesize of output 1 [2025-02-06 18:49:23,776 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:49:23,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:49:23,815 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 22 treesize of output 17 [2025-02-06 18:49:24,016 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 18:49:24,017 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 12 [2025-02-06 18:49:24,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:24,036 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:24,091 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_481 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_481) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset)) 4294967296))) is different from false [2025-02-06 18:49:24,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:24,220 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-06 18:49:24,229 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:24,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 39 [2025-02-06 18:49:24,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2025-02-06 18:49:24,284 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2025-02-06 18:49:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141006218] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:24,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2025-02-06 18:49:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319829311] [2025-02-06 18:49:24,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 18:49:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:24,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 18:49:24,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=389, Unknown=1, NotChecked=40, Total=506 [2025-02-06 18:49:24,328 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 97 [2025-02-06 18:49:24,329 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 215 places, 253 transitions, 2234 flow. Second operand has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:49:24,329 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:24,329 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 97 [2025-02-06 18:49:24,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:28,433 INFO L124 PetriNetUnfolderBase]: 9910/18707 cut-off events. [2025-02-06 18:49:28,434 INFO L125 PetriNetUnfolderBase]: For 56552/57985 co-relation queries the response was YES. [2025-02-06 18:49:28,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59535 conditions, 18707 events. 9910/18707 cut-off events. For 56552/57985 co-relation queries the response was YES. Maximal size of possible extension queue 868. Compared 163725 event pairs, 2712 based on Foata normal form. 620/18149 useless extension candidates. Maximal degree in co-relation 59494. Up to 3983 conditions per place. [2025-02-06 18:49:28,663 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 446 selfloop transitions, 68 changer transitions 0/553 dead transitions. [2025-02-06 18:49:28,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 553 transitions, 5134 flow [2025-02-06 18:49:28,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-06 18:49:28,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-06 18:49:28,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 1112 transitions. [2025-02-06 18:49:28,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4409199048374306 [2025-02-06 18:49:28,666 INFO L175 Difference]: Start difference. First operand has 215 places, 253 transitions, 2234 flow. Second operand 26 states and 1112 transitions. [2025-02-06 18:49:28,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 553 transitions, 5134 flow [2025-02-06 18:49:28,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 553 transitions, 4962 flow, removed 13 selfloop flow, removed 15 redundant places. [2025-02-06 18:49:28,877 INFO L231 Difference]: Finished difference. Result has 226 places, 262 transitions, 2318 flow [2025-02-06 18:49:28,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2095, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2318, PETRI_PLACES=226, PETRI_TRANSITIONS=262} [2025-02-06 18:49:28,878 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 135 predicate places. [2025-02-06 18:49:28,878 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 262 transitions, 2318 flow [2025-02-06 18:49:28,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 35.391304347826086) internal successors, (814), 23 states have internal predecessors, (814), 0 states have call successors, (0), 0 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:49:28,879 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:28,879 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:49:28,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:29,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:29,080 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:29,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 976083130, now seen corresponding path program 1 times [2025-02-06 18:49:29,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:29,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537309244] [2025-02-06 18:49:29,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:29,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:29,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:49:29,091 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:49:29,091 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:29,091 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:29,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:49:29,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:29,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537309244] [2025-02-06 18:49:29,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537309244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:29,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:29,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 18:49:29,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796527898] [2025-02-06 18:49:29,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:29,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:49:29,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:29,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:49:29,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:49:29,165 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 97 [2025-02-06 18:49:29,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 262 transitions, 2318 flow. Second operand has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:49:29,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:29,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 97 [2025-02-06 18:49:29,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:30,586 INFO L124 PetriNetUnfolderBase]: 7223/15037 cut-off events. [2025-02-06 18:49:30,587 INFO L125 PetriNetUnfolderBase]: For 34557/34849 co-relation queries the response was YES. [2025-02-06 18:49:30,679 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47045 conditions, 15037 events. 7223/15037 cut-off events. For 34557/34849 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 138539 event pairs, 2793 based on Foata normal form. 372/14725 useless extension candidates. Maximal degree in co-relation 47003. Up to 6502 conditions per place. [2025-02-06 18:49:30,727 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 279 selfloop transitions, 35 changer transitions 25/375 dead transitions. [2025-02-06 18:49:30,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 375 transitions, 3710 flow [2025-02-06 18:49:30,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:49:30,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:49:30,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 370 transitions. [2025-02-06 18:49:30,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6357388316151202 [2025-02-06 18:49:30,728 INFO L175 Difference]: Start difference. First operand has 226 places, 262 transitions, 2318 flow. Second operand 6 states and 370 transitions. [2025-02-06 18:49:30,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 375 transitions, 3710 flow [2025-02-06 18:49:30,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 375 transitions, 3466 flow, removed 12 selfloop flow, removed 20 redundant places. [2025-02-06 18:49:30,970 INFO L231 Difference]: Finished difference. Result has 211 places, 256 transitions, 2204 flow [2025-02-06 18:49:30,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2204, PETRI_PLACES=211, PETRI_TRANSITIONS=256} [2025-02-06 18:49:30,971 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 120 predicate places. [2025-02-06 18:49:30,971 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 256 transitions, 2204 flow [2025-02-06 18:49:30,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 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:49:30,971 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:30,971 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:49:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:49:30,971 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:30,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1482168759, now seen corresponding path program 1 times [2025-02-06 18:49:30,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-02-06 18:49:30,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:30,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:49:30,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:49:30,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:30,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:31,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:49:31,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:31,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856203623] [2025-02-06 18:49:31,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856203623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:31,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:31,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:31,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122883880] [2025-02-06 18:49:31,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:31,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:31,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:31,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:31,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:31,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-02-06 18:49:31,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 256 transitions, 2204 flow. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:49:31,030 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:31,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-02-06 18:49:31,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:32,299 INFO L124 PetriNetUnfolderBase]: 6249/14637 cut-off events. [2025-02-06 18:49:32,299 INFO L125 PetriNetUnfolderBase]: For 42657/43071 co-relation queries the response was YES. [2025-02-06 18:49:32,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44787 conditions, 14637 events. 6249/14637 cut-off events. For 42657/43071 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 147022 event pairs, 2502 based on Foata normal form. 367/14007 useless extension candidates. Maximal degree in co-relation 44746. Up to 5828 conditions per place. [2025-02-06 18:49:32,530 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 342 selfloop transitions, 12 changer transitions 0/395 dead transitions. [2025-02-06 18:49:32,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 395 transitions, 4214 flow [2025-02-06 18:49:32,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:32,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:32,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 259 transitions. [2025-02-06 18:49:32,531 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6675257731958762 [2025-02-06 18:49:32,531 INFO L175 Difference]: Start difference. First operand has 211 places, 256 transitions, 2204 flow. Second operand 4 states and 259 transitions. [2025-02-06 18:49:32,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 395 transitions, 4214 flow [2025-02-06 18:49:32,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 395 transitions, 4056 flow, removed 27 selfloop flow, removed 4 redundant places. [2025-02-06 18:49:32,817 INFO L231 Difference]: Finished difference. Result has 210 places, 252 transitions, 2134 flow [2025-02-06 18:49:32,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2134, PETRI_PLACES=210, PETRI_TRANSITIONS=252} [2025-02-06 18:49:32,820 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 119 predicate places. [2025-02-06 18:49:32,820 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 252 transitions, 2134 flow [2025-02-06 18:49:32,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 0 states have call successors, (0), 0 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:49:32,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:32,820 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:49:32,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 18:49:32,820 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:32,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:32,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1482169752, now seen corresponding path program 1 times [2025-02-06 18:49:32,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:32,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883358404] [2025-02-06 18:49:32,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:32,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:32,827 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:49:32,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:49:32,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:32,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:33,117 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:33,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883358404] [2025-02-06 18:49:33,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883358404] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:33,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141713258] [2025-02-06 18:49:33,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:33,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:33,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:33,120 INFO L229 MonitoredProcess]: Starting monitored process 15 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:49:33,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-06 18:49:33,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-02-06 18:49:33,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-02-06 18:49:33,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:33,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:33,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 18:49:33,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:33,253 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 23 treesize of output 1 [2025-02-06 18:49:33,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 18:49:33,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 12 [2025-02-06 18:49:33,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:33,481 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:33,548 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 20 treesize of output 18 [2025-02-06 18:49:33,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 20 [2025-02-06 18:49:33,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:33,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141713258] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:33,571 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:33,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 17 [2025-02-06 18:49:33,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135332934] [2025-02-06 18:49:33,571 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:33,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 18:49:33,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:33,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 18:49:33,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-06 18:49:33,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 97 [2025-02-06 18:49:33,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 252 transitions, 2134 flow. Second operand has 19 states, 19 states have (on average 39.36842105263158) internal successors, (748), 19 states have internal predecessors, (748), 0 states have call successors, (0), 0 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:49:33,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:33,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 97 [2025-02-06 18:49:33,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:35,790 INFO L124 PetriNetUnfolderBase]: 8425/16207 cut-off events. [2025-02-06 18:49:35,791 INFO L125 PetriNetUnfolderBase]: For 48969/49757 co-relation queries the response was YES. [2025-02-06 18:49:35,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52165 conditions, 16207 events. 8425/16207 cut-off events. For 48969/49757 co-relation queries the response was YES. Maximal size of possible extension queue 737. Compared 141075 event pairs, 2013 based on Foata normal form. 270/15849 useless extension candidates. Maximal degree in co-relation 52125. Up to 2664 conditions per place. [2025-02-06 18:49:35,875 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 797 selfloop transitions, 78 changer transitions 7/920 dead transitions. [2025-02-06 18:49:35,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 920 transitions, 8652 flow [2025-02-06 18:49:35,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-06 18:49:35,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-06 18:49:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 1073 transitions. [2025-02-06 18:49:35,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5028116213683224 [2025-02-06 18:49:35,877 INFO L175 Difference]: Start difference. First operand has 210 places, 252 transitions, 2134 flow. Second operand 22 states and 1073 transitions. [2025-02-06 18:49:35,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 920 transitions, 8652 flow [2025-02-06 18:49:35,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 920 transitions, 8606 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:49:35,976 INFO L231 Difference]: Finished difference. Result has 236 places, 275 transitions, 2503 flow [2025-02-06 18:49:35,976 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2503, PETRI_PLACES=236, PETRI_TRANSITIONS=275} [2025-02-06 18:49:35,976 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 145 predicate places. [2025-02-06 18:49:35,976 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 275 transitions, 2503 flow [2025-02-06 18:49:35,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 39.36842105263158) internal successors, (748), 19 states have internal predecessors, (748), 0 states have call successors, (0), 0 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:49:35,977 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:35,977 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] [2025-02-06 18:49:35,983 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-06 18:49:36,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-02-06 18:49:36,177 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:36,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:36,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1297378878, now seen corresponding path program 1 times [2025-02-06 18:49:36,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:36,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662871809] [2025-02-06 18:49:36,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:36,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:49:36,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:49:36,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:36,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:36,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:36,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662871809] [2025-02-06 18:49:36,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662871809] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:36,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1070875603] [2025-02-06 18:49:36,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:36,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:36,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:36,444 INFO L229 MonitoredProcess]: Starting monitored process 16 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:49:36,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-06 18:49:36,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:49:36,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:49:36,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:36,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:36,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-02-06 18:49:36,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:36,570 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 15 treesize of output 1 [2025-02-06 18:49:36,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:49:36,718 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:36,718 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:36,798 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 18 treesize of output 16 [2025-02-06 18:49:36,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 22 treesize of output 16 [2025-02-06 18:49:36,830 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 18:49:36,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1070875603] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:36,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:36,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-02-06 18:49:36,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967858074] [2025-02-06 18:49:36,830 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:36,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-06 18:49:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:36,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-06 18:49:36,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2025-02-06 18:49:37,029 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 97 [2025-02-06 18:49:37,030 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 275 transitions, 2503 flow. Second operand has 19 states, 19 states have (on average 40.31578947368421) internal successors, (766), 19 states have internal predecessors, (766), 0 states have call successors, (0), 0 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:49:37,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:37,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 97 [2025-02-06 18:49:37,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:38,983 INFO L124 PetriNetUnfolderBase]: 7484/15046 cut-off events. [2025-02-06 18:49:38,983 INFO L125 PetriNetUnfolderBase]: For 50772/51456 co-relation queries the response was YES. [2025-02-06 18:49:39,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51243 conditions, 15046 events. 7484/15046 cut-off events. For 50772/51456 co-relation queries the response was YES. Maximal size of possible extension queue 725. Compared 134817 event pairs, 2327 based on Foata normal form. 767/15286 useless extension candidates. Maximal degree in co-relation 51195. Up to 3252 conditions per place. [2025-02-06 18:49:39,067 INFO L140 encePairwiseOnDemand]: 79/97 looper letters, 700 selfloop transitions, 83 changer transitions 160/986 dead transitions. [2025-02-06 18:49:39,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 259 places, 986 transitions, 9515 flow [2025-02-06 18:49:39,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-02-06 18:49:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2025-02-06 18:49:39,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 1180 transitions. [2025-02-06 18:49:39,069 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.506872852233677 [2025-02-06 18:49:39,069 INFO L175 Difference]: Start difference. First operand has 236 places, 275 transitions, 2503 flow. Second operand 24 states and 1180 transitions. [2025-02-06 18:49:39,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 259 places, 986 transitions, 9515 flow [2025-02-06 18:49:39,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 252 places, 986 transitions, 9438 flow, removed 3 selfloop flow, removed 7 redundant places. [2025-02-06 18:49:39,197 INFO L231 Difference]: Finished difference. Result has 260 places, 294 transitions, 2789 flow [2025-02-06 18:49:39,197 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2426, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=70, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=2789, PETRI_PLACES=260, PETRI_TRANSITIONS=294} [2025-02-06 18:49:39,198 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 169 predicate places. [2025-02-06 18:49:39,198 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 294 transitions, 2789 flow [2025-02-06 18:49:39,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 40.31578947368421) internal successors, (766), 19 states have internal predecessors, (766), 0 states have call successors, (0), 0 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:49:39,198 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:39,198 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 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:49:39,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:39,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-02-06 18:49:39,399 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:39,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:39,400 INFO L85 PathProgramCache]: Analyzing trace with hash 35445713, now seen corresponding path program 2 times [2025-02-06 18:49:39,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:39,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685366177] [2025-02-06 18:49:39,400 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:39,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:39,410 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 18:49:39,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 18:49:39,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:39,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:39,608 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:39,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:39,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685366177] [2025-02-06 18:49:39,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685366177] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:39,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848976432] [2025-02-06 18:49:39,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:39,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:39,611 INFO L229 MonitoredProcess]: Starting monitored process 17 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:49:39,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-06 18:49:39,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-02-06 18:49:39,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 18:49:39,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:39,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:39,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 18:49:39,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:39,873 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:40,069 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:40,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848976432] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:40,070 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:40,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2025-02-06 18:49:40,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515606297] [2025-02-06 18:49:40,070 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:40,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-02-06 18:49:40,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:40,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-02-06 18:49:40,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=588, Unknown=0, NotChecked=0, Total=702 [2025-02-06 18:49:40,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-02-06 18:49:40,253 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 294 transitions, 2789 flow. Second operand has 27 states, 27 states have (on average 42.851851851851855) internal successors, (1157), 27 states have internal predecessors, (1157), 0 states have call successors, (0), 0 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:49:40,253 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:40,253 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-02-06 18:49:40,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:42,050 INFO L124 PetriNetUnfolderBase]: 4598/11471 cut-off events. [2025-02-06 18:49:42,050 INFO L125 PetriNetUnfolderBase]: For 41864/42232 co-relation queries the response was YES. [2025-02-06 18:49:42,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41081 conditions, 11471 events. 4598/11471 cut-off events. For 41864/42232 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 110562 event pairs, 3482 based on Foata normal form. 172/11369 useless extension candidates. Maximal degree in co-relation 41025. Up to 2729 conditions per place. [2025-02-06 18:49:42,170 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 240 selfloop transitions, 137 changer transitions 0/441 dead transitions. [2025-02-06 18:49:42,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 441 transitions, 4396 flow [2025-02-06 18:49:42,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 18:49:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 18:49:42,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 940 transitions. [2025-02-06 18:49:42,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4845360824742268 [2025-02-06 18:49:42,171 INFO L175 Difference]: Start difference. First operand has 260 places, 294 transitions, 2789 flow. Second operand 20 states and 940 transitions. [2025-02-06 18:49:42,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 441 transitions, 4396 flow [2025-02-06 18:49:42,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 441 transitions, 4313 flow, removed 5 selfloop flow, removed 8 redundant places. [2025-02-06 18:49:42,379 INFO L231 Difference]: Finished difference. Result has 274 places, 362 transitions, 3454 flow [2025-02-06 18:49:42,379 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2706, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=75, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3454, PETRI_PLACES=274, PETRI_TRANSITIONS=362} [2025-02-06 18:49:42,379 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 183 predicate places. [2025-02-06 18:49:42,379 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 362 transitions, 3454 flow [2025-02-06 18:49:42,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 42.851851851851855) internal successors, (1157), 27 states have internal predecessors, (1157), 0 states have call successors, (0), 0 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:49:42,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:42,380 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:49:42,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:42,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:42,581 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:42,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:42,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1812237873, now seen corresponding path program 1 times [2025-02-06 18:49:42,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:42,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-02-06 18:49:42,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:49:42,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:42,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 18:49:42,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 18:49:42,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:49:42,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:42,643 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-06 18:49:42,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:42,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124970163] [2025-02-06 18:49:42,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124970163] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:42,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:49:42,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:49:42,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418823867] [2025-02-06 18:49:42,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:42,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:49:42,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:42,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:49:42,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:49:42,663 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 97 [2025-02-06 18:49:42,663 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 362 transitions, 3454 flow. Second operand has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:49:42,663 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:42,664 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 97 [2025-02-06 18:49:42,664 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:44,122 INFO L124 PetriNetUnfolderBase]: 6302/13418 cut-off events. [2025-02-06 18:49:44,123 INFO L125 PetriNetUnfolderBase]: For 49905/50507 co-relation queries the response was YES. [2025-02-06 18:49:44,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48369 conditions, 13418 events. 6302/13418 cut-off events. For 49905/50507 co-relation queries the response was YES. Maximal size of possible extension queue 461. Compared 118050 event pairs, 2607 based on Foata normal form. 417/13608 useless extension candidates. Maximal degree in co-relation 48310. Up to 5867 conditions per place. [2025-02-06 18:49:44,291 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 331 selfloop transitions, 16 changer transitions 102/495 dead transitions. [2025-02-06 18:49:44,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 495 transitions, 5510 flow [2025-02-06 18:49:44,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:49:44,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:49:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2025-02-06 18:49:44,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6623711340206185 [2025-02-06 18:49:44,292 INFO L175 Difference]: Start difference. First operand has 274 places, 362 transitions, 3454 flow. Second operand 4 states and 257 transitions. [2025-02-06 18:49:44,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 495 transitions, 5510 flow [2025-02-06 18:49:44,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 266 places, 495 transitions, 5390 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 18:49:44,470 INFO L231 Difference]: Finished difference. Result has 266 places, 295 transitions, 2784 flow [2025-02-06 18:49:44,470 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3256, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=2784, PETRI_PLACES=266, PETRI_TRANSITIONS=295} [2025-02-06 18:49:44,471 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 175 predicate places. [2025-02-06 18:49:44,471 INFO L471 AbstractCegarLoop]: Abstraction has has 266 places, 295 transitions, 2784 flow [2025-02-06 18:49:44,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.5) internal successors, (214), 4 states have internal predecessors, (214), 0 states have call successors, (0), 0 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:49:44,471 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:44,471 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 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:49:44,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 18:49:44,471 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:44,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:44,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1550222445, now seen corresponding path program 2 times [2025-02-06 18:49:44,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:44,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772840354] [2025-02-06 18:49:44,472 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:44,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:44,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 18:49:44,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:49:44,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:44,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:44,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772840354] [2025-02-06 18:49:44,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772840354] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:44,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450687434] [2025-02-06 18:49:44,666 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:44,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:44,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:44,671 INFO L229 MonitoredProcess]: Starting monitored process 18 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:49:44,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-06 18:49:44,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 39 statements into 2 equivalence classes. [2025-02-06 18:49:44,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:49:44,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:44,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:44,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-02-06 18:49:44,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:44,910 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:44,910 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:45,131 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 18:49:45,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450687434] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:45,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:45,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2025-02-06 18:49:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735165532] [2025-02-06 18:49:45,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:45,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-06 18:49:45,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:45,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-06 18:49:45,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2025-02-06 18:49:45,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 97 [2025-02-06 18:49:45,417 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 266 places, 295 transitions, 2784 flow. Second operand has 28 states, 28 states have (on average 42.92857142857143) internal successors, (1202), 28 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:49:45,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:45,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 97 [2025-02-06 18:49:45,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:46,757 INFO L124 PetriNetUnfolderBase]: 2984/7408 cut-off events. [2025-02-06 18:49:46,757 INFO L125 PetriNetUnfolderBase]: For 29960/30386 co-relation queries the response was YES. [2025-02-06 18:49:46,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27767 conditions, 7408 events. 2984/7408 cut-off events. For 29960/30386 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 65081 event pairs, 2174 based on Foata normal form. 165/7497 useless extension candidates. Maximal degree in co-relation 27707. Up to 2744 conditions per place. [2025-02-06 18:49:46,811 INFO L140 encePairwiseOnDemand]: 87/97 looper letters, 193 selfloop transitions, 105 changer transitions 46/399 dead transitions. [2025-02-06 18:49:46,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 399 transitions, 4193 flow [2025-02-06 18:49:46,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-02-06 18:49:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-02-06 18:49:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 948 transitions. [2025-02-06 18:49:46,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.488659793814433 [2025-02-06 18:49:46,812 INFO L175 Difference]: Start difference. First operand has 266 places, 295 transitions, 2784 flow. Second operand 20 states and 948 transitions. [2025-02-06 18:49:46,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 399 transitions, 4193 flow [2025-02-06 18:49:46,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 399 transitions, 4149 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-02-06 18:49:46,910 INFO L231 Difference]: Finished difference. Result has 283 places, 315 transitions, 3213 flow [2025-02-06 18:49:46,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2739, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=3213, PETRI_PLACES=283, PETRI_TRANSITIONS=315} [2025-02-06 18:49:46,911 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 192 predicate places. [2025-02-06 18:49:46,911 INFO L471 AbstractCegarLoop]: Abstraction has has 283 places, 315 transitions, 3213 flow [2025-02-06 18:49:46,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 42.92857142857143) internal successors, (1202), 28 states have internal predecessors, (1202), 0 states have call successors, (0), 0 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:49:46,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:46,912 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 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:49:46,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-02-06 18:49:47,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:47,113 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:47,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1109322705, now seen corresponding path program 3 times [2025-02-06 18:49:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:47,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060929106] [2025-02-06 18:49:47,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:49:47,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:47,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-02-06 18:49:47,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-02-06 18:49:47,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:49:47,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:47,330 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 18:49:47,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060929106] [2025-02-06 18:49:47,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060929106] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:47,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118332464] [2025-02-06 18:49:47,330 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:49:47,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:47,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:47,333 INFO L229 MonitoredProcess]: Starting monitored process 19 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:49:47,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-02-06 18:49:47,414 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 4 equivalence classes. [2025-02-06 18:49:47,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 28 of 43 statements. [2025-02-06 18:49:47,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-06 18:49:47,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:47,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 18:49:47,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:47,454 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 23 treesize of output 1 [2025-02-06 18:49:47,530 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 23 treesize of output 7 [2025-02-06 18:49:47,533 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 18:49:47,534 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:49:47,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118332464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:47,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:49:47,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2025-02-06 18:49:47,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453445260] [2025-02-06 18:49:47,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:47,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:49:47,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:47,534 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:49:47,534 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:49:47,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 97 [2025-02-06 18:49:47,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 315 transitions, 3213 flow. Second operand has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:49:47,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:47,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 97 [2025-02-06 18:49:47,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:48,560 INFO L124 PetriNetUnfolderBase]: 3037/7243 cut-off events. [2025-02-06 18:49:48,560 INFO L125 PetriNetUnfolderBase]: For 27347/27821 co-relation queries the response was YES. [2025-02-06 18:49:48,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27068 conditions, 7243 events. 3037/7243 cut-off events. For 27347/27821 co-relation queries the response was YES. Maximal size of possible extension queue 304. Compared 62318 event pairs, 650 based on Foata normal form. 235/7470 useless extension candidates. Maximal degree in co-relation 27007. Up to 2924 conditions per place. [2025-02-06 18:49:48,620 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 249 selfloop transitions, 59 changer transitions 0/359 dead transitions. [2025-02-06 18:49:48,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 287 places, 359 transitions, 4192 flow [2025-02-06 18:49:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:49:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:49:48,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 405 transitions. [2025-02-06 18:49:48,621 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5964653902798233 [2025-02-06 18:49:48,621 INFO L175 Difference]: Start difference. First operand has 283 places, 315 transitions, 3213 flow. Second operand 7 states and 405 transitions. [2025-02-06 18:49:48,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 287 places, 359 transitions, 4192 flow [2025-02-06 18:49:48,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 359 transitions, 4040 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-06 18:49:48,736 INFO L231 Difference]: Finished difference. Result has 274 places, 312 transitions, 3156 flow [2025-02-06 18:49:48,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3038, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3156, PETRI_PLACES=274, PETRI_TRANSITIONS=312} [2025-02-06 18:49:48,737 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 183 predicate places. [2025-02-06 18:49:48,737 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 312 transitions, 3156 flow [2025-02-06 18:49:48,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 53.285714285714285) internal successors, (373), 7 states have internal predecessors, (373), 0 states have call successors, (0), 0 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:49:48,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:48,737 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 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:49:48,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:48,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:48,937 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:48,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash 29235642, now seen corresponding path program 2 times [2025-02-06 18:49:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:48,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-02-06 18:49:48,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:48,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:48,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 18:49:48,971 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 18:49:48,971 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:48,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:49,257 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 18:49:49,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28661294] [2025-02-06 18:49:49,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28661294] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:49,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [326278118] [2025-02-06 18:49:49,258 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:49,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:49,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:49,260 INFO L229 MonitoredProcess]: Starting monitored process 20 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:49:49,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-02-06 18:49:49,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 44 statements into 2 equivalence classes. [2025-02-06 18:49:49,375 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 44 of 44 statements. [2025-02-06 18:49:49,375 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:49,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:49,377 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-02-06 18:49:49,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:49,391 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 23 treesize of output 1 [2025-02-06 18:49:49,481 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 25 treesize of output 9 [2025-02-06 18:49:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-06 18:49:49,495 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:49:49,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [326278118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:49:49,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:49:49,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 9 [2025-02-06 18:49:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280180915] [2025-02-06 18:49:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:49:49,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:49:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:49:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:49:49,603 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 97 [2025-02-06 18:49:49,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 312 transitions, 3156 flow. Second operand has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:49:49,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:49,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 97 [2025-02-06 18:49:49,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:50,567 INFO L124 PetriNetUnfolderBase]: 2911/7039 cut-off events. [2025-02-06 18:49:50,568 INFO L125 PetriNetUnfolderBase]: For 28615/29037 co-relation queries the response was YES. [2025-02-06 18:49:50,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26772 conditions, 7039 events. 2911/7039 cut-off events. For 28615/29037 co-relation queries the response was YES. Maximal size of possible extension queue 297. Compared 60590 event pairs, 650 based on Foata normal form. 217/7248 useless extension candidates. Maximal degree in co-relation 26711. Up to 2720 conditions per place. [2025-02-06 18:49:50,609 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 236 selfloop transitions, 59 changer transitions 12/358 dead transitions. [2025-02-06 18:49:50,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 358 transitions, 4151 flow [2025-02-06 18:49:50,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:49:50,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:49:50,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 397 transitions. [2025-02-06 18:49:50,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5846833578792342 [2025-02-06 18:49:50,610 INFO L175 Difference]: Start difference. First operand has 274 places, 312 transitions, 3156 flow. Second operand 7 states and 397 transitions. [2025-02-06 18:49:50,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 358 transitions, 4151 flow [2025-02-06 18:49:50,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 358 transitions, 4029 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 18:49:50,716 INFO L231 Difference]: Finished difference. Result has 272 places, 305 transitions, 3075 flow [2025-02-06 18:49:50,717 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3029, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=59, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=252, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=3075, PETRI_PLACES=272, PETRI_TRANSITIONS=305} [2025-02-06 18:49:50,717 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 181 predicate places. [2025-02-06 18:49:50,717 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 305 transitions, 3075 flow [2025-02-06 18:49:50,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 52.42857142857143) internal successors, (367), 7 states have internal predecessors, (367), 0 states have call successors, (0), 0 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:49:50,718 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:50,718 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 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:49:50,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2025-02-06 18:49:50,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:50,918 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:50,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:50,919 INFO L85 PathProgramCache]: Analyzing trace with hash -112517805, now seen corresponding path program 3 times [2025-02-06 18:49:50,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:50,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-02-06 18:49:50,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:49:50,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:50,926 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-02-06 18:49:50,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-02-06 18:49:50,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 18:49:50,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:51,249 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 18:49:51,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042235654] [2025-02-06 18:49:51,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042235654] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:51,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854347346] [2025-02-06 18:49:51,250 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-06 18:49:51,250 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:51,252 INFO L229 MonitoredProcess]: Starting monitored process 21 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:49:51,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-02-06 18:49:51,331 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 5 equivalence classes. [2025-02-06 18:49:51,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 42 of 45 statements. [2025-02-06 18:49:51,362 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-02-06 18:49:51,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:51,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-02-06 18:49:51,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:51,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:49:51,395 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 23 treesize of output 1 [2025-02-06 18:49:51,470 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:49:51,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:49:51,487 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 22 treesize of output 17 [2025-02-06 18:49:51,529 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 25 treesize of output 9 [2025-02-06 18:49:51,560 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 18:49:51,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:51,613 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_826 (Array Int Int))) (< 0 (+ 2147483649 (select (select (store |c_#memory_int#2| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_826) c_~get_2~0.base) (+ (* c_~id_0~0 4) c_~get_2~0.offset))))) is different from false [2025-02-06 18:49:51,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:51,721 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2025-02-06 18:49:51,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:51,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 48 treesize of output 41 [2025-02-06 18:49:51,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2025-02-06 18:49:51,784 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2025-02-06 18:49:51,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854347346] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:51,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:51,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 23 [2025-02-06 18:49:51,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821167350] [2025-02-06 18:49:51,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:51,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-06 18:49:51,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:51,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-06 18:49:51,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=430, Unknown=1, NotChecked=42, Total=552 [2025-02-06 18:49:51,825 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 97 [2025-02-06 18:49:51,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 305 transitions, 3075 flow. Second operand has 24 states, 24 states have (on average 33.041666666666664) internal successors, (793), 24 states have internal predecessors, (793), 0 states have call successors, (0), 0 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:49:51,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:51,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 97 [2025-02-06 18:49:51,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:53,391 INFO L124 PetriNetUnfolderBase]: 4373/8371 cut-off events. [2025-02-06 18:49:53,391 INFO L125 PetriNetUnfolderBase]: For 29890/30596 co-relation queries the response was YES. [2025-02-06 18:49:53,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31486 conditions, 8371 events. 4373/8371 cut-off events. For 29890/30596 co-relation queries the response was YES. Maximal size of possible extension queue 334. Compared 63354 event pairs, 650 based on Foata normal form. 433/8777 useless extension candidates. Maximal degree in co-relation 31425. Up to 2500 conditions per place. [2025-02-06 18:49:53,437 INFO L140 encePairwiseOnDemand]: 83/97 looper letters, 389 selfloop transitions, 87 changer transitions 0/510 dead transitions. [2025-02-06 18:49:53,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 510 transitions, 5591 flow [2025-02-06 18:49:53,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 18:49:53,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 18:49:53,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 507 transitions. [2025-02-06 18:49:53,439 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4020618556701031 [2025-02-06 18:49:53,439 INFO L175 Difference]: Start difference. First operand has 272 places, 305 transitions, 3075 flow. Second operand 13 states and 507 transitions. [2025-02-06 18:49:53,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 510 transitions, 5591 flow [2025-02-06 18:49:53,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 270 places, 510 transitions, 5412 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-06 18:49:53,522 INFO L231 Difference]: Finished difference. Result has 270 places, 303 transitions, 3078 flow [2025-02-06 18:49:53,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2904, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=3078, PETRI_PLACES=270, PETRI_TRANSITIONS=303} [2025-02-06 18:49:53,523 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 179 predicate places. [2025-02-06 18:49:53,523 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 303 transitions, 3078 flow [2025-02-06 18:49:53,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 33.041666666666664) internal successors, (793), 24 states have internal predecessors, (793), 0 states have call successors, (0), 0 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:49:53,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:49:53,523 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 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:49:53,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-02-06 18:49:53,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,21 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:53,724 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:49:53,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:49:53,724 INFO L85 PathProgramCache]: Analyzing trace with hash -400152058, now seen corresponding path program 2 times [2025-02-06 18:49:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:49:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-02-06 18:49:53,725 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:53,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:49:53,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 18:49:53,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 18:49:53,753 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:53,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:54,066 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 18:49:54,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:49:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514555879] [2025-02-06 18:49:54,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514555879] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:49:54,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125599290] [2025-02-06 18:49:54,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:49:54,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:49:54,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:49:54,068 INFO L229 MonitoredProcess]: Starting monitored process 22 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:49:54,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-02-06 18:49:54,164 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-02-06 18:49:54,205 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-02-06 18:49:54,206 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:49:54,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:49:54,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 18:49:54,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:49:54,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:49:54,299 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 23 treesize of output 1 [2025-02-06 18:49:54,368 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:49:54,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:49:54,390 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 20 treesize of output 15 [2025-02-06 18:49:54,818 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 18:49:54,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 23 treesize of output 10 [2025-02-06 18:49:54,823 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:49:54,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:49:55,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:55,191 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 18:49:55,199 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:49:55,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 33 [2025-02-06 18:49:55,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-02-06 18:49:55,524 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:49:55,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125599290] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:49:55,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:49:55,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 44 [2025-02-06 18:49:55,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479504166] [2025-02-06 18:49:55,524 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:49:55,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 18:49:55,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:49:55,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 18:49:55,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=1758, Unknown=2, NotChecked=0, Total=1980 [2025-02-06 18:49:56,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 97 [2025-02-06 18:49:56,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 303 transitions, 3078 flow. Second operand has 45 states, 45 states have (on average 28.466666666666665) internal successors, (1281), 45 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:49:56,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:49:56,237 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 97 [2025-02-06 18:49:56,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:49:59,754 INFO L124 PetriNetUnfolderBase]: 7308/13853 cut-off events. [2025-02-06 18:49:59,754 INFO L125 PetriNetUnfolderBase]: For 58978/60067 co-relation queries the response was YES. [2025-02-06 18:49:59,854 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52676 conditions, 13853 events. 7308/13853 cut-off events. For 58978/60067 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 111502 event pairs, 1104 based on Foata normal form. 361/14193 useless extension candidates. Maximal degree in co-relation 52620. Up to 3234 conditions per place. [2025-02-06 18:49:59,902 INFO L140 encePairwiseOnDemand]: 82/97 looper letters, 393 selfloop transitions, 102 changer transitions 4/530 dead transitions. [2025-02-06 18:49:59,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 294 places, 530 transitions, 5898 flow [2025-02-06 18:49:59,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-06 18:49:59,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2025-02-06 18:49:59,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 888 transitions. [2025-02-06 18:49:59,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.33906071019473083 [2025-02-06 18:49:59,904 INFO L175 Difference]: Start difference. First operand has 270 places, 303 transitions, 3078 flow. Second operand 27 states and 888 transitions. [2025-02-06 18:49:59,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 294 places, 530 transitions, 5898 flow [2025-02-06 18:50:00,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 281 places, 530 transitions, 5583 flow, removed 0 selfloop flow, removed 13 redundant places. [2025-02-06 18:50:00,072 INFO L231 Difference]: Finished difference. Result has 281 places, 326 transitions, 3326 flow [2025-02-06 18:50:00,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=2873, PETRI_DIFFERENCE_MINUEND_PLACES=255, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=76, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=3326, PETRI_PLACES=281, PETRI_TRANSITIONS=326} [2025-02-06 18:50:00,073 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 190 predicate places. [2025-02-06 18:50:00,073 INFO L471 AbstractCegarLoop]: Abstraction has has 281 places, 326 transitions, 3326 flow [2025-02-06 18:50:00,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 28.466666666666665) internal successors, (1281), 45 states have internal predecessors, (1281), 0 states have call successors, (0), 0 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:50:00,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:00,074 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:50:00,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-02-06 18:50:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-02-06 18:50:00,274 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:50:00,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:00,275 INFO L85 PathProgramCache]: Analyzing trace with hash 806916253, now seen corresponding path program 2 times [2025-02-06 18:50:00,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:00,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063920807] [2025-02-06 18:50:00,275 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:50:00,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:00,286 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 18:50:00,304 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:50:00,308 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:50:00,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:00,627 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 18:50:00,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:00,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063920807] [2025-02-06 18:50:00,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063920807] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:50:00,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310845558] [2025-02-06 18:50:00,627 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:50:00,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:50:00,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:50:00,629 INFO L229 MonitoredProcess]: Starting monitored process 23 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:50:00,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-02-06 18:50:00,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 18:50:00,748 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:50:00,748 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:50:00,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:00,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 57 conjuncts are in the unsatisfiable core [2025-02-06 18:50:00,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:50:00,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:50:00,874 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 15 treesize of output 1 [2025-02-06 18:50:00,934 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:50:00,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:50:00,957 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 16 treesize of output 11 [2025-02-06 18:50:01,289 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:50:01,346 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:50:01,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:50:01,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:50:01,848 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-02-06 18:50:01,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:50:01,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 41 treesize of output 33 [2025-02-06 18:50:01,858 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 13 treesize of output 7 [2025-02-06 18:50:02,108 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:50:02,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310845558] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:50:02,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:50:02,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 21, 21] total 46 [2025-02-06 18:50:02,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-02-06 18:50:02,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:50:02,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2025-02-06 18:50:02,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:02,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2025-02-06 18:50:02,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1952, Unknown=2, NotChecked=0, Total=2162 [2025-02-06 18:50:03,057 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 97 [2025-02-06 18:50:03,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 281 places, 326 transitions, 3326 flow. Second operand has 47 states, 47 states have (on average 26.361702127659573) internal successors, (1239), 47 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:50:03,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:50:03,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 97 [2025-02-06 18:50:03,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:50:08,269 INFO L124 PetriNetUnfolderBase]: 7054/13041 cut-off events. [2025-02-06 18:50:08,269 INFO L125 PetriNetUnfolderBase]: For 45340/46406 co-relation queries the response was YES. [2025-02-06 18:50:08,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48143 conditions, 13041 events. 7054/13041 cut-off events. For 45340/46406 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 101954 event pairs, 1040 based on Foata normal form. 691/13567 useless extension candidates. Maximal degree in co-relation 48087. Up to 1920 conditions per place. [2025-02-06 18:50:08,410 INFO L140 encePairwiseOnDemand]: 78/97 looper letters, 515 selfloop transitions, 123 changer transitions 308/972 dead transitions. [2025-02-06 18:50:08,410 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 972 transitions, 9988 flow [2025-02-06 18:50:08,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-06 18:50:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-02-06 18:50:08,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 1487 transitions. [2025-02-06 18:50:08,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.3332586284177499 [2025-02-06 18:50:08,412 INFO L175 Difference]: Start difference. First operand has 281 places, 326 transitions, 3326 flow. Second operand 46 states and 1487 transitions. [2025-02-06 18:50:08,412 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 972 transitions, 9988 flow [2025-02-06 18:50:08,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 972 transitions, 9644 flow, removed 61 selfloop flow, removed 20 redundant places. [2025-02-06 18:50:08,510 INFO L231 Difference]: Finished difference. Result has 305 places, 317 transitions, 3235 flow [2025-02-06 18:50:08,511 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=3136, PETRI_DIFFERENCE_MINUEND_PLACES=260, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=3235, PETRI_PLACES=305, PETRI_TRANSITIONS=317} [2025-02-06 18:50:08,511 INFO L279 CegarLoopForPetriNet]: 91 programPoint places, 214 predicate places. [2025-02-06 18:50:08,511 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 317 transitions, 3235 flow [2025-02-06 18:50:08,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 26.361702127659573) internal successors, (1239), 47 states have internal predecessors, (1239), 0 states have call successors, (0), 0 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:50:08,511 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:50:08,512 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 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:50:08,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-02-06 18:50:08,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-02-06 18:50:08,712 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (and 41 more)] === [2025-02-06 18:50:08,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:50:08,713 INFO L85 PathProgramCache]: Analyzing trace with hash 480158267, now seen corresponding path program 2 times [2025-02-06 18:50:08,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:50:08,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-02-06 18:50:08,713 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:50:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:50:08,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 18:50:08,741 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:50:08,741 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:50:08,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:09,054 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 9 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-06 18:50:09,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:50:09,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-02-06 18:50:09,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308736431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:50:09,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1555228730] [2025-02-06 18:50:09,055 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 18:50:09,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:50:09,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:50:09,057 INFO L229 MonitoredProcess]: Starting monitored process 24 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:50:09,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-02-06 18:50:09,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 46 statements into 2 equivalence classes. [2025-02-06 18:50:09,183 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 18:50:09,183 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-06 18:50:09,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:50:09,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-02-06 18:50:09,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:50:09,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 6 treesize of output 5 [2025-02-06 18:50:09,284 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 23 treesize of output 1 [2025-02-06 18:50:09,368 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-06 18:50:09,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 11 [2025-02-06 18:50:09,398 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 22 treesize of output 17 [2025-02-06 18:50:09,826 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-02-06 18:50:09,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 25 treesize of output 12 [2025-02-06 18:50:09,850 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 11 proven. 28 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:50:09,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 18:50:10,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:50:10,351 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2025-02-06 18:50:10,359 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:50:10,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 47 treesize of output 39 [2025-02-06 18:50:10,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 9 [2025-02-06 18:50:10,811 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 9 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:50:10,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1555228730] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 18:50:10,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 18:50:10,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 19, 19] total 44 [2025-02-06 18:50:10,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100842365] [2025-02-06 18:50:10,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 18:50:10,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 18:50:10,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:50:10,813 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 18:50:10,813 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1767, Unknown=1, NotChecked=0, Total=1980