./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/pthread/queue_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/queue_longer.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 18:29:29,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 18:29:29,686 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-06 18:29:29,689 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 18:29:29,690 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 18:29:29,712 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 18:29:29,712 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 18:29:29,713 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 18:29:29,713 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 18:29:29,713 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 18:29:29,714 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 18:29:29,714 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 18:29:29,714 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 18:29:29,714 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 18:29:29,714 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 18:29:29,715 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 18:29:29,715 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 18:29:29,716 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 18:29:29,716 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:29:29,717 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 18:29:29,717 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 18:29:29,718 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 18:29:29,718 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 -> 9f874a9872f93f025fac23ebed37f94a1f3b80bd0133ea4d7e298577c4fec427 [2025-02-06 18:29:29,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 18:29:29,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 18:29:29,930 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 18:29:29,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 18:29:29,931 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 18:29:29,932 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/queue_longer.i [2025-02-06 18:29:31,025 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b94880f0a/832c9a09ccec4fbf8f73aaf857cd8594/FLAG79de0c34a [2025-02-06 18:29:31,278 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 18:29:31,278 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread/queue_longer.i [2025-02-06 18:29:31,290 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b94880f0a/832c9a09ccec4fbf8f73aaf857cd8594/FLAG79de0c34a [2025-02-06 18:29:31,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b94880f0a/832c9a09ccec4fbf8f73aaf857cd8594 [2025-02-06 18:29:31,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 18:29:31,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 18:29:31,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 18:29:31,304 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 18:29:31,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 18:29:31,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:31,309 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48e96db4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31, skipping insertion in model container [2025-02-06 18:29:31,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:31,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 18:29:31,702 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:29:31,731 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 18:29:31,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 18:29:31,858 INFO L204 MainTranslator]: Completed translation [2025-02-06 18:29:31,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31 WrapperNode [2025-02-06 18:29:31,859 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 18:29:31,860 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 18:29:31,860 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 18:29:31,860 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 18:29:31,864 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:31,886 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:31,948 INFO L138 Inliner]: procedures = 274, calls = 859, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 1058 [2025-02-06 18:29:31,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 18:29:31,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 18:29:31,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 18:29:31,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 18:29:31,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:31,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:31,970 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,003 INFO L175 MemorySlicer]: Split 844 memory accesses to 4 slices as follows [2, 5, 403, 434]. 51 percent of accesses are in the largest equivalence class. The 810 initializations are split as follows [2, 5, 400, 403]. The 16 writes are split as follows [0, 0, 2, 14]. [2025-02-06 18:29:32,003 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,003 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,040 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,042 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,047 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 18:29:32,058 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 18:29:32,058 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 18:29:32,058 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 18:29:32,060 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (1/1) ... [2025-02-06 18:29:32,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 18:29:32,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:32,086 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 18:29:32,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-02-06 18:29:32,103 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-02-06 18:29:32,103 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-06 18:29:32,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-06 18:29:32,104 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-06 18:29:32,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 18:29:32,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 18:29:32,107 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 18:29:32,227 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 18:29:32,228 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 18:29:33,186 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 18:29:33,186 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 18:29:38,599 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 18:29:38,600 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 18:29:38,600 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:29:38 BoogieIcfgContainer [2025-02-06 18:29:38,600 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 18:29:38,602 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 18:29:38,602 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 18:29:38,605 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 18:29:38,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 06:29:31" (1/3) ... [2025-02-06 18:29:38,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3316d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:29:38, skipping insertion in model container [2025-02-06 18:29:38,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 06:29:31" (2/3) ... [2025-02-06 18:29:38,606 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a3316d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 06:29:38, skipping insertion in model container [2025-02-06 18:29:38,606 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 06:29:38" (3/3) ... [2025-02-06 18:29:38,607 INFO L128 eAbstractionObserver]: Analyzing ICFG queue_longer.i [2025-02-06 18:29:38,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 18:29:38,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_longer.i that has 3 procedures, 75 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-02-06 18:29:38,624 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 18:29:38,710 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 18:29:38,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 83 transitions, 180 flow [2025-02-06 18:29:38,811 INFO L124 PetriNetUnfolderBase]: 9/81 cut-off events. [2025-02-06 18:29:38,815 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 18:29:38,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 81 events. 9/81 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 210 event pairs, 0 based on Foata normal form. 0/54 useless extension candidates. Maximal degree in co-relation 78. Up to 2 conditions per place. [2025-02-06 18:29:38,821 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 83 transitions, 180 flow [2025-02-06 18:29:38,824 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 77 places, 79 transitions, 167 flow [2025-02-06 18:29:38,829 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 18:29:38,842 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;@6106c4ad, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 18:29:38,843 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-02-06 18:29:38,874 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 18:29:38,874 INFO L124 PetriNetUnfolderBase]: 0/12 cut-off events. [2025-02-06 18:29:38,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 18:29:38,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:38,875 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-06 18:29:38,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:38,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:38,881 INFO L85 PathProgramCache]: Analyzing trace with hash -1888016666, now seen corresponding path program 1 times [2025-02-06 18:29:38,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:38,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757059960] [2025-02-06 18:29:38,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:38,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:38,992 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-06 18:29:39,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-06 18:29:39,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:39,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:40,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:40,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757059960] [2025-02-06 18:29:40,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757059960] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:40,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:40,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:40,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974423402] [2025-02-06 18:29:40,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:40,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:40,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:40,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:40,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:40,353 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:40,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:40,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:40,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:40,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:40,919 INFO L124 PetriNetUnfolderBase]: 1236/2546 cut-off events. [2025-02-06 18:29:40,919 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-06 18:29:40,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4529 conditions, 2546 events. 1236/2546 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 15940 event pairs, 205 based on Foata normal form. 48/2217 useless extension candidates. Maximal degree in co-relation 4460. Up to 1613 conditions per place. [2025-02-06 18:29:40,937 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 73 selfloop transitions, 6 changer transitions 0/109 dead transitions. [2025-02-06 18:29:40,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 109 transitions, 391 flow [2025-02-06 18:29:40,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:40,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:40,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2025-02-06 18:29:40,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6295180722891566 [2025-02-06 18:29:40,948 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 167 flow. Second operand 4 states and 209 transitions. [2025-02-06 18:29:40,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 109 transitions, 391 flow [2025-02-06 18:29:40,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 109 transitions, 384 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:40,953 INFO L231 Difference]: Finished difference. Result has 80 places, 82 transitions, 202 flow [2025-02-06 18:29:40,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=202, PETRI_PLACES=80, PETRI_TRANSITIONS=82} [2025-02-06 18:29:40,957 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 3 predicate places. [2025-02-06 18:29:40,957 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 82 transitions, 202 flow [2025-02-06 18:29:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:40,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:40,958 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 18:29:40,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:40,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:40,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1601027720, now seen corresponding path program 1 times [2025-02-06 18:29:40,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:40,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121217997] [2025-02-06 18:29:40,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:40,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-06 18:29:41,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-06 18:29:41,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:41,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:41,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:41,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:41,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121217997] [2025-02-06 18:29:41,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121217997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:41,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:41,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:41,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997824698] [2025-02-06 18:29:41,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:41,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:41,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:41,621 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:41,621 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:41,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:41,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 82 transitions, 202 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:41,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:41,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:41,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:42,012 INFO L124 PetriNetUnfolderBase]: 1242/2599 cut-off events. [2025-02-06 18:29:42,013 INFO L125 PetriNetUnfolderBase]: For 456/460 co-relation queries the response was YES. [2025-02-06 18:29:42,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4908 conditions, 2599 events. 1242/2599 cut-off events. For 456/460 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 16708 event pairs, 264 based on Foata normal form. 40/2317 useless extension candidates. Maximal degree in co-relation 4140. Up to 1757 conditions per place. [2025-02-06 18:29:42,028 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 6 changer transitions 0/117 dead transitions. [2025-02-06 18:29:42,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 117 transitions, 456 flow [2025-02-06 18:29:42,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 18:29:42,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 18:29:42,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2025-02-06 18:29:42,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-02-06 18:29:42,031 INFO L175 Difference]: Start difference. First operand has 80 places, 82 transitions, 202 flow. Second operand 5 states and 249 transitions. [2025-02-06 18:29:42,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 117 transitions, 456 flow [2025-02-06 18:29:42,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 117 transitions, 450 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:42,033 INFO L231 Difference]: Finished difference. Result has 84 places, 83 transitions, 219 flow [2025-02-06 18:29:42,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=219, PETRI_PLACES=84, PETRI_TRANSITIONS=83} [2025-02-06 18:29:42,037 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 7 predicate places. [2025-02-06 18:29:42,038 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 83 transitions, 219 flow [2025-02-06 18:29:42,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:42,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:42,038 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:42,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 18:29:42,038 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:42,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:42,039 INFO L85 PathProgramCache]: Analyzing trace with hash 989420076, now seen corresponding path program 1 times [2025-02-06 18:29:42,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:42,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048757538] [2025-02-06 18:29:42,040 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:42,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:42,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-06 18:29:42,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-06 18:29:42,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:42,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:42,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:42,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:42,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048757538] [2025-02-06 18:29:42,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048757538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:42,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:42,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:42,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535999571] [2025-02-06 18:29:42,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:42,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:42,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:42,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:29:42,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:42,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 83 transitions, 219 flow. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:42,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:42,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:42,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:43,121 INFO L124 PetriNetUnfolderBase]: 1322/2709 cut-off events. [2025-02-06 18:29:43,122 INFO L125 PetriNetUnfolderBase]: For 536/554 co-relation queries the response was YES. [2025-02-06 18:29:43,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5217 conditions, 2709 events. 1322/2709 cut-off events. For 536/554 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 17314 event pairs, 266 based on Foata normal form. 44/2399 useless extension candidates. Maximal degree in co-relation 4439. Up to 1803 conditions per place. [2025-02-06 18:29:43,138 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 102 selfloop transitions, 11 changer transitions 0/143 dead transitions. [2025-02-06 18:29:43,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 143 transitions, 585 flow [2025-02-06 18:29:43,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 18:29:43,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-02-06 18:29:43,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 340 transitions. [2025-02-06 18:29:43,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5851979345955249 [2025-02-06 18:29:43,143 INFO L175 Difference]: Start difference. First operand has 84 places, 83 transitions, 219 flow. Second operand 7 states and 340 transitions. [2025-02-06 18:29:43,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 143 transitions, 585 flow [2025-02-06 18:29:43,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 571 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:43,148 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 274 flow [2025-02-06 18:29:43,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2025-02-06 18:29:43,149 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-02-06 18:29:43,149 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 274 flow [2025-02-06 18:29:43,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:43,150 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:43,150 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:43,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 18:29:43,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:43,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1804963147, now seen corresponding path program 1 times [2025-02-06 18:29:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:43,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308769078] [2025-02-06 18:29:43,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:43,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:43,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-06 18:29:43,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-06 18:29:43,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:43,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:43,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:43,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308769078] [2025-02-06 18:29:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308769078] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 18:29:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956751640] [2025-02-06 18:29:43,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:43,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:29:43,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:43,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:29:43,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:29:43,313 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-02-06 18:29:43,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:43,313 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:43,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-02-06 18:29:43,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:43,712 INFO L124 PetriNetUnfolderBase]: 1023/2391 cut-off events. [2025-02-06 18:29:43,712 INFO L125 PetriNetUnfolderBase]: For 554/554 co-relation queries the response was YES. [2025-02-06 18:29:43,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 2391 events. 1023/2391 cut-off events. For 554/554 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 14112 event pairs, 483 based on Foata normal form. 41/2131 useless extension candidates. Maximal degree in co-relation 4352. Up to 884 conditions per place. [2025-02-06 18:29:43,723 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 63 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2025-02-06 18:29:43,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 96 transitions, 370 flow [2025-02-06 18:29:43,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:29:43,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:29:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2025-02-06 18:29:43,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7028112449799196 [2025-02-06 18:29:43,726 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 274 flow. Second operand 3 states and 175 transitions. [2025-02-06 18:29:43,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 96 transitions, 370 flow [2025-02-06 18:29:43,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 96 transitions, 331 flow, removed 4 selfloop flow, removed 13 redundant places. [2025-02-06 18:29:43,730 INFO L231 Difference]: Finished difference. Result has 74 places, 75 transitions, 167 flow [2025-02-06 18:29:43,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=167, PETRI_PLACES=74, PETRI_TRANSITIONS=75} [2025-02-06 18:29:43,730 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, -3 predicate places. [2025-02-06 18:29:43,730 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 75 transitions, 167 flow [2025-02-06 18:29:43,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:43,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:43,731 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:43,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 18:29:43,731 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:43,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:43,731 INFO L85 PathProgramCache]: Analyzing trace with hash -597161202, now seen corresponding path program 1 times [2025-02-06 18:29:43,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:43,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692580738] [2025-02-06 18:29:43,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:43,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:43,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-02-06 18:29:43,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-02-06 18:29:43,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:43,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:43,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:43,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:43,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692580738] [2025-02-06 18:29:43,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692580738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:43,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:43,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:43,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892585405] [2025-02-06 18:29:43,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:43,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:43,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:43,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:43,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:43,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-02-06 18:29:43,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 75 transitions, 167 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:43,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:43,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-02-06 18:29:43,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:44,325 INFO L124 PetriNetUnfolderBase]: 1890/4146 cut-off events. [2025-02-06 18:29:44,325 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2025-02-06 18:29:44,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7399 conditions, 4146 events. 1890/4146 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26808 event pairs, 949 based on Foata normal form. 138/3773 useless extension candidates. Maximal degree in co-relation 7394. Up to 1977 conditions per place. [2025-02-06 18:29:44,348 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 112 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2025-02-06 18:29:44,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 143 transitions, 550 flow [2025-02-06 18:29:44,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:44,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:44,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 251 transitions. [2025-02-06 18:29:44,351 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7560240963855421 [2025-02-06 18:29:44,351 INFO L175 Difference]: Start difference. First operand has 74 places, 75 transitions, 167 flow. Second operand 4 states and 251 transitions. [2025-02-06 18:29:44,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 143 transitions, 550 flow [2025-02-06 18:29:44,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 143 transitions, 544 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:44,354 INFO L231 Difference]: Finished difference. Result has 78 places, 77 transitions, 188 flow [2025-02-06 18:29:44,356 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=188, PETRI_PLACES=78, PETRI_TRANSITIONS=77} [2025-02-06 18:29:44,356 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 1 predicate places. [2025-02-06 18:29:44,357 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 77 transitions, 188 flow [2025-02-06 18:29:44,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:44,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:44,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:44,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 18:29:44,357 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:44,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:44,357 INFO L85 PathProgramCache]: Analyzing trace with hash -712344046, now seen corresponding path program 1 times [2025-02-06 18:29:44,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:44,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038721287] [2025-02-06 18:29:44,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:44,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:44,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-06 18:29:44,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-06 18:29:44,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:44,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:44,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038721287] [2025-02-06 18:29:44,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038721287] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:44,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:44,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 18:29:44,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138627122] [2025-02-06 18:29:44,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:44,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:44,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:44,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:44,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 18:29:44,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-02-06 18:29:44,863 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 77 transitions, 188 flow. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:44,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:44,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-02-06 18:29:44,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:45,365 INFO L124 PetriNetUnfolderBase]: 1823/4036 cut-off events. [2025-02-06 18:29:45,366 INFO L125 PetriNetUnfolderBase]: For 832/960 co-relation queries the response was YES. [2025-02-06 18:29:45,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7759 conditions, 4036 events. 1823/4036 cut-off events. For 832/960 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 26310 event pairs, 263 based on Foata normal form. 0/3590 useless extension candidates. Maximal degree in co-relation 7752. Up to 2417 conditions per place. [2025-02-06 18:29:45,387 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 88 selfloop transitions, 9 changer transitions 0/127 dead transitions. [2025-02-06 18:29:45,388 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 127 transitions, 558 flow [2025-02-06 18:29:45,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:29:45,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:29:45,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2025-02-06 18:29:45,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2025-02-06 18:29:45,389 INFO L175 Difference]: Start difference. First operand has 78 places, 77 transitions, 188 flow. Second operand 6 states and 303 transitions. [2025-02-06 18:29:45,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 127 transitions, 558 flow [2025-02-06 18:29:45,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 127 transitions, 548 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:45,392 INFO L231 Difference]: Finished difference. Result has 83 places, 79 transitions, 220 flow [2025-02-06 18:29:45,392 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=184, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=83, PETRI_TRANSITIONS=79} [2025-02-06 18:29:45,392 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 6 predicate places. [2025-02-06 18:29:45,393 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 79 transitions, 220 flow [2025-02-06 18:29:45,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:45,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:45,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] [2025-02-06 18:29:45,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 18:29:45,393 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:45,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:45,394 INFO L85 PathProgramCache]: Analyzing trace with hash 992093941, now seen corresponding path program 1 times [2025-02-06 18:29:45,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:45,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157366033] [2025-02-06 18:29:45,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:45,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:45,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:29:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:29:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:45,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:46,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:46,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157366033] [2025-02-06 18:29:46,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157366033] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:46,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:46,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:46,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794986655] [2025-02-06 18:29:46,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:46,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:46,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:46,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:46,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-02-06 18:29:46,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 79 transitions, 220 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:46,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:46,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-02-06 18:29:46,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:47,839 INFO L124 PetriNetUnfolderBase]: 2417/5007 cut-off events. [2025-02-06 18:29:47,839 INFO L125 PetriNetUnfolderBase]: For 1219/1379 co-relation queries the response was YES. [2025-02-06 18:29:47,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10434 conditions, 5007 events. 2417/5007 cut-off events. For 1219/1379 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 32847 event pairs, 444 based on Foata normal form. 22/4553 useless extension candidates. Maximal degree in co-relation 10426. Up to 2624 conditions per place. [2025-02-06 18:29:47,868 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 137 selfloop transitions, 8 changer transitions 0/171 dead transitions. [2025-02-06 18:29:47,869 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 171 transitions, 815 flow [2025-02-06 18:29:47,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:29:47,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:29:47,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 378 transitions. [2025-02-06 18:29:47,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5060240963855421 [2025-02-06 18:29:47,872 INFO L175 Difference]: Start difference. First operand has 83 places, 79 transitions, 220 flow. Second operand 9 states and 378 transitions. [2025-02-06 18:29:47,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 171 transitions, 815 flow [2025-02-06 18:29:47,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 171 transitions, 803 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:47,877 INFO L231 Difference]: Finished difference. Result has 90 places, 82 transitions, 245 flow [2025-02-06 18:29:47,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=245, PETRI_PLACES=90, PETRI_TRANSITIONS=82} [2025-02-06 18:29:47,878 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-02-06 18:29:47,879 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 82 transitions, 245 flow [2025-02-06 18:29:47,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:47,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:47,880 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 18:29:47,880 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:47,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:47,880 INFO L85 PathProgramCache]: Analyzing trace with hash -2143017277, now seen corresponding path program 1 times [2025-02-06 18:29:47,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:47,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629897968] [2025-02-06 18:29:47,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:47,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:47,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:29:47,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:29:47,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:47,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:48,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:48,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629897968] [2025-02-06 18:29:48,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629897968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:29:48,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [234599565] [2025-02-06 18:29:48,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:48,113 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:29:48,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 18:29:48,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-02-06 18:29:48,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-02-06 18:29:48,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:48,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:48,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1762 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 18:29:48,398 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:29:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:48,464 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:29:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [234599565] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:48,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:29:48,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-02-06 18:29:48,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364813526] [2025-02-06 18:29:48,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:48,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 18:29:48,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:48,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 18:29:48,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:48,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2025-02-06 18:29:48,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 82 transitions, 245 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:48,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:48,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2025-02-06 18:29:48,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:49,196 INFO L124 PetriNetUnfolderBase]: 1958/4225 cut-off events. [2025-02-06 18:29:49,196 INFO L125 PetriNetUnfolderBase]: For 1252/1322 co-relation queries the response was YES. [2025-02-06 18:29:49,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8970 conditions, 4225 events. 1958/4225 cut-off events. For 1252/1322 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 27960 event pairs, 120 based on Foata normal form. 87/4003 useless extension candidates. Maximal degree in co-relation 8960. Up to 1289 conditions per place. [2025-02-06 18:29:49,219 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 181 selfloop transitions, 5 changer transitions 0/215 dead transitions. [2025-02-06 18:29:49,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 215 transitions, 1037 flow [2025-02-06 18:29:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:29:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:29:49,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 367 transitions. [2025-02-06 18:29:49,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7369477911646586 [2025-02-06 18:29:49,221 INFO L175 Difference]: Start difference. First operand has 90 places, 82 transitions, 245 flow. Second operand 6 states and 367 transitions. [2025-02-06 18:29:49,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 215 transitions, 1037 flow [2025-02-06 18:29:49,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 215 transitions, 1001 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:49,227 INFO L231 Difference]: Finished difference. Result has 90 places, 81 transitions, 243 flow [2025-02-06 18:29:49,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=90, PETRI_TRANSITIONS=81} [2025-02-06 18:29:49,227 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-02-06 18:29:49,227 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 81 transitions, 243 flow [2025-02-06 18:29:49,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:49,228 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:49,228 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:49,237 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 18:29:49,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:49,432 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:49,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash 690143348, now seen corresponding path program 1 times [2025-02-06 18:29:49,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:49,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715975686] [2025-02-06 18:29:49,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:49,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:49,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:29:49,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:29:49,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:49,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:51,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715975686] [2025-02-06 18:29:51,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715975686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:51,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:51,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151676955] [2025-02-06 18:29:51,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:51,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:51,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:51,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:51,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:51,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 83 [2025-02-06 18:29:51,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 81 transitions, 243 flow. Second operand has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:51,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:51,473 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 83 [2025-02-06 18:29:51,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:52,243 INFO L124 PetriNetUnfolderBase]: 2385/4933 cut-off events. [2025-02-06 18:29:52,243 INFO L125 PetriNetUnfolderBase]: For 2620/2696 co-relation queries the response was YES. [2025-02-06 18:29:52,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11034 conditions, 4933 events. 2385/4933 cut-off events. For 2620/2696 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 32350 event pairs, 444 based on Foata normal form. 22/4550 useless extension candidates. Maximal degree in co-relation 11023. Up to 2624 conditions per place. [2025-02-06 18:29:52,270 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 136 selfloop transitions, 8 changer transitions 0/169 dead transitions. [2025-02-06 18:29:52,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 169 transitions, 896 flow [2025-02-06 18:29:52,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:29:52,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:29:52,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 377 transitions. [2025-02-06 18:29:52,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5046854082998661 [2025-02-06 18:29:52,277 INFO L175 Difference]: Start difference. First operand has 90 places, 81 transitions, 243 flow. Second operand 9 states and 377 transitions. [2025-02-06 18:29:52,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 169 transitions, 896 flow [2025-02-06 18:29:52,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 169 transitions, 853 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 18:29:52,281 INFO L231 Difference]: Finished difference. Result has 94 places, 80 transitions, 247 flow [2025-02-06 18:29:52,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=247, PETRI_PLACES=94, PETRI_TRANSITIONS=80} [2025-02-06 18:29:52,283 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 17 predicate places. [2025-02-06 18:29:52,283 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 80 transitions, 247 flow [2025-02-06 18:29:52,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 30.0) internal successors, (240), 8 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:52,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:52,284 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:52,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 18:29:52,284 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:52,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:52,284 INFO L85 PathProgramCache]: Analyzing trace with hash -2009023864, now seen corresponding path program 1 times [2025-02-06 18:29:52,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:52,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806215350] [2025-02-06 18:29:52,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:52,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:52,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-06 18:29:52,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-06 18:29:52,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:52,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:52,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:29:52,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:52,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806215350] [2025-02-06 18:29:52,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806215350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:52,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:52,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:52,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424673754] [2025-02-06 18:29:52,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:52,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:52,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:52,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:52,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:52,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-02-06 18:29:52,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 80 transitions, 247 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:52,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:52,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-02-06 18:29:52,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:52,844 INFO L124 PetriNetUnfolderBase]: 2102/4426 cut-off events. [2025-02-06 18:29:52,844 INFO L125 PetriNetUnfolderBase]: For 1803/1847 co-relation queries the response was YES. [2025-02-06 18:29:52,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9696 conditions, 4426 events. 2102/4426 cut-off events. For 1803/1847 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 28879 event pairs, 394 based on Foata normal form. 87/4256 useless extension candidates. Maximal degree in co-relation 9685. Up to 2113 conditions per place. [2025-02-06 18:29:52,863 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 103 selfloop transitions, 6 changer transitions 6/142 dead transitions. [2025-02-06 18:29:52,863 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 142 transitions, 679 flow [2025-02-06 18:29:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:52,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 232 transitions. [2025-02-06 18:29:52,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6987951807228916 [2025-02-06 18:29:52,864 INFO L175 Difference]: Start difference. First operand has 94 places, 80 transitions, 247 flow. Second operand 4 states and 232 transitions. [2025-02-06 18:29:52,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 142 transitions, 679 flow [2025-02-06 18:29:52,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 142 transitions, 641 flow, removed 1 selfloop flow, removed 7 redundant places. [2025-02-06 18:29:52,869 INFO L231 Difference]: Finished difference. Result has 90 places, 78 transitions, 243 flow [2025-02-06 18:29:52,870 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=243, PETRI_PLACES=90, PETRI_TRANSITIONS=78} [2025-02-06 18:29:52,870 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 13 predicate places. [2025-02-06 18:29:52,870 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 78 transitions, 243 flow [2025-02-06 18:29:52,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:52,871 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:52,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:52,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 18:29:52,871 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:52,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:52,871 INFO L85 PathProgramCache]: Analyzing trace with hash -80421192, now seen corresponding path program 1 times [2025-02-06 18:29:52,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:52,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738987137] [2025-02-06 18:29:52,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:52,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:52,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 18:29:52,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 18:29:52,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:52,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:52,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738987137] [2025-02-06 18:29:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738987137] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:52,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:52,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:52,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896986832] [2025-02-06 18:29:52,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:52,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:52,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:52,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:52,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:52,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:52,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 78 transitions, 243 flow. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:52,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:52,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:52,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:53,592 INFO L124 PetriNetUnfolderBase]: 2969/6064 cut-off events. [2025-02-06 18:29:53,592 INFO L125 PetriNetUnfolderBase]: For 3940/3950 co-relation queries the response was YES. [2025-02-06 18:29:53,602 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14003 conditions, 6064 events. 2969/6064 cut-off events. For 3940/3950 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 41810 event pairs, 1613 based on Foata normal form. 144/5904 useless extension candidates. Maximal degree in co-relation 13992. Up to 3799 conditions per place. [2025-02-06 18:29:53,615 INFO L140 encePairwiseOnDemand]: 75/83 looper letters, 96 selfloop transitions, 3 changer transitions 0/124 dead transitions. [2025-02-06 18:29:53,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 124 transitions, 625 flow [2025-02-06 18:29:53,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:53,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 219 transitions. [2025-02-06 18:29:53,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6596385542168675 [2025-02-06 18:29:53,616 INFO L175 Difference]: Start difference. First operand has 90 places, 78 transitions, 243 flow. Second operand 4 states and 219 transitions. [2025-02-06 18:29:53,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 124 transitions, 625 flow [2025-02-06 18:29:53,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 124 transitions, 603 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:29:53,620 INFO L231 Difference]: Finished difference. Result has 92 places, 80 transitions, 263 flow [2025-02-06 18:29:53,620 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=263, PETRI_PLACES=92, PETRI_TRANSITIONS=80} [2025-02-06 18:29:53,620 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 15 predicate places. [2025-02-06 18:29:53,620 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 80 transitions, 263 flow [2025-02-06 18:29:53,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:53,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:53,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:53,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 18:29:53,621 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:53,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:53,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1802867898, now seen corresponding path program 1 times [2025-02-06 18:29:53,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:53,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993248259] [2025-02-06 18:29:53,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:53,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:53,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-06 18:29:53,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-06 18:29:53,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:53,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:54,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:54,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993248259] [2025-02-06 18:29:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993248259] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:54,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185302251] [2025-02-06 18:29:54,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:54,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:54,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:54,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:54,400 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:54,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 80 transitions, 263 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:54,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:54,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:54,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:55,203 INFO L124 PetriNetUnfolderBase]: 2889/6035 cut-off events. [2025-02-06 18:29:55,203 INFO L125 PetriNetUnfolderBase]: For 2846/2912 co-relation queries the response was YES. [2025-02-06 18:29:55,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14215 conditions, 6035 events. 2889/6035 cut-off events. For 2846/2912 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 42210 event pairs, 484 based on Foata normal form. 44/5813 useless extension candidates. Maximal degree in co-relation 14201. Up to 2574 conditions per place. [2025-02-06 18:29:55,227 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 147 selfloop transitions, 15 changer transitions 2/191 dead transitions. [2025-02-06 18:29:55,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 191 transitions, 1027 flow [2025-02-06 18:29:55,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:29:55,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:29:55,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 461 transitions. [2025-02-06 18:29:55,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.555421686746988 [2025-02-06 18:29:55,229 INFO L175 Difference]: Start difference. First operand has 92 places, 80 transitions, 263 flow. Second operand 10 states and 461 transitions. [2025-02-06 18:29:55,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 191 transitions, 1027 flow [2025-02-06 18:29:55,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 191 transitions, 1024 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 18:29:55,235 INFO L231 Difference]: Finished difference. Result has 103 places, 85 transitions, 334 flow [2025-02-06 18:29:55,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=334, PETRI_PLACES=103, PETRI_TRANSITIONS=85} [2025-02-06 18:29:55,236 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 26 predicate places. [2025-02-06 18:29:55,236 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 85 transitions, 334 flow [2025-02-06 18:29:55,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:55,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:55,236 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:55,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 18:29:55,236 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:55,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash 54332250, now seen corresponding path program 1 times [2025-02-06 18:29:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:55,237 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980998207] [2025-02-06 18:29:55,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:55,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:55,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 18:29:55,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 18:29:55,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:55,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:55,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:55,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:55,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980998207] [2025-02-06 18:29:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980998207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:29:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461002518] [2025-02-06 18:29:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:55,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:55,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:55,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:55,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:55,922 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:55,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 85 transitions, 334 flow. Second operand has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:55,922 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:55,922 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:55,922 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:56,650 INFO L124 PetriNetUnfolderBase]: 2825/5929 cut-off events. [2025-02-06 18:29:56,650 INFO L125 PetriNetUnfolderBase]: For 3970/4036 co-relation queries the response was YES. [2025-02-06 18:29:56,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15039 conditions, 5929 events. 2825/5929 cut-off events. For 3970/4036 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 41419 event pairs, 518 based on Foata normal form. 44/5811 useless extension candidates. Maximal degree in co-relation 15023. Up to 2837 conditions per place. [2025-02-06 18:29:56,671 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 131 selfloop transitions, 13 changer transitions 2/173 dead transitions. [2025-02-06 18:29:56,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 173 transitions, 978 flow [2025-02-06 18:29:56,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:29:56,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:29:56,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2025-02-06 18:29:56,672 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5528781793842035 [2025-02-06 18:29:56,672 INFO L175 Difference]: Start difference. First operand has 103 places, 85 transitions, 334 flow. Second operand 9 states and 413 transitions. [2025-02-06 18:29:56,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 173 transitions, 978 flow [2025-02-06 18:29:56,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 173 transitions, 966 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:29:56,680 INFO L231 Difference]: Finished difference. Result has 106 places, 84 transitions, 344 flow [2025-02-06 18:29:56,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=344, PETRI_PLACES=106, PETRI_TRANSITIONS=84} [2025-02-06 18:29:56,681 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 29 predicate places. [2025-02-06 18:29:56,681 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 84 transitions, 344 flow [2025-02-06 18:29:56,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 34.25) internal successors, (274), 8 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:56,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:56,681 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:56,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 18:29:56,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:56,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:56,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1731141011, now seen corresponding path program 1 times [2025-02-06 18:29:56,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:56,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728241910] [2025-02-06 18:29:56,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:56,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:56,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:29:56,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:29:56,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:56,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:56,804 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:56,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728241910] [2025-02-06 18:29:56,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728241910] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:29:56,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [788910459] [2025-02-06 18:29:56,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:56,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:56,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:29:56,807 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:29:56,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 18:29:56,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-02-06 18:29:57,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-02-06 18:29:57,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:57,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:57,012 INFO L256 TraceCheckSpWp]: Trace formula consists of 1820 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 18:29:57,013 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:29:57,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:57,038 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:29:57,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [788910459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:57,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:29:57,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2025-02-06 18:29:57,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80894688] [2025-02-06 18:29:57,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:57,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 18:29:57,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:57,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 18:29:57,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:29:57,051 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-02-06 18:29:57,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 84 transitions, 344 flow. Second operand has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:57,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:57,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-02-06 18:29:57,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:57,476 INFO L124 PetriNetUnfolderBase]: 3112/6123 cut-off events. [2025-02-06 18:29:57,476 INFO L125 PetriNetUnfolderBase]: For 4392/4426 co-relation queries the response was YES. [2025-02-06 18:29:57,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16067 conditions, 6123 events. 3112/6123 cut-off events. For 4392/4426 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 40781 event pairs, 692 based on Foata normal form. 150/6027 useless extension candidates. Maximal degree in co-relation 16050. Up to 3380 conditions per place. [2025-02-06 18:29:57,505 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 81 selfloop transitions, 5 changer transitions 0/110 dead transitions. [2025-02-06 18:29:57,505 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 110 transitions, 618 flow [2025-02-06 18:29:57,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:57,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2025-02-06 18:29:57,506 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5843373493975904 [2025-02-06 18:29:57,506 INFO L175 Difference]: Start difference. First operand has 106 places, 84 transitions, 344 flow. Second operand 4 states and 194 transitions. [2025-02-06 18:29:57,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 110 transitions, 618 flow [2025-02-06 18:29:57,515 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 110 transitions, 598 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 18:29:57,516 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 326 flow [2025-02-06 18:29:57,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2025-02-06 18:29:57,516 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 23 predicate places. [2025-02-06 18:29:57,517 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 326 flow [2025-02-06 18:29:57,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:57,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:57,517 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:57,526 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 18:29:57,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:29:57,718 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:57,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:57,718 INFO L85 PathProgramCache]: Analyzing trace with hash -2125761534, now seen corresponding path program 1 times [2025-02-06 18:29:57,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:57,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965820394] [2025-02-06 18:29:57,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:57,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:57,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-06 18:29:57,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-06 18:29:57,746 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:57,746 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:57,817 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:29:57,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:57,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965820394] [2025-02-06 18:29:57,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965820394] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:57,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403815529] [2025-02-06 18:29:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:57,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 18:29:57,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:57,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 18:29:57,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 18:29:57,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2025-02-06 18:29:57,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 326 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:57,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:57,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2025-02-06 18:29:57,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:58,344 INFO L124 PetriNetUnfolderBase]: 2756/5657 cut-off events. [2025-02-06 18:29:58,344 INFO L125 PetriNetUnfolderBase]: For 4259/4279 co-relation queries the response was YES. [2025-02-06 18:29:58,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14718 conditions, 5657 events. 2756/5657 cut-off events. For 4259/4279 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 38134 event pairs, 736 based on Foata normal form. 150/5667 useless extension candidates. Maximal degree in co-relation 14701. Up to 2857 conditions per place. [2025-02-06 18:29:58,373 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 85 selfloop transitions, 6 changer transitions 0/115 dead transitions. [2025-02-06 18:29:58,373 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 115 transitions, 632 flow [2025-02-06 18:29:58,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 18:29:58,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-06 18:29:58,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 199 transitions. [2025-02-06 18:29:58,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5993975903614458 [2025-02-06 18:29:58,374 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 326 flow. Second operand 4 states and 199 transitions. [2025-02-06 18:29:58,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 115 transitions, 632 flow [2025-02-06 18:29:58,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 115 transitions, 622 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 18:29:58,384 INFO L231 Difference]: Finished difference. Result has 99 places, 81 transitions, 328 flow [2025-02-06 18:29:58,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=328, PETRI_PLACES=99, PETRI_TRANSITIONS=81} [2025-02-06 18:29:58,385 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 22 predicate places. [2025-02-06 18:29:58,385 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 81 transitions, 328 flow [2025-02-06 18:29:58,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:58,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:58,385 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:29:58,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 18:29:58,385 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:58,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:58,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1488322251, now seen corresponding path program 1 times [2025-02-06 18:29:58,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:58,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672148498] [2025-02-06 18:29:58,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:58,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:58,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-06 18:29:58,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-06 18:29:58,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:58,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672148498] [2025-02-06 18:29:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672148498] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:29:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883847148] [2025-02-06 18:29:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:58,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:29:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:58,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:29:58,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:29:58,523 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-02-06 18:29:58,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 81 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:58,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:58,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-02-06 18:29:58,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:29:58,796 INFO L124 PetriNetUnfolderBase]: 1742/3959 cut-off events. [2025-02-06 18:29:58,796 INFO L125 PetriNetUnfolderBase]: For 3964/3964 co-relation queries the response was YES. [2025-02-06 18:29:58,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10637 conditions, 3959 events. 1742/3959 cut-off events. For 3964/3964 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 25916 event pairs, 514 based on Foata normal form. 168/4049 useless extension candidates. Maximal degree in co-relation 10620. Up to 1962 conditions per place. [2025-02-06 18:29:58,811 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 64 selfloop transitions, 6 changer transitions 0/96 dead transitions. [2025-02-06 18:29:58,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 535 flow [2025-02-06 18:29:58,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:29:58,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:29:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-06 18:29:58,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-02-06 18:29:58,812 INFO L175 Difference]: Start difference. First operand has 99 places, 81 transitions, 328 flow. Second operand 3 states and 165 transitions. [2025-02-06 18:29:58,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 535 flow [2025-02-06 18:29:58,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 96 transitions, 516 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-02-06 18:29:58,818 INFO L231 Difference]: Finished difference. Result has 99 places, 79 transitions, 310 flow [2025-02-06 18:29:58,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=99, PETRI_TRANSITIONS=79} [2025-02-06 18:29:58,818 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 22 predicate places. [2025-02-06 18:29:58,818 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 79 transitions, 310 flow [2025-02-06 18:29:58,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:58,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:29:58,819 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:29:58,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 18:29:58,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:29:58,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:29:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash -2081050219, now seen corresponding path program 1 times [2025-02-06 18:29:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:29:58,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809355891] [2025-02-06 18:29:58,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:29:58,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:29:58,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-02-06 18:29:58,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-02-06 18:29:58,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:29:58,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:29:59,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:29:59,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:29:59,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809355891] [2025-02-06 18:29:59,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809355891] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:29:59,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:29:59,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:29:59,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207712102] [2025-02-06 18:29:59,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:29:59,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:29:59,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:29:59,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:29:59,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:29:59,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:29:59,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 79 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:29:59,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:29:59,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:29:59,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:00,183 INFO L124 PetriNetUnfolderBase]: 1776/3898 cut-off events. [2025-02-06 18:30:00,184 INFO L125 PetriNetUnfolderBase]: For 3454/3456 co-relation queries the response was YES. [2025-02-06 18:30:00,190 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10657 conditions, 3898 events. 1776/3898 cut-off events. For 3454/3456 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 24559 event pairs, 316 based on Foata normal form. 36/3842 useless extension candidates. Maximal degree in co-relation 10639. Up to 1804 conditions per place. [2025-02-06 18:30:00,197 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 109 selfloop transitions, 9 changer transitions 2/144 dead transitions. [2025-02-06 18:30:00,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 144 transitions, 843 flow [2025-02-06 18:30:00,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:30:00,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:30:00,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 356 transitions. [2025-02-06 18:30:00,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.536144578313253 [2025-02-06 18:30:00,198 INFO L175 Difference]: Start difference. First operand has 99 places, 79 transitions, 310 flow. Second operand 8 states and 356 transitions. [2025-02-06 18:30:00,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 144 transitions, 843 flow [2025-02-06 18:30:00,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 144 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:30:00,205 INFO L231 Difference]: Finished difference. Result has 104 places, 78 transitions, 311 flow [2025-02-06 18:30:00,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=293, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=311, PETRI_PLACES=104, PETRI_TRANSITIONS=78} [2025-02-06 18:30:00,205 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 27 predicate places. [2025-02-06 18:30:00,205 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 78 transitions, 311 flow [2025-02-06 18:30:00,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.125) internal successors, (281), 8 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:00,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:00,205 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:30:00,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 18:30:00,206 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:00,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:00,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1254290162, now seen corresponding path program 1 times [2025-02-06 18:30:00,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:00,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421664744] [2025-02-06 18:30:00,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:00,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:00,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:30:00,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:30:00,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:00,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:01,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:01,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:01,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421664744] [2025-02-06 18:30:01,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421664744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:01,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:01,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:30:01,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846960572] [2025-02-06 18:30:01,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:01,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:30:01,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:01,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:30:01,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:30:01,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-02-06 18:30:01,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 78 transitions, 311 flow. Second operand has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:01,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:01,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-02-06 18:30:01,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:02,100 INFO L124 PetriNetUnfolderBase]: 2162/4620 cut-off events. [2025-02-06 18:30:02,100 INFO L125 PetriNetUnfolderBase]: For 4212/4214 co-relation queries the response was YES. [2025-02-06 18:30:02,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12508 conditions, 4620 events. 2162/4620 cut-off events. For 4212/4214 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 29261 event pairs, 213 based on Foata normal form. 0/4488 useless extension candidates. Maximal degree in co-relation 12489. Up to 1544 conditions per place. [2025-02-06 18:30:02,118 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 146 selfloop transitions, 12 changer transitions 2/181 dead transitions. [2025-02-06 18:30:02,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 181 transitions, 1074 flow [2025-02-06 18:30:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:30:02,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:30:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 454 transitions. [2025-02-06 18:30:02,120 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49726177437020813 [2025-02-06 18:30:02,120 INFO L175 Difference]: Start difference. First operand has 104 places, 78 transitions, 311 flow. Second operand 11 states and 454 transitions. [2025-02-06 18:30:02,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 181 transitions, 1074 flow [2025-02-06 18:30:02,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 181 transitions, 1058 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 18:30:02,126 INFO L231 Difference]: Finished difference. Result has 111 places, 82 transitions, 349 flow [2025-02-06 18:30:02,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=349, PETRI_PLACES=111, PETRI_TRANSITIONS=82} [2025-02-06 18:30:02,127 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 34 predicate places. [2025-02-06 18:30:02,127 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 82 transitions, 349 flow [2025-02-06 18:30:02,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 31.7) internal successors, (317), 10 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:02,127 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:02,127 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:02,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 18:30:02,127 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:02,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:02,128 INFO L85 PathProgramCache]: Analyzing trace with hash 635254112, now seen corresponding path program 1 times [2025-02-06 18:30:02,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:02,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001649574] [2025-02-06 18:30:02,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:02,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:02,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 18:30:02,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 18:30:02,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:02,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:02,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001649574] [2025-02-06 18:30:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001649574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 18:30:02,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829575384] [2025-02-06 18:30:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:02,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 18:30:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:02,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 18:30:02,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 18:30:02,242 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2025-02-06 18:30:02,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 82 transitions, 349 flow. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:02,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:02,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2025-02-06 18:30:02,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:02,643 INFO L124 PetriNetUnfolderBase]: 1680/3801 cut-off events. [2025-02-06 18:30:02,643 INFO L125 PetriNetUnfolderBase]: For 3823/3829 co-relation queries the response was YES. [2025-02-06 18:30:02,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10276 conditions, 3801 events. 1680/3801 cut-off events. For 3823/3829 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23457 event pairs, 1011 based on Foata normal form. 30/3743 useless extension candidates. Maximal degree in co-relation 10255. Up to 1854 conditions per place. [2025-02-06 18:30:02,658 INFO L140 encePairwiseOnDemand]: 80/83 looper letters, 70 selfloop transitions, 2 changer transitions 0/99 dead transitions. [2025-02-06 18:30:02,658 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 99 transitions, 563 flow [2025-02-06 18:30:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 18:30:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 18:30:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2025-02-06 18:30:02,659 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6626506024096386 [2025-02-06 18:30:02,659 INFO L175 Difference]: Start difference. First operand has 111 places, 82 transitions, 349 flow. Second operand 3 states and 165 transitions. [2025-02-06 18:30:02,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 99 transitions, 563 flow [2025-02-06 18:30:02,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 99 transitions, 548 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-02-06 18:30:02,666 INFO L231 Difference]: Finished difference. Result has 108 places, 80 transitions, 330 flow [2025-02-06 18:30:02,666 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=330, PETRI_PLACES=108, PETRI_TRANSITIONS=80} [2025-02-06 18:30:02,666 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 31 predicate places. [2025-02-06 18:30:02,666 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 80 transitions, 330 flow [2025-02-06 18:30:02,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:02,666 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:02,666 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:30:02,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 18:30:02,667 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:02,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:02,667 INFO L85 PathProgramCache]: Analyzing trace with hash 647448155, now seen corresponding path program 1 times [2025-02-06 18:30:02,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:02,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460149786] [2025-02-06 18:30:02,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:02,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:02,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-02-06 18:30:02,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-02-06 18:30:02,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:02,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:05,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:05,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460149786] [2025-02-06 18:30:05,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460149786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 18:30:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014600121] [2025-02-06 18:30:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:05,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:30:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:05,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:30:05,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:30:05,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 83 [2025-02-06 18:30:05,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 80 transitions, 330 flow. Second operand has 11 states, 11 states have (on average 28.454545454545453) internal successors, (313), 11 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:05,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:05,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 83 [2025-02-06 18:30:05,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:05,913 INFO L124 PetriNetUnfolderBase]: 1764/3824 cut-off events. [2025-02-06 18:30:05,914 INFO L125 PetriNetUnfolderBase]: For 3590/3590 co-relation queries the response was YES. [2025-02-06 18:30:05,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10483 conditions, 3824 events. 1764/3824 cut-off events. For 3590/3590 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 22916 event pairs, 381 based on Foata normal form. 35/3785 useless extension candidates. Maximal degree in co-relation 10460. Up to 1596 conditions per place. [2025-02-06 18:30:05,930 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 126 selfloop transitions, 13 changer transitions 10/170 dead transitions. [2025-02-06 18:30:05,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 170 transitions, 1032 flow [2025-02-06 18:30:05,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:30:05,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 18:30:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 435 transitions. [2025-02-06 18:30:05,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4367469879518072 [2025-02-06 18:30:05,931 INFO L175 Difference]: Start difference. First operand has 108 places, 80 transitions, 330 flow. Second operand 12 states and 435 transitions. [2025-02-06 18:30:05,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 170 transitions, 1032 flow [2025-02-06 18:30:05,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 170 transitions, 1028 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 18:30:05,939 INFO L231 Difference]: Finished difference. Result has 116 places, 79 transitions, 350 flow [2025-02-06 18:30:05,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=116, PETRI_TRANSITIONS=79} [2025-02-06 18:30:05,940 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 39 predicate places. [2025-02-06 18:30:05,940 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 79 transitions, 350 flow [2025-02-06 18:30:05,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 28.454545454545453) internal successors, (313), 11 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:05,940 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:05,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:05,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 18:30:05,941 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:05,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:05,941 INFO L85 PathProgramCache]: Analyzing trace with hash 345004121, now seen corresponding path program 1 times [2025-02-06 18:30:05,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:05,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215430214] [2025-02-06 18:30:05,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:05,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:05,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-02-06 18:30:06,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-02-06 18:30:06,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:06,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:07,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:07,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:07,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215430214] [2025-02-06 18:30:07,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215430214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:07,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:07,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 18:30:07,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665243133] [2025-02-06 18:30:07,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:07,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:30:07,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:07,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:30:07,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:30:07,666 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-02-06 18:30:07,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 79 transitions, 350 flow. Second operand has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:07,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:07,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-02-06 18:30:07,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:08,361 INFO L124 PetriNetUnfolderBase]: 1808/3873 cut-off events. [2025-02-06 18:30:08,361 INFO L125 PetriNetUnfolderBase]: For 4042/4044 co-relation queries the response was YES. [2025-02-06 18:30:08,371 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10815 conditions, 3873 events. 1808/3873 cut-off events. For 4042/4044 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 22745 event pairs, 265 based on Foata normal form. 26/3833 useless extension candidates. Maximal degree in co-relation 10792. Up to 972 conditions per place. [2025-02-06 18:30:08,380 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 136 selfloop transitions, 13 changer transitions 16/187 dead transitions. [2025-02-06 18:30:08,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 187 transitions, 1150 flow [2025-02-06 18:30:08,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:30:08,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 18:30:08,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 498 transitions. [2025-02-06 18:30:08,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-02-06 18:30:08,382 INFO L175 Difference]: Start difference. First operand has 116 places, 79 transitions, 350 flow. Second operand 12 states and 498 transitions. [2025-02-06 18:30:08,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 187 transitions, 1150 flow [2025-02-06 18:30:08,389 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 187 transitions, 1129 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-06 18:30:08,391 INFO L231 Difference]: Finished difference. Result has 120 places, 83 transitions, 384 flow [2025-02-06 18:30:08,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=384, PETRI_PLACES=120, PETRI_TRANSITIONS=83} [2025-02-06 18:30:08,391 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 43 predicate places. [2025-02-06 18:30:08,392 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 83 transitions, 384 flow [2025-02-06 18:30:08,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 32.9) internal successors, (329), 10 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:08,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:08,392 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:08,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 18:30:08,392 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting t1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:08,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:08,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1788655832, now seen corresponding path program 1 times [2025-02-06 18:30:08,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:08,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610425536] [2025-02-06 18:30:08,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:08,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:08,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 18:30:08,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 18:30:08,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:08,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:09,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:09,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:09,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610425536] [2025-02-06 18:30:09,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610425536] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:09,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:09,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 18:30:09,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369193848] [2025-02-06 18:30:09,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:09,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 18:30:09,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:09,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 18:30:09,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-06 18:30:09,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-02-06 18:30:09,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 83 transitions, 384 flow. Second operand has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:09,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:09,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-02-06 18:30:09,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:09,644 INFO L124 PetriNetUnfolderBase]: 2048/4307 cut-off events. [2025-02-06 18:30:09,644 INFO L125 PetriNetUnfolderBase]: For 4624/4624 co-relation queries the response was YES. [2025-02-06 18:30:09,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12374 conditions, 4307 events. 2048/4307 cut-off events. For 4624/4624 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 25536 event pairs, 424 based on Foata normal form. 12/4290 useless extension candidates. Maximal degree in co-relation 12348. Up to 1823 conditions per place. [2025-02-06 18:30:09,664 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 111 selfloop transitions, 20 changer transitions 1/151 dead transitions. [2025-02-06 18:30:09,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 151 transitions, 946 flow [2025-02-06 18:30:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 18:30:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 18:30:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 350 transitions. [2025-02-06 18:30:09,666 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4685408299866131 [2025-02-06 18:30:09,666 INFO L175 Difference]: Start difference. First operand has 120 places, 83 transitions, 384 flow. Second operand 9 states and 350 transitions. [2025-02-06 18:30:09,666 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 151 transitions, 946 flow [2025-02-06 18:30:09,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 151 transitions, 919 flow, removed 0 selfloop flow, removed 10 redundant places. [2025-02-06 18:30:09,674 INFO L231 Difference]: Finished difference. Result has 117 places, 86 transitions, 420 flow [2025-02-06 18:30:09,674 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=351, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=420, PETRI_PLACES=117, PETRI_TRANSITIONS=86} [2025-02-06 18:30:09,675 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 40 predicate places. [2025-02-06 18:30:09,675 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 86 transitions, 420 flow [2025-02-06 18:30:09,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 32.42857142857143) internal successors, (227), 7 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:09,675 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:09,675 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:09,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 18:30:09,675 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:09,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:09,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1114650849, now seen corresponding path program 1 times [2025-02-06 18:30:09,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:09,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959320011] [2025-02-06 18:30:09,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:09,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:09,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-06 18:30:09,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-06 18:30:09,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:09,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:11,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:11,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959320011] [2025-02-06 18:30:11,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959320011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:11,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:11,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:30:11,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766811225] [2025-02-06 18:30:11,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:11,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:30:11,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:11,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:30:11,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-02-06 18:30:11,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:30:11,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 86 transitions, 420 flow. Second operand has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:11,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:11,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:30:11,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:11,997 INFO L124 PetriNetUnfolderBase]: 1894/4120 cut-off events. [2025-02-06 18:30:11,998 INFO L125 PetriNetUnfolderBase]: For 4670/4670 co-relation queries the response was YES. [2025-02-06 18:30:12,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11714 conditions, 4120 events. 1894/4120 cut-off events. For 4670/4670 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 24488 event pairs, 332 based on Foata normal form. 26/4111 useless extension candidates. Maximal degree in co-relation 11689. Up to 1179 conditions per place. [2025-02-06 18:30:12,017 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 138 selfloop transitions, 13 changer transitions 15/191 dead transitions. [2025-02-06 18:30:12,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 191 transitions, 1218 flow [2025-02-06 18:30:12,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 18:30:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-02-06 18:30:12,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 519 transitions. [2025-02-06 18:30:12,018 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5210843373493976 [2025-02-06 18:30:12,018 INFO L175 Difference]: Start difference. First operand has 117 places, 86 transitions, 420 flow. Second operand 12 states and 519 transitions. [2025-02-06 18:30:12,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 191 transitions, 1218 flow [2025-02-06 18:30:12,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 191 transitions, 1198 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-06 18:30:12,027 INFO L231 Difference]: Finished difference. Result has 124 places, 85 transitions, 422 flow [2025-02-06 18:30:12,027 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=422, PETRI_PLACES=124, PETRI_TRANSITIONS=85} [2025-02-06 18:30:12,028 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 47 predicate places. [2025-02-06 18:30:12,028 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 85 transitions, 422 flow [2025-02-06 18:30:12,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.09090909090909) internal successors, (386), 11 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:12,028 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:12,028 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:12,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 18:30:12,028 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:12,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:12,028 INFO L85 PathProgramCache]: Analyzing trace with hash 582155299, now seen corresponding path program 1 times [2025-02-06 18:30:12,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:12,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449954602] [2025-02-06 18:30:12,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:12,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:12,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:30:12,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:30:12,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:12,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:13,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:13,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:13,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449954602] [2025-02-06 18:30:13,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449954602] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:13,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109584430] [2025-02-06 18:30:13,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:13,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:13,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:13,742 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:30:13,744 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:30:13,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-06 18:30:13,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-06 18:30:13,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:13,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:13,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 1973 conjuncts, 72 conjuncts are in the unsatisfiable core [2025-02-06 18:30:14,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:14,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2025-02-06 18:30:14,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:14,189 INFO L349 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2025-02-06 18:30:14,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 36 [2025-02-06 18:30:14,242 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 30 treesize of output 14 [2025-02-06 18:30:14,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:30:14,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 32 [2025-02-06 18:30:14,494 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:14,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 47 [2025-02-06 18:30:14,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:30:14,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 30 [2025-02-06 18:30:14,620 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 52 treesize of output 42 [2025-02-06 18:30:14,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:30:14,624 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 52 treesize of output 28 [2025-02-06 18:30:14,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:14,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:30:14,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109584430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:14,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:30:14,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12] total 24 [2025-02-06 18:30:14,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260006868] [2025-02-06 18:30:14,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:14,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 18:30:14,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:14,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 18:30:14,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=562, Unknown=0, NotChecked=0, Total=650 [2025-02-06 18:30:14,679 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 83 [2025-02-06 18:30:14,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 85 transitions, 422 flow. Second operand has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:14,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:14,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 83 [2025-02-06 18:30:14,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:15,575 INFO L124 PetriNetUnfolderBase]: 1855/4073 cut-off events. [2025-02-06 18:30:15,575 INFO L125 PetriNetUnfolderBase]: For 4828/4828 co-relation queries the response was YES. [2025-02-06 18:30:15,587 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11739 conditions, 4073 events. 1855/4073 cut-off events. For 4828/4828 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 24466 event pairs, 206 based on Foata normal form. 12/4056 useless extension candidates. Maximal degree in co-relation 11715. Up to 1670 conditions per place. [2025-02-06 18:30:15,595 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 100 selfloop transitions, 26 changer transitions 3/153 dead transitions. [2025-02-06 18:30:15,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 153 transitions, 984 flow [2025-02-06 18:30:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 18:30:15,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-06 18:30:15,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 369 transitions. [2025-02-06 18:30:15,596 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.44457831325301206 [2025-02-06 18:30:15,596 INFO L175 Difference]: Start difference. First operand has 124 places, 85 transitions, 422 flow. Second operand 10 states and 369 transitions. [2025-02-06 18:30:15,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 153 transitions, 984 flow [2025-02-06 18:30:15,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 153 transitions, 956 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-06 18:30:15,605 INFO L231 Difference]: Finished difference. Result has 119 places, 84 transitions, 442 flow [2025-02-06 18:30:15,605 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=442, PETRI_PLACES=119, PETRI_TRANSITIONS=84} [2025-02-06 18:30:15,606 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 42 predicate places. [2025-02-06 18:30:15,606 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 84 transitions, 442 flow [2025-02-06 18:30:15,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.4) internal successors, (441), 15 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:15,607 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:15,607 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:15,616 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 18:30:15,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:15,808 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:15,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:15,808 INFO L85 PathProgramCache]: Analyzing trace with hash 453609329, now seen corresponding path program 1 times [2025-02-06 18:30:15,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:15,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667437054] [2025-02-06 18:30:15,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:15,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:15,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-02-06 18:30:15,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-02-06 18:30:15,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:15,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:16,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:16,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:16,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667437054] [2025-02-06 18:30:16,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667437054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:16,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:16,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:30:16,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266667370] [2025-02-06 18:30:16,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:16,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 18:30:16,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:16,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 18:30:16,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 18:30:16,772 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2025-02-06 18:30:16,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 84 transitions, 442 flow. Second operand has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:16,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:16,773 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2025-02-06 18:30:16,773 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:17,316 INFO L124 PetriNetUnfolderBase]: 1929/4181 cut-off events. [2025-02-06 18:30:17,316 INFO L125 PetriNetUnfolderBase]: For 4973/4973 co-relation queries the response was YES. [2025-02-06 18:30:17,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12213 conditions, 4181 events. 1929/4181 cut-off events. For 4973/4973 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24879 event pairs, 1084 based on Foata normal form. 12/4154 useless extension candidates. Maximal degree in co-relation 12190. Up to 2130 conditions per place. [2025-02-06 18:30:17,333 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 67 selfloop transitions, 19 changer transitions 0/108 dead transitions. [2025-02-06 18:30:17,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 108 transitions, 723 flow [2025-02-06 18:30:17,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:30:17,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:30:17,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 244 transitions. [2025-02-06 18:30:17,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4899598393574297 [2025-02-06 18:30:17,334 INFO L175 Difference]: Start difference. First operand has 119 places, 84 transitions, 442 flow. Second operand 6 states and 244 transitions. [2025-02-06 18:30:17,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 108 transitions, 723 flow [2025-02-06 18:30:17,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 108 transitions, 675 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-02-06 18:30:17,341 INFO L231 Difference]: Finished difference. Result has 114 places, 83 transitions, 428 flow [2025-02-06 18:30:17,341 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=114, PETRI_TRANSITIONS=83} [2025-02-06 18:30:17,341 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 37 predicate places. [2025-02-06 18:30:17,341 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 83 transitions, 428 flow [2025-02-06 18:30:17,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 35.0) internal successors, (280), 8 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:17,342 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:17,342 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:17,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 18:30:17,342 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:17,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:17,342 INFO L85 PathProgramCache]: Analyzing trace with hash -529057409, now seen corresponding path program 1 times [2025-02-06 18:30:17,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:17,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617615758] [2025-02-06 18:30:17,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:17,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:17,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 18:30:17,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 18:30:17,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:17,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:19,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:19,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617615758] [2025-02-06 18:30:19,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617615758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:19,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:19,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 18:30:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271256220] [2025-02-06 18:30:19,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:19,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:30:19,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:19,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:30:19,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:30:19,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:30:19,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 83 transitions, 428 flow. Second operand has 12 states, 12 states have (on average 35.166666666666664) internal successors, (422), 12 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:19,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:19,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:30:19,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:19,900 INFO L124 PetriNetUnfolderBase]: 2000/4353 cut-off events. [2025-02-06 18:30:19,900 INFO L125 PetriNetUnfolderBase]: For 5636/5636 co-relation queries the response was YES. [2025-02-06 18:30:19,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12465 conditions, 4353 events. 2000/4353 cut-off events. For 5636/5636 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 25589 event pairs, 309 based on Foata normal form. 12/4322 useless extension candidates. Maximal degree in co-relation 12444. Up to 881 conditions per place. [2025-02-06 18:30:19,925 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 142 selfloop transitions, 17 changer transitions 14/197 dead transitions. [2025-02-06 18:30:19,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 197 transitions, 1289 flow [2025-02-06 18:30:19,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-06 18:30:19,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-02-06 18:30:19,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 560 transitions. [2025-02-06 18:30:19,927 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5189990732159406 [2025-02-06 18:30:19,927 INFO L175 Difference]: Start difference. First operand has 114 places, 83 transitions, 428 flow. Second operand 13 states and 560 transitions. [2025-02-06 18:30:19,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 197 transitions, 1289 flow [2025-02-06 18:30:19,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 197 transitions, 1245 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 18:30:19,936 INFO L231 Difference]: Finished difference. Result has 126 places, 88 transitions, 479 flow [2025-02-06 18:30:19,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=479, PETRI_PLACES=126, PETRI_TRANSITIONS=88} [2025-02-06 18:30:19,937 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 49 predicate places. [2025-02-06 18:30:19,937 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 88 transitions, 479 flow [2025-02-06 18:30:19,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.166666666666664) internal successors, (422), 12 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:19,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:19,937 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:19,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 18:30:19,937 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:19,938 INFO L85 PathProgramCache]: Analyzing trace with hash 868919190, now seen corresponding path program 1 times [2025-02-06 18:30:19,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:19,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307978298] [2025-02-06 18:30:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:19,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 18:30:20,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 18:30:20,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:20,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:21,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:21,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307978298] [2025-02-06 18:30:21,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307978298] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:21,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892637684] [2025-02-06 18:30:21,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:21,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:21,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:21,584 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:30:21,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 18:30:21,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 18:30:21,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 18:30:21,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:21,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:21,861 INFO L256 TraceCheckSpWp]: Trace formula consists of 2037 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-02-06 18:30:21,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:21,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 18:30:21,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2025-02-06 18:30:22,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:30:22,026 INFO L349 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2025-02-06 18:30:22,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 58 [2025-02-06 18:30:22,153 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:22,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-06 18:30:22,154 INFO L173 IndexEqualityManager]: detected equality via solver [2025-02-06 18:30:22,156 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 36 [2025-02-06 18:30:22,193 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:30:22,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 27 [2025-02-06 18:30:22,240 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 18:30:22,240 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 30 treesize of output 12 [2025-02-06 18:30:22,255 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-06 18:30:22,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 18:30:22,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892637684] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:22,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 18:30:22,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 20 [2025-02-06 18:30:22,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062558412] [2025-02-06 18:30:22,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:22,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 18:30:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:22,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 18:30:22,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=360, Unknown=0, NotChecked=0, Total=420 [2025-02-06 18:30:22,301 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-02-06 18:30:22,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 88 transitions, 479 flow. Second operand has 11 states, 11 states have (on average 37.18181818181818) internal successors, (409), 11 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:22,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:22,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-02-06 18:30:22,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:23,139 INFO L124 PetriNetUnfolderBase]: 2020/4365 cut-off events. [2025-02-06 18:30:23,139 INFO L125 PetriNetUnfolderBase]: For 5968/5968 co-relation queries the response was YES. [2025-02-06 18:30:23,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12717 conditions, 4365 events. 2020/4365 cut-off events. For 5968/5968 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 25672 event pairs, 298 based on Foata normal form. 9/4343 useless extension candidates. Maximal degree in co-relation 12692. Up to 1830 conditions per place. [2025-02-06 18:30:23,160 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 119 selfloop transitions, 25 changer transitions 1/166 dead transitions. [2025-02-06 18:30:23,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 166 transitions, 1106 flow [2025-02-06 18:30:23,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 18:30:23,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 18:30:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 477 transitions. [2025-02-06 18:30:23,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5224534501642936 [2025-02-06 18:30:23,161 INFO L175 Difference]: Start difference. First operand has 126 places, 88 transitions, 479 flow. Second operand 11 states and 477 transitions. [2025-02-06 18:30:23,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 166 transitions, 1106 flow [2025-02-06 18:30:23,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 166 transitions, 1090 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-02-06 18:30:23,171 INFO L231 Difference]: Finished difference. Result has 130 places, 88 transitions, 517 flow [2025-02-06 18:30:23,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=463, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=517, PETRI_PLACES=130, PETRI_TRANSITIONS=88} [2025-02-06 18:30:23,171 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 53 predicate places. [2025-02-06 18:30:23,171 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 88 transitions, 517 flow [2025-02-06 18:30:23,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.18181818181818) internal successors, (409), 11 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:23,171 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:23,171 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:23,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 18:30:23,372 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,SelfDestructingSolverStorable26 [2025-02-06 18:30:23,372 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting t2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:23,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:23,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1337487845, now seen corresponding path program 1 times [2025-02-06 18:30:23,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:23,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001810925] [2025-02-06 18:30:23,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:23,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:23,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-02-06 18:30:23,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-02-06 18:30:23,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:23,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001810925] [2025-02-06 18:30:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001810925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:24,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 18:30:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277346552] [2025-02-06 18:30:24,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:24,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 18:30:24,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:24,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 18:30:24,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-02-06 18:30:24,236 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 83 [2025-02-06 18:30:24,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 88 transitions, 517 flow. Second operand has 10 states, 10 states have (on average 33.7) internal successors, (337), 10 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:24,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:24,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 83 [2025-02-06 18:30:24,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:24,826 INFO L124 PetriNetUnfolderBase]: 2026/4365 cut-off events. [2025-02-06 18:30:24,826 INFO L125 PetriNetUnfolderBase]: For 6426/6426 co-relation queries the response was YES. [2025-02-06 18:30:24,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12888 conditions, 4365 events. 2026/4365 cut-off events. For 6426/6426 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 25617 event pairs, 917 based on Foata normal form. 9/4317 useless extension candidates. Maximal degree in co-relation 12861. Up to 1798 conditions per place. [2025-02-06 18:30:24,846 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 92 selfloop transitions, 21 changer transitions 1/135 dead transitions. [2025-02-06 18:30:24,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 135 transitions, 953 flow [2025-02-06 18:30:24,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 18:30:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-02-06 18:30:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 312 transitions. [2025-02-06 18:30:24,847 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.46987951807228917 [2025-02-06 18:30:24,847 INFO L175 Difference]: Start difference. First operand has 130 places, 88 transitions, 517 flow. Second operand 8 states and 312 transitions. [2025-02-06 18:30:24,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 135 transitions, 953 flow [2025-02-06 18:30:24,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 135 transitions, 910 flow, removed 2 selfloop flow, removed 9 redundant places. [2025-02-06 18:30:24,857 INFO L231 Difference]: Finished difference. Result has 127 places, 87 transitions, 510 flow [2025-02-06 18:30:24,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=510, PETRI_PLACES=127, PETRI_TRANSITIONS=87} [2025-02-06 18:30:24,858 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 50 predicate places. [2025-02-06 18:30:24,858 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 87 transitions, 510 flow [2025-02-06 18:30:24,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 33.7) internal successors, (337), 10 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:24,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:24,858 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:24,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 18:30:24,858 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:24,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:24,859 INFO L85 PathProgramCache]: Analyzing trace with hash 757821511, now seen corresponding path program 1 times [2025-02-06 18:30:24,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:24,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181784586] [2025-02-06 18:30:24,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:24,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:24,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 18:30:24,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 18:30:24,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:24,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:26,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:26,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:26,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181784586] [2025-02-06 18:30:26,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181784586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:26,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:26,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 18:30:26,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269281420] [2025-02-06 18:30:26,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:26,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 18:30:26,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:26,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 18:30:26,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2025-02-06 18:30:26,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2025-02-06 18:30:26,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 87 transitions, 510 flow. Second operand has 12 states, 12 states have (on average 35.833333333333336) internal successors, (430), 12 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:26,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:26,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2025-02-06 18:30:26,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:27,252 INFO L124 PetriNetUnfolderBase]: 1938/4229 cut-off events. [2025-02-06 18:30:27,252 INFO L125 PetriNetUnfolderBase]: For 6535/6535 co-relation queries the response was YES. [2025-02-06 18:30:27,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12440 conditions, 4229 events. 1938/4229 cut-off events. For 6535/6535 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 23932 event pairs, 368 based on Foata normal form. 12/4200 useless extension candidates. Maximal degree in co-relation 12415. Up to 881 conditions per place. [2025-02-06 18:30:27,275 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 152 selfloop transitions, 17 changer transitions 15/207 dead transitions. [2025-02-06 18:30:27,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 207 transitions, 1404 flow [2025-02-06 18:30:27,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 18:30:27,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-06 18:30:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 600 transitions. [2025-02-06 18:30:27,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5163511187607573 [2025-02-06 18:30:27,277 INFO L175 Difference]: Start difference. First operand has 127 places, 87 transitions, 510 flow. Second operand 14 states and 600 transitions. [2025-02-06 18:30:27,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 207 transitions, 1404 flow [2025-02-06 18:30:27,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 207 transitions, 1356 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 18:30:27,287 INFO L231 Difference]: Finished difference. Result has 132 places, 86 transitions, 485 flow [2025-02-06 18:30:27,287 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=485, PETRI_PLACES=132, PETRI_TRANSITIONS=86} [2025-02-06 18:30:27,288 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 55 predicate places. [2025-02-06 18:30:27,288 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 86 transitions, 485 flow [2025-02-06 18:30:27,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 35.833333333333336) internal successors, (430), 12 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:27,288 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:27,288 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:27,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 18:30:27,288 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting t2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:27,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:27,289 INFO L85 PathProgramCache]: Analyzing trace with hash -904263168, now seen corresponding path program 1 times [2025-02-06 18:30:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:27,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140304595] [2025-02-06 18:30:27,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:27,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-06 18:30:27,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-06 18:30:27,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:27,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140304595] [2025-02-06 18:30:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140304595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 18:30:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 18:30:28,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-06 18:30:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509054333] [2025-02-06 18:30:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 18:30:28,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 18:30:28,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 18:30:28,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 18:30:28,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 18:30:28,177 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2025-02-06 18:30:28,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 86 transitions, 485 flow. Second operand has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:28,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 18:30:28,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2025-02-06 18:30:28,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 18:30:28,684 INFO L124 PetriNetUnfolderBase]: 1959/4295 cut-off events. [2025-02-06 18:30:28,684 INFO L125 PetriNetUnfolderBase]: For 6285/6285 co-relation queries the response was YES. [2025-02-06 18:30:28,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12685 conditions, 4295 events. 1959/4295 cut-off events. For 6285/6285 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24551 event pairs, 1122 based on Foata normal form. 9/4256 useless extension candidates. Maximal degree in co-relation 12660. Up to 2202 conditions per place. [2025-02-06 18:30:28,703 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 71 selfloop transitions, 17 changer transitions 0/109 dead transitions. [2025-02-06 18:30:28,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 109 transitions, 768 flow [2025-02-06 18:30:28,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 18:30:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 18:30:28,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 260 transitions. [2025-02-06 18:30:28,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5220883534136547 [2025-02-06 18:30:28,704 INFO L175 Difference]: Start difference. First operand has 132 places, 86 transitions, 485 flow. Second operand 6 states and 260 transitions. [2025-02-06 18:30:28,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 109 transitions, 768 flow [2025-02-06 18:30:28,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 109 transitions, 736 flow, removed 0 selfloop flow, removed 12 redundant places. [2025-02-06 18:30:28,715 INFO L231 Difference]: Finished difference. Result has 124 places, 86 transitions, 491 flow [2025-02-06 18:30:28,715 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=449, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=491, PETRI_PLACES=124, PETRI_TRANSITIONS=86} [2025-02-06 18:30:28,716 INFO L279 CegarLoopForPetriNet]: 77 programPoint places, 47 predicate places. [2025-02-06 18:30:28,716 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 86 transitions, 491 flow [2025-02-06 18:30:28,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.44444444444444) internal successors, (346), 9 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 18:30:28,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 18:30:28,716 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 18:30:28,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 18:30:28,716 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting t2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 36 more)] === [2025-02-06 18:30:28,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 18:30:28,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1858902868, now seen corresponding path program 1 times [2025-02-06 18:30:28,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 18:30:28,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461193185] [2025-02-06 18:30:28,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:28,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 18:30:28,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 18:30:28,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 18:30:28,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:28,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:31,165 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:31,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 18:30:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461193185] [2025-02-06 18:30:31,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461193185] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 18:30:31,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330279558] [2025-02-06 18:30:31,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 18:30:31,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 18:30:31,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 18:30:31,168 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 18:30:31,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 18:30:31,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 18:30:31,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 18:30:31,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 18:30:31,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 18:30:31,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 2056 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-02-06 18:30:31,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 18:30:31,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2025-02-06 18:30:31,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-02-06 18:30:31,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 24 [2025-02-06 18:30:31,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 18:30:31,681 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-02-06 18:30:31,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-02-06 18:30:31,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 18:30:31,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2025-02-06 18:30:31,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 18:30:31,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 18:30:31,999 INFO L349 Elim1Store]: treesize reduction 44, result has 25.4 percent of original size [2025-02-06 18:30:32,000 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 39 [2025-02-06 18:30:32,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-02-06 18:30:32,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-02-06 18:30:32,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-02-06 18:30:32,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-02-06 18:30:32,135 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 18:30:32,136 INFO L312 TraceCheckSpWp]: Computing backward predicates...