./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:55:04,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:55:04,199 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-01-10 06:55:04,203 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:55:04,203 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:55:04,217 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:55:04,218 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:55:04,218 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:55:04,218 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:55:04,218 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:55:04,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:55:04,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:55:04,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:55:04,219 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:55:04,219 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:55:04,219 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:55:04,219 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:55:04,219 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:55:04,220 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:55:04,221 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:55:04,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:55:04,221 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:55:04,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:55:04,222 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:55:04,222 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 -> 39e987e3198040ef6af9e29359b0ab7bee89306d1945f6e4e7a9286ebbe2a705 [2025-01-10 06:55:04,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:55:04,465 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:55:04,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:55:04,468 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:55:04,468 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:55:04,469 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-01-10 06:55:05,708 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7a7580d3/ad464e04f6164ca48c7ef24864b9eb66/FLAG202b189e3 [2025-01-10 06:55:06,004 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:55:06,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sorted.wvr.c [2025-01-10 06:55:06,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7a7580d3/ad464e04f6164ca48c7ef24864b9eb66/FLAG202b189e3 [2025-01-10 06:55:06,285 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e7a7580d3/ad464e04f6164ca48c7ef24864b9eb66 [2025-01-10 06:55:06,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:55:06,289 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:55:06,290 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:55:06,290 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:55:06,293 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:55:06,294 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1349cec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06, skipping insertion in model container [2025-01-10 06:55:06,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,316 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:55:06,467 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:55:06,473 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:55:06,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:55:06,496 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:55:06,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06 WrapperNode [2025-01-10 06:55:06,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:55:06,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:55:06,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:55:06,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:55:06,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,506 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,528 INFO L138 Inliner]: procedures = 23, calls = 23, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 91 [2025-01-10 06:55:06,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:55:06,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:55:06,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:55:06,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:55:06,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,563 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-01-10 06:55:06,566 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,575 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,585 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:55:06,588 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:55:06,588 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:55:06,588 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:55:06,589 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (1/1) ... [2025-01-10 06:55:06,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:55:06,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:06,624 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-01-10 06:55:06,634 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-01-10 06:55:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:55:06,653 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:55:06,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:55:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:55:06,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:55:06,654 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:55:06,654 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:55:06,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:55:06,655 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:55:06,656 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-10 06:55:06,737 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:55:06,740 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:55:06,934 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:55:06,934 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:55:07,076 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:55:07,077 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-10 06:55:07,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:55:07 BoogieIcfgContainer [2025-01-10 06:55:07,077 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:55:07,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:55:07,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:55:07,082 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:55:07,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:55:06" (1/3) ... [2025-01-10 06:55:07,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ea49b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:55:07, skipping insertion in model container [2025-01-10 06:55:07,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:55:06" (2/3) ... [2025-01-10 06:55:07,083 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21ea49b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:55:07, skipping insertion in model container [2025-01-10 06:55:07,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:55:07" (3/3) ... [2025-01-10 06:55:07,084 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sorted.wvr.c [2025-01-10 06:55:07,093 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:55:07,095 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sorted.wvr.c that has 4 procedures, 66 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-01-10 06:55:07,095 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:55:07,177 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:55:07,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 74 transitions, 169 flow [2025-01-10 06:55:07,254 INFO L124 PetriNetUnfolderBase]: 9/71 cut-off events. [2025-01-10 06:55:07,259 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:55:07,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84 conditions, 71 events. 9/71 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 227 event pairs, 0 based on Foata normal form. 0/44 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2025-01-10 06:55:07,263 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 74 transitions, 169 flow [2025-01-10 06:55:07,267 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 70 places, 69 transitions, 153 flow [2025-01-10 06:55:07,274 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:55:07,297 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;@5f1bb0bd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:55:07,298 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-01-10 06:55:07,300 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:55:07,300 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:55:07,301 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:55:07,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:07,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:55:07,301 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:07,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:07,305 INFO L85 PathProgramCache]: Analyzing trace with hash 460565, now seen corresponding path program 1 times [2025-01-10 06:55:07,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:07,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4039085] [2025-01-10 06:55:07,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:07,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:07,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:55:07,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:55:07,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:07,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:07,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:07,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4039085] [2025-01-10 06:55:07,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4039085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:07,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:07,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:07,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806784714] [2025-01-10 06:55:07,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:07,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:07,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:07,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:07,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:07,571 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:07,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 69 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:07,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:07,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:07,575 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:08,089 INFO L124 PetriNetUnfolderBase]: 2069/4162 cut-off events. [2025-01-10 06:55:08,090 INFO L125 PetriNetUnfolderBase]: For 157/157 co-relation queries the response was YES. [2025-01-10 06:55:08,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7141 conditions, 4162 events. 2069/4162 cut-off events. For 157/157 co-relation queries the response was YES. Maximal size of possible extension queue 283. Compared 32272 event pairs, 1447 based on Foata normal form. 205/3745 useless extension candidates. Maximal degree in co-relation 6725. Up to 2820 conditions per place. [2025-01-10 06:55:08,121 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 34 selfloop transitions, 4 changer transitions 0/70 dead transitions. [2025-01-10 06:55:08,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 70 transitions, 231 flow [2025-01-10 06:55:08,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:08,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 182 transitions. [2025-01-10 06:55:08,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6148648648648649 [2025-01-10 06:55:08,134 INFO L175 Difference]: Start difference. First operand has 70 places, 69 transitions, 153 flow. Second operand 4 states and 182 transitions. [2025-01-10 06:55:08,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 70 transitions, 231 flow [2025-01-10 06:55:08,140 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 70 transitions, 222 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:55:08,144 INFO L231 Difference]: Finished difference. Result has 70 places, 70 transitions, 169 flow [2025-01-10 06:55:08,147 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=169, PETRI_PLACES=70, PETRI_TRANSITIONS=70} [2025-01-10 06:55:08,150 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 0 predicate places. [2025-01-10 06:55:08,151 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 70 transitions, 169 flow [2025-01-10 06:55:08,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:08,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:08,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-01-10 06:55:08,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:55:08,152 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:08,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:08,153 INFO L85 PathProgramCache]: Analyzing trace with hash 442719232, now seen corresponding path program 1 times [2025-01-10 06:55:08,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:08,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012554563] [2025-01-10 06:55:08,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:08,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:08,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-10 06:55:08,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-10 06:55:08,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:08,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:08,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:08,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:08,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012554563] [2025-01-10 06:55:08,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012554563] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:08,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:08,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:08,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114235643] [2025-01-10 06:55:08,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:08,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:08,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:08,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:08,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:08,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-01-10 06:55:08,278 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 70 transitions, 169 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:08,278 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:08,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-01-10 06:55:08,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:08,645 INFO L124 PetriNetUnfolderBase]: 2659/4929 cut-off events. [2025-01-10 06:55:08,645 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2025-01-10 06:55:08,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8682 conditions, 4929 events. 2659/4929 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 36755 event pairs, 1919 based on Foata normal form. 232/4670 useless extension candidates. Maximal degree in co-relation 8654. Up to 3622 conditions per place. [2025-01-10 06:55:08,674 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-01-10 06:55:08,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 241 flow [2025-01-10 06:55:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:08,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2025-01-10 06:55:08,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6126126126126126 [2025-01-10 06:55:08,676 INFO L175 Difference]: Start difference. First operand has 70 places, 70 transitions, 169 flow. Second operand 3 states and 136 transitions. [2025-01-10 06:55:08,676 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 241 flow [2025-01-10 06:55:08,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 68 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:08,678 INFO L231 Difference]: Finished difference. Result has 69 places, 68 transitions, 166 flow [2025-01-10 06:55:08,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=69, PETRI_TRANSITIONS=68} [2025-01-10 06:55:08,679 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -1 predicate places. [2025-01-10 06:55:08,679 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 68 transitions, 166 flow [2025-01-10 06:55:08,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:08,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:08,679 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:55:08,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-10 06:55:08,680 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 836259241, now seen corresponding path program 1 times [2025-01-10 06:55:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022536075] [2025-01-10 06:55:08,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:08,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:08,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:55:08,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:55:08,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:08,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:08,830 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:08,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022536075] [2025-01-10 06:55:08,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022536075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:08,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694706928] [2025-01-10 06:55:08,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:08,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:08,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:08,837 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-01-10 06:55:08,839 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-01-10 06:55:08,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:55:08,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:55:08,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:08,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:08,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:55:08,923 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:08,965 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:08,966 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:55:08,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694706928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:08,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:55:08,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:55:08,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636790833] [2025-01-10 06:55:08,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:08,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:55:08,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:08,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:55:08,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:55:08,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:08,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 68 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:08,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:08,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:08,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:09,344 INFO L124 PetriNetUnfolderBase]: 2069/4062 cut-off events. [2025-01-10 06:55:09,345 INFO L125 PetriNetUnfolderBase]: For 39/39 co-relation queries the response was YES. [2025-01-10 06:55:09,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6994 conditions, 4062 events. 2069/4062 cut-off events. For 39/39 co-relation queries the response was YES. Maximal size of possible extension queue 271. Compared 30706 event pairs, 1447 based on Foata normal form. 1/3542 useless extension candidates. Maximal degree in co-relation 6967. Up to 2815 conditions per place. [2025-01-10 06:55:09,362 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 30 selfloop transitions, 7 changer transitions 0/67 dead transitions. [2025-01-10 06:55:09,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 236 flow [2025-01-10 06:55:09,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:55:09,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:55:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2025-01-10 06:55:09,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5585585585585585 [2025-01-10 06:55:09,364 INFO L175 Difference]: Start difference. First operand has 69 places, 68 transitions, 166 flow. Second operand 6 states and 248 transitions. [2025-01-10 06:55:09,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 236 flow [2025-01-10 06:55:09,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 67 transitions, 234 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:09,365 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 174 flow [2025-01-10 06:55:09,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2025-01-10 06:55:09,366 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 2 predicate places. [2025-01-10 06:55:09,366 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 174 flow [2025-01-10 06:55:09,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 35.833333333333336) internal successors, (215), 6 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,366 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:09,367 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-01-10 06:55:09,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:09,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:09,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:09,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:09,568 INFO L85 PathProgramCache]: Analyzing trace with hash 839394820, now seen corresponding path program 1 times [2025-01-10 06:55:09,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:09,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642862427] [2025-01-10 06:55:09,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:09,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:55:09,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:55:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642862427] [2025-01-10 06:55:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642862427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:09,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:09,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:55:09,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440529944] [2025-01-10 06:55:09,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:09,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:09,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:09,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:09,615 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-01-10 06:55:09,616 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 174 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,616 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:09,616 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-01-10 06:55:09,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:09,840 INFO L124 PetriNetUnfolderBase]: 2069/3963 cut-off events. [2025-01-10 06:55:09,840 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2025-01-10 06:55:09,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6901 conditions, 3963 events. 2069/3963 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 29133 event pairs, 1447 based on Foata normal form. 203/3744 useless extension candidates. Maximal degree in co-relation 6870. Up to 2819 conditions per place. [2025-01-10 06:55:09,862 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 35 selfloop transitions, 1 changer transitions 0/65 dead transitions. [2025-01-10 06:55:09,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 65 transitions, 242 flow [2025-01-10 06:55:09,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:09,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:09,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2025-01-10 06:55:09,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6036036036036037 [2025-01-10 06:55:09,864 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 174 flow. Second operand 3 states and 134 transitions. [2025-01-10 06:55:09,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 65 transitions, 242 flow [2025-01-10 06:55:09,865 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 220 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-01-10 06:55:09,865 INFO L231 Difference]: Finished difference. Result has 67 places, 65 transitions, 150 flow [2025-01-10 06:55:09,866 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=150, PETRI_PLACES=67, PETRI_TRANSITIONS=65} [2025-01-10 06:55:09,866 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, -3 predicate places. [2025-01-10 06:55:09,866 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 65 transitions, 150 flow [2025-01-10 06:55:09,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:09,866 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:09,867 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:55:09,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:55:09,867 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:09,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:09,867 INFO L85 PathProgramCache]: Analyzing trace with hash 154233167, now seen corresponding path program 1 times [2025-01-10 06:55:09,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:09,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574897115] [2025-01-10 06:55:09,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:09,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:55:09,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:55:09,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,936 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:09,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574897115] [2025-01-10 06:55:09,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574897115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:09,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692517228] [2025-01-10 06:55:09,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:09,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:09,938 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-01-10 06:55:09,940 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-01-10 06:55:09,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:55:09,985 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:55:09,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:09,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:09,986 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:55:09,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692517228] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:10,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:10,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:55:10,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770375374] [2025-01-10 06:55:10,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:55:10,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:10,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:55:10,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:55:10,068 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:10,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 65 transitions, 150 flow. Second operand has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:10,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:10,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:10,394 INFO L124 PetriNetUnfolderBase]: 2072/3975 cut-off events. [2025-01-10 06:55:10,395 INFO L125 PetriNetUnfolderBase]: For 53/53 co-relation queries the response was YES. [2025-01-10 06:55:10,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6921 conditions, 3975 events. 2072/3975 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 29247 event pairs, 1447 based on Foata normal form. 3/3553 useless extension candidates. Maximal degree in co-relation 6914. Up to 2822 conditions per place. [2025-01-10 06:55:10,413 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 33 selfloop transitions, 13 changer transitions 0/74 dead transitions. [2025-01-10 06:55:10,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 74 transitions, 275 flow [2025-01-10 06:55:10,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:55:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:55:10,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 399 transitions. [2025-01-10 06:55:10,415 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5391891891891892 [2025-01-10 06:55:10,415 INFO L175 Difference]: Start difference. First operand has 67 places, 65 transitions, 150 flow. Second operand 10 states and 399 transitions. [2025-01-10 06:55:10,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 74 transitions, 275 flow [2025-01-10 06:55:10,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 74 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:10,417 INFO L231 Difference]: Finished difference. Result has 78 places, 74 transitions, 226 flow [2025-01-10 06:55:10,417 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=149, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=226, PETRI_PLACES=78, PETRI_TRANSITIONS=74} [2025-01-10 06:55:10,418 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 8 predicate places. [2025-01-10 06:55:10,418 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 74 transitions, 226 flow [2025-01-10 06:55:10,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 36.083333333333336) internal successors, (433), 12 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:10,418 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:10,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:10,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:10,623 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:10,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:10,624 INFO L85 PathProgramCache]: Analyzing trace with hash 1111999749, now seen corresponding path program 1 times [2025-01-10 06:55:10,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:10,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483519750] [2025-01-10 06:55:10,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:10,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:55:10,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:55:10,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:10,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:10,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:10,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:10,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483519750] [2025-01-10 06:55:10,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483519750] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:10,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:10,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:10,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735184936] [2025-01-10 06:55:10,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:10,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:10,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:10,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:10,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:10,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:10,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 74 transitions, 226 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:10,700 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:10,700 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:10,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:11,252 INFO L124 PetriNetUnfolderBase]: 4337/7683 cut-off events. [2025-01-10 06:55:11,252 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-10 06:55:11,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13773 conditions, 7683 events. 4337/7683 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 336. Compared 54778 event pairs, 1818 based on Foata normal form. 100/6893 useless extension candidates. Maximal degree in co-relation 13762. Up to 3988 conditions per place. [2025-01-10 06:55:11,390 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 69 selfloop transitions, 3 changer transitions 0/99 dead transitions. [2025-01-10 06:55:11,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 99 transitions, 423 flow [2025-01-10 06:55:11,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:11,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2025-01-10 06:55:11,393 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7522522522522522 [2025-01-10 06:55:11,393 INFO L175 Difference]: Start difference. First operand has 78 places, 74 transitions, 226 flow. Second operand 3 states and 167 transitions. [2025-01-10 06:55:11,394 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 99 transitions, 423 flow [2025-01-10 06:55:11,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 99 transitions, 412 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:11,397 INFO L231 Difference]: Finished difference. Result has 79 places, 76 transitions, 236 flow [2025-01-10 06:55:11,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=79, PETRI_TRANSITIONS=76} [2025-01-10 06:55:11,400 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 9 predicate places. [2025-01-10 06:55:11,400 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 76 transitions, 236 flow [2025-01-10 06:55:11,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:11,400 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:11,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:55:11,400 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:11,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:11,401 INFO L85 PathProgramCache]: Analyzing trace with hash 820597128, now seen corresponding path program 1 times [2025-01-10 06:55:11,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:11,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108244171] [2025-01-10 06:55:11,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:11,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:11,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:55:11,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:55:11,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:11,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:11,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:11,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:11,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108244171] [2025-01-10 06:55:11,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108244171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:11,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:11,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:11,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755200913] [2025-01-10 06:55:11,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:11,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:11,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:11,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:11,476 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:11,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:11,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 76 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:11,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:11,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:12,219 INFO L124 PetriNetUnfolderBase]: 7307/12313 cut-off events. [2025-01-10 06:55:12,220 INFO L125 PetriNetUnfolderBase]: For 1460/1460 co-relation queries the response was YES. [2025-01-10 06:55:12,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23779 conditions, 12313 events. 7307/12313 cut-off events. For 1460/1460 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 91748 event pairs, 3351 based on Foata normal form. 199/11145 useless extension candidates. Maximal degree in co-relation 23767. Up to 6461 conditions per place. [2025-01-10 06:55:12,291 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 72 selfloop transitions, 3 changer transitions 0/102 dead transitions. [2025-01-10 06:55:12,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 102 transitions, 454 flow [2025-01-10 06:55:12,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:12,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:12,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 166 transitions. [2025-01-10 06:55:12,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7477477477477478 [2025-01-10 06:55:12,294 INFO L175 Difference]: Start difference. First operand has 79 places, 76 transitions, 236 flow. Second operand 3 states and 166 transitions. [2025-01-10 06:55:12,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 102 transitions, 454 flow [2025-01-10 06:55:12,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 102 transitions, 448 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:12,300 INFO L231 Difference]: Finished difference. Result has 81 places, 78 transitions, 254 flow [2025-01-10 06:55:12,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=81, PETRI_TRANSITIONS=78} [2025-01-10 06:55:12,301 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 11 predicate places. [2025-01-10 06:55:12,303 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 78 transitions, 254 flow [2025-01-10 06:55:12,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:12,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:12,303 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:12,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:55:12,304 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:12,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:12,304 INFO L85 PathProgramCache]: Analyzing trace with hash 112253353, now seen corresponding path program 1 times [2025-01-10 06:55:12,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:12,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913483797] [2025-01-10 06:55:12,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:12,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:12,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:55:12,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:55:12,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:12,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:12,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:12,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:12,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913483797] [2025-01-10 06:55:12,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913483797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:12,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:12,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:55:12,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009617436] [2025-01-10 06:55:12,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:12,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:12,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:12,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:12,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:12,383 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-01-10 06:55:12,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 78 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:12,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:12,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-01-10 06:55:12,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:13,547 INFO L124 PetriNetUnfolderBase]: 8574/14248 cut-off events. [2025-01-10 06:55:13,547 INFO L125 PetriNetUnfolderBase]: For 2827/2827 co-relation queries the response was YES. [2025-01-10 06:55:13,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29218 conditions, 14248 events. 8574/14248 cut-off events. For 2827/2827 co-relation queries the response was YES. Maximal size of possible extension queue 531. Compared 103784 event pairs, 4369 based on Foata normal form. 388/13991 useless extension candidates. Maximal degree in co-relation 29205. Up to 8278 conditions per place. [2025-01-10 06:55:13,607 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 95 selfloop transitions, 4 changer transitions 0/124 dead transitions. [2025-01-10 06:55:13,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 124 transitions, 576 flow [2025-01-10 06:55:13,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:13,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:13,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 215 transitions. [2025-01-10 06:55:13,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7263513513513513 [2025-01-10 06:55:13,609 INFO L175 Difference]: Start difference. First operand has 81 places, 78 transitions, 254 flow. Second operand 4 states and 215 transitions. [2025-01-10 06:55:13,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 124 transitions, 576 flow [2025-01-10 06:55:13,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:13,614 INFO L231 Difference]: Finished difference. Result has 85 places, 79 transitions, 272 flow [2025-01-10 06:55:13,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=251, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=272, PETRI_PLACES=85, PETRI_TRANSITIONS=79} [2025-01-10 06:55:13,614 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 15 predicate places. [2025-01-10 06:55:13,614 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 79 transitions, 272 flow [2025-01-10 06:55:13,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 4 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:13,615 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:13,615 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:13,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:55:13,615 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:13,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash -331293292, now seen corresponding path program 1 times [2025-01-10 06:55:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425292894] [2025-01-10 06:55:13,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:13,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:55:13,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:55:13,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:13,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:13,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:13,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:13,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425292894] [2025-01-10 06:55:13,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425292894] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:13,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:13,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:55:13,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681628721] [2025-01-10 06:55:13,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:13,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:13,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:13,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:13,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:13,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-01-10 06:55:13,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 79 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:13,705 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:13,705 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-01-10 06:55:13,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:14,656 INFO L124 PetriNetUnfolderBase]: 8350/12994 cut-off events. [2025-01-10 06:55:14,656 INFO L125 PetriNetUnfolderBase]: For 5986/5986 co-relation queries the response was YES. [2025-01-10 06:55:14,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29498 conditions, 12994 events. 8350/12994 cut-off events. For 5986/5986 co-relation queries the response was YES. Maximal size of possible extension queue 515. Compared 88037 event pairs, 4150 based on Foata normal form. 398/12991 useless extension candidates. Maximal degree in co-relation 29483. Up to 7878 conditions per place. [2025-01-10 06:55:14,713 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 96 selfloop transitions, 4 changer transitions 0/125 dead transitions. [2025-01-10 06:55:14,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 125 transitions, 620 flow [2025-01-10 06:55:14,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:14,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:14,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 213 transitions. [2025-01-10 06:55:14,715 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7195945945945946 [2025-01-10 06:55:14,716 INFO L175 Difference]: Start difference. First operand has 85 places, 79 transitions, 272 flow. Second operand 4 states and 213 transitions. [2025-01-10 06:55:14,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 125 transitions, 620 flow [2025-01-10 06:55:14,721 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 125 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:14,722 INFO L231 Difference]: Finished difference. Result has 88 places, 80 transitions, 287 flow [2025-01-10 06:55:14,722 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=287, PETRI_PLACES=88, PETRI_TRANSITIONS=80} [2025-01-10 06:55:14,723 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2025-01-10 06:55:14,723 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 80 transitions, 287 flow [2025-01-10 06:55:14,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,723 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:14,723 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:14,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:55:14,724 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:14,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:14,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1215256640, now seen corresponding path program 1 times [2025-01-10 06:55:14,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:14,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892741226] [2025-01-10 06:55:14,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:14,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:14,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:55:14,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:55:14,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:14,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:14,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892741226] [2025-01-10 06:55:14,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892741226] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:14,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:14,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:55:14,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297071721] [2025-01-10 06:55:14,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:14,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:14,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:14,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:14,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:14,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:14,783 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 80 transitions, 287 flow. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:14,783 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:14,783 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:14,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:16,331 INFO L124 PetriNetUnfolderBase]: 12870/21663 cut-off events. [2025-01-10 06:55:16,331 INFO L125 PetriNetUnfolderBase]: For 11529/11529 co-relation queries the response was YES. [2025-01-10 06:55:16,467 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48617 conditions, 21663 events. 12870/21663 cut-off events. For 11529/11529 co-relation queries the response was YES. Maximal size of possible extension queue 747. Compared 169087 event pairs, 5250 based on Foata normal form. 301/20499 useless extension candidates. Maximal degree in co-relation 48600. Up to 10248 conditions per place. [2025-01-10 06:55:16,602 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 74 selfloop transitions, 9 changer transitions 0/110 dead transitions. [2025-01-10 06:55:16,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 110 transitions, 559 flow [2025-01-10 06:55:16,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 200 transitions. [2025-01-10 06:55:16,604 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6756756756756757 [2025-01-10 06:55:16,605 INFO L175 Difference]: Start difference. First operand has 88 places, 80 transitions, 287 flow. Second operand 4 states and 200 transitions. [2025-01-10 06:55:16,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 110 transitions, 559 flow [2025-01-10 06:55:16,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 110 transitions, 547 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:55:16,621 INFO L231 Difference]: Finished difference. Result has 91 places, 83 transitions, 326 flow [2025-01-10 06:55:16,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=281, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=326, PETRI_PLACES=91, PETRI_TRANSITIONS=83} [2025-01-10 06:55:16,622 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 21 predicate places. [2025-01-10 06:55:16,622 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 83 transitions, 326 flow [2025-01-10 06:55:16,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:16,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:16,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:16,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-10 06:55:16,623 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:16,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:16,623 INFO L85 PathProgramCache]: Analyzing trace with hash -981750288, now seen corresponding path program 1 times [2025-01-10 06:55:16,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:16,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189365948] [2025-01-10 06:55:16,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:16,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:16,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:55:16,635 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:55:16,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:16,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:16,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:16,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:16,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189365948] [2025-01-10 06:55:16,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189365948] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:16,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:16,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880955488] [2025-01-10 06:55:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:16,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:55:16,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:16,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:55:16,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:55:16,717 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 74 [2025-01-10 06:55:16,718 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 83 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:16,718 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:16,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 74 [2025-01-10 06:55:16,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:17,697 INFO L124 PetriNetUnfolderBase]: 10820/19691 cut-off events. [2025-01-10 06:55:17,697 INFO L125 PetriNetUnfolderBase]: For 11449/11449 co-relation queries the response was YES. [2025-01-10 06:55:17,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44542 conditions, 19691 events. 10820/19691 cut-off events. For 11449/11449 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 164372 event pairs, 7164 based on Foata normal form. 1/18886 useless extension candidates. Maximal degree in co-relation 44523. Up to 13856 conditions per place. [2025-01-10 06:55:17,839 INFO L140 encePairwiseOnDemand]: 71/74 looper letters, 50 selfloop transitions, 2 changer transitions 0/82 dead transitions. [2025-01-10 06:55:17,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 82 transitions, 423 flow [2025-01-10 06:55:17,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:55:17,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:55:17,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-01-10 06:55:17,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6621621621621622 [2025-01-10 06:55:17,842 INFO L175 Difference]: Start difference. First operand has 91 places, 83 transitions, 326 flow. Second operand 3 states and 147 transitions. [2025-01-10 06:55:17,842 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 82 transitions, 423 flow [2025-01-10 06:55:17,852 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 82 transitions, 419 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:55:17,853 INFO L231 Difference]: Finished difference. Result has 92 places, 82 transitions, 319 flow [2025-01-10 06:55:17,853 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=319, PETRI_PLACES=92, PETRI_TRANSITIONS=82} [2025-01-10 06:55:17,855 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 22 predicate places. [2025-01-10 06:55:17,855 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 82 transitions, 319 flow [2025-01-10 06:55:17,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:17,855 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:17,855 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:55:17,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:55:17,856 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:17,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:17,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1010847331, now seen corresponding path program 2 times [2025-01-10 06:55:17,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:17,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080038065] [2025-01-10 06:55:17,856 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:17,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:17,863 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:55:17,867 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:55:17,867 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:55:17,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:17,900 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:55:17,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080038065] [2025-01-10 06:55:17,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080038065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:17,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [304910431] [2025-01-10 06:55:17,900 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:17,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:17,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:17,905 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-01-10 06:55:17,907 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-01-10 06:55:17,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:55:17,953 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:55:17,953 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:55:17,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:17,954 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:55:17,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:17,975 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:55:17,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:18,002 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:55:18,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [304910431] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:18,002 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:18,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:55:18,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647049806] [2025-01-10 06:55:18,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:18,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:18,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:18,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:18,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:18,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 74 [2025-01-10 06:55:18,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 82 transitions, 319 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-01-10 06:55:18,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:18,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 74 [2025-01-10 06:55:18,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:18,980 INFO L124 PetriNetUnfolderBase]: 10820/19690 cut-off events. [2025-01-10 06:55:18,980 INFO L125 PetriNetUnfolderBase]: For 11450/11450 co-relation queries the response was YES. [2025-01-10 06:55:19,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44539 conditions, 19690 events. 10820/19690 cut-off events. For 11450/11450 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 164341 event pairs, 7164 based on Foata normal form. 1/18885 useless extension candidates. Maximal degree in co-relation 44519. Up to 13847 conditions per place. [2025-01-10 06:55:19,129 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 37 selfloop transitions, 15 changer transitions 0/81 dead transitions. [2025-01-10 06:55:19,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 81 transitions, 413 flow [2025-01-10 06:55:19,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 174 transitions. [2025-01-10 06:55:19,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5878378378378378 [2025-01-10 06:55:19,131 INFO L175 Difference]: Start difference. First operand has 92 places, 82 transitions, 319 flow. Second operand 4 states and 174 transitions. [2025-01-10 06:55:19,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 81 transitions, 413 flow [2025-01-10 06:55:19,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 81 transitions, 399 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-01-10 06:55:19,143 INFO L231 Difference]: Finished difference. Result has 88 places, 81 transitions, 325 flow [2025-01-10 06:55:19,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=325, PETRI_PLACES=88, PETRI_TRANSITIONS=81} [2025-01-10 06:55:19,144 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 18 predicate places. [2025-01-10 06:55:19,144 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 81 transitions, 325 flow [2025-01-10 06:55:19,144 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-01-10 06:55:19,144 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:19,144 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:19,153 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-01-10 06:55:19,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:19,345 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:19,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash 925461015, now seen corresponding path program 1 times [2025-01-10 06:55:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024869415] [2025-01-10 06:55:19,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:19,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:55:19,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:55:19,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:19,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:19,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024869415] [2025-01-10 06:55:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024869415] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:19,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [483998138] [2025-01-10 06:55:19,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:19,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:19,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:19,403 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-01-10 06:55:19,405 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-01-10 06:55:19,445 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:55:19,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:55:19,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:19,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:19,460 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:55:19,461 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:19,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:19,601 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:19,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [483998138] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:19,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:19,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 15 [2025-01-10 06:55:19,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026532698] [2025-01-10 06:55:19,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:19,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-10 06:55:19,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:19,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-10 06:55:19,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-01-10 06:55:19,799 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 74 [2025-01-10 06:55:19,800 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 81 transitions, 325 flow. Second operand has 15 states, 15 states have (on average 29.466666666666665) internal successors, (442), 15 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:19,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:19,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 74 [2025-01-10 06:55:19,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:22,324 INFO L124 PetriNetUnfolderBase]: 23785/36823 cut-off events. [2025-01-10 06:55:22,325 INFO L125 PetriNetUnfolderBase]: For 22101/22101 co-relation queries the response was YES. [2025-01-10 06:55:22,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89641 conditions, 36823 events. 23785/36823 cut-off events. For 22101/22101 co-relation queries the response was YES. Maximal size of possible extension queue 1080. Compared 275158 event pairs, 7197 based on Foata normal form. 648/36818 useless extension candidates. Maximal degree in co-relation 89625. Up to 11839 conditions per place. [2025-01-10 06:55:22,605 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 193 selfloop transitions, 20 changer transitions 0/238 dead transitions. [2025-01-10 06:55:22,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 238 transitions, 1315 flow [2025-01-10 06:55:22,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-10 06:55:22,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-10 06:55:22,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 498 transitions. [2025-01-10 06:55:22,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5608108108108109 [2025-01-10 06:55:22,608 INFO L175 Difference]: Start difference. First operand has 88 places, 81 transitions, 325 flow. Second operand 12 states and 498 transitions. [2025-01-10 06:55:22,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 238 transitions, 1315 flow [2025-01-10 06:55:22,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 238 transitions, 1285 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:55:22,652 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 385 flow [2025-01-10 06:55:22,652 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=385, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2025-01-10 06:55:22,653 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 29 predicate places. [2025-01-10 06:55:22,653 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 385 flow [2025-01-10 06:55:22,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 29.466666666666665) internal successors, (442), 15 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:22,653 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:22,653 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:22,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:22,858 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,SelfDestructingSolverStorable12 [2025-01-10 06:55:22,858 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:22,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:22,859 INFO L85 PathProgramCache]: Analyzing trace with hash -50969892, now seen corresponding path program 1 times [2025-01-10 06:55:22,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:22,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450972469] [2025-01-10 06:55:22,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:22,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:22,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:55:22,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:55:22,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:22,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:22,906 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:22,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:22,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450972469] [2025-01-10 06:55:22,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450972469] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:22,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:22,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:55:22,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200126781] [2025-01-10 06:55:22,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:22,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:55:22,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:22,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:55:22,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:55:22,919 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-01-10 06:55:22,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 385 flow. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:22,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:22,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-01-10 06:55:22,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:25,702 INFO L124 PetriNetUnfolderBase]: 22939/37080 cut-off events. [2025-01-10 06:55:25,703 INFO L125 PetriNetUnfolderBase]: For 37636/37636 co-relation queries the response was YES. [2025-01-10 06:55:25,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95059 conditions, 37080 events. 22939/37080 cut-off events. For 37636/37636 co-relation queries the response was YES. Maximal size of possible extension queue 1072. Compared 289034 event pairs, 2870 based on Foata normal form. 1584/38474 useless extension candidates. Maximal degree in co-relation 95040. Up to 16680 conditions per place. [2025-01-10 06:55:25,960 INFO L140 encePairwiseOnDemand]: 67/74 looper letters, 103 selfloop transitions, 10 changer transitions 0/138 dead transitions. [2025-01-10 06:55:25,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 138 transitions, 873 flow [2025-01-10 06:55:25,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:55:25,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:55:25,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 236 transitions. [2025-01-10 06:55:25,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6378378378378379 [2025-01-10 06:55:25,963 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 385 flow. Second operand 5 states and 236 transitions. [2025-01-10 06:55:25,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 138 transitions, 873 flow [2025-01-10 06:55:26,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 138 transitions, 837 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:55:26,004 INFO L231 Difference]: Finished difference. Result has 95 places, 84 transitions, 377 flow [2025-01-10 06:55:26,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=377, PETRI_PLACES=95, PETRI_TRANSITIONS=84} [2025-01-10 06:55:26,009 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 25 predicate places. [2025-01-10 06:55:26,009 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 84 transitions, 377 flow [2025-01-10 06:55:26,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:26,009 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:26,009 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:55:26,009 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:26,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:26,009 INFO L85 PathProgramCache]: Analyzing trace with hash -50968867, now seen corresponding path program 1 times [2025-01-10 06:55:26,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:26,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577544553] [2025-01-10 06:55:26,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:26,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:55:26,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:55:26,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:26,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:26,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:26,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577544553] [2025-01-10 06:55:26,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577544553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:26,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:26,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:55:26,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897178388] [2025-01-10 06:55:26,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:26,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:55:26,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:26,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:55:26,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:55:26,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 74 [2025-01-10 06:55:26,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 84 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-01-10 06:55:26,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:26,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 74 [2025-01-10 06:55:26,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:28,684 INFO L124 PetriNetUnfolderBase]: 20158/33051 cut-off events. [2025-01-10 06:55:28,685 INFO L125 PetriNetUnfolderBase]: For 36763/36763 co-relation queries the response was YES. [2025-01-10 06:55:28,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86757 conditions, 33051 events. 20158/33051 cut-off events. For 36763/36763 co-relation queries the response was YES. Maximal size of possible extension queue 1015. Compared 259155 event pairs, 6975 based on Foata normal form. 1056/32915 useless extension candidates. Maximal degree in co-relation 86738. Up to 13662 conditions per place. [2025-01-10 06:55:28,951 INFO L140 encePairwiseOnDemand]: 70/74 looper letters, 80 selfloop transitions, 4 changer transitions 0/109 dead transitions. [2025-01-10 06:55:28,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 109 transitions, 662 flow [2025-01-10 06:55:28,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:55:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:55:28,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 172 transitions. [2025-01-10 06:55:28,953 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.581081081081081 [2025-01-10 06:55:28,953 INFO L175 Difference]: Start difference. First operand has 95 places, 84 transitions, 377 flow. Second operand 4 states and 172 transitions. [2025-01-10 06:55:28,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 109 transitions, 662 flow [2025-01-10 06:55:29,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 109 transitions, 628 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-10 06:55:29,010 INFO L231 Difference]: Finished difference. Result has 91 places, 82 transitions, 341 flow [2025-01-10 06:55:29,010 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=341, PETRI_PLACES=91, PETRI_TRANSITIONS=82} [2025-01-10 06:55:29,011 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 21 predicate places. [2025-01-10 06:55:29,011 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 82 transitions, 341 flow [2025-01-10 06:55:29,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 4 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-01-10 06:55:29,011 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:29,011 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:29,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:55:29,012 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:29,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:29,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1580066089, now seen corresponding path program 1 times [2025-01-10 06:55:29,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:29,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30751490] [2025-01-10 06:55:29,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:29,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:29,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:55:29,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:55:29,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:29,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:29,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30751490] [2025-01-10 06:55:29,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30751490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:29,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400477073] [2025-01-10 06:55:29,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:29,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:29,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:29,117 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-01-10 06:55:29,121 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-01-10 06:55:29,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:55:29,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:55:29,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:29,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:29,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-10 06:55:29,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:29,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:29,294 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:29,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:29,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400477073] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:29,390 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:29,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2025-01-10 06:55:29,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695683449] [2025-01-10 06:55:29,391 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:29,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-10 06:55:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:29,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-10 06:55:29,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2025-01-10 06:55:29,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-01-10 06:55:29,644 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 82 transitions, 341 flow. Second operand has 18 states, 18 states have (on average 28.055555555555557) internal successors, (505), 18 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:29,644 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:29,644 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-01-10 06:55:29,645 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:32,786 INFO L124 PetriNetUnfolderBase]: 22838/35187 cut-off events. [2025-01-10 06:55:32,786 INFO L125 PetriNetUnfolderBase]: For 30139/30139 co-relation queries the response was YES. [2025-01-10 06:55:32,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91371 conditions, 35187 events. 22838/35187 cut-off events. For 30139/30139 co-relation queries the response was YES. Maximal size of possible extension queue 1010. Compared 256841 event pairs, 13923 based on Foata normal form. 76/34050 useless extension candidates. Maximal degree in co-relation 91352. Up to 25298 conditions per place. [2025-01-10 06:55:33,024 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 94 selfloop transitions, 16 changer transitions 9/143 dead transitions. [2025-01-10 06:55:33,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 143 transitions, 824 flow [2025-01-10 06:55:33,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-10 06:55:33,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-10 06:55:33,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 324 transitions. [2025-01-10 06:55:33,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4864864864864865 [2025-01-10 06:55:33,026 INFO L175 Difference]: Start difference. First operand has 91 places, 82 transitions, 341 flow. Second operand 9 states and 324 transitions. [2025-01-10 06:55:33,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 143 transitions, 824 flow [2025-01-10 06:55:33,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 143 transitions, 816 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:55:33,059 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 397 flow [2025-01-10 06:55:33,059 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=333, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=397, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2025-01-10 06:55:33,060 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 29 predicate places. [2025-01-10 06:55:33,060 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 397 flow [2025-01-10 06:55:33,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 28.055555555555557) internal successors, (505), 18 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:33,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:33,060 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:33,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:33,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-10 06:55:33,261 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:33,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:33,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1039361002, now seen corresponding path program 1 times [2025-01-10 06:55:33,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:33,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203958016] [2025-01-10 06:55:33,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:33,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:33,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:55:33,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:55:33,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:33,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:33,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:33,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:33,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203958016] [2025-01-10 06:55:33,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203958016] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:33,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678498484] [2025-01-10 06:55:33,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:33,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:33,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:33,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:33,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-10 06:55:33,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:55:33,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:55:33,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:33,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:33,381 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-10 06:55:33,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:33,442 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:33,442 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:33,519 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:55:33,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678498484] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:33,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:33,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 14 [2025-01-10 06:55:33,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784258372] [2025-01-10 06:55:33,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:33,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-10 06:55:33,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:33,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-10 06:55:33,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2025-01-10 06:55:33,754 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-01-10 06:55:33,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 397 flow. Second operand has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:33,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:33,755 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-01-10 06:55:33,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:37,923 INFO L124 PetriNetUnfolderBase]: 36749/57548 cut-off events. [2025-01-10 06:55:37,924 INFO L125 PetriNetUnfolderBase]: For 48914/48914 co-relation queries the response was YES. [2025-01-10 06:55:38,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147066 conditions, 57548 events. 36749/57548 cut-off events. For 48914/48914 co-relation queries the response was YES. Maximal size of possible extension queue 1411. Compared 447770 event pairs, 11548 based on Foata normal form. 470/55731 useless extension candidates. Maximal degree in co-relation 147044. Up to 18865 conditions per place. [2025-01-10 06:55:38,378 INFO L140 encePairwiseOnDemand]: 62/74 looper letters, 235 selfloop transitions, 21 changer transitions 13/290 dead transitions. [2025-01-10 06:55:38,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 290 transitions, 1838 flow [2025-01-10 06:55:38,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-10 06:55:38,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-10 06:55:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 538 transitions. [2025-01-10 06:55:38,381 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5592515592515592 [2025-01-10 06:55:38,381 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 397 flow. Second operand 13 states and 538 transitions. [2025-01-10 06:55:38,381 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 290 transitions, 1838 flow [2025-01-10 06:55:38,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 290 transitions, 1825 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:55:38,455 INFO L231 Difference]: Finished difference. Result has 110 places, 84 transitions, 428 flow [2025-01-10 06:55:38,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=428, PETRI_PLACES=110, PETRI_TRANSITIONS=84} [2025-01-10 06:55:38,458 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 40 predicate places. [2025-01-10 06:55:38,458 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 84 transitions, 428 flow [2025-01-10 06:55:38,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 28.142857142857142) internal successors, (394), 14 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:38,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:38,459 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:38,467 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:38,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 06:55:38,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:38,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:38,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1092593213, now seen corresponding path program 2 times [2025-01-10 06:55:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:38,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584587947] [2025-01-10 06:55:38,661 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:55:38,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:38,677 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-01-10 06:55:38,681 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 14 of 21 statements. [2025-01-10 06:55:38,682 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:55:38,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:38,711 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:55:38,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:38,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584587947] [2025-01-10 06:55:38,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584587947] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:55:38,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:55:38,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:55:38,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994255301] [2025-01-10 06:55:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:55:38,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:55:38,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:38,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:55:38,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:55:38,750 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-01-10 06:55:38,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 84 transitions, 428 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:38,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:38,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-01-10 06:55:38,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:42,578 INFO L124 PetriNetUnfolderBase]: 36086/55394 cut-off events. [2025-01-10 06:55:42,578 INFO L125 PetriNetUnfolderBase]: For 61972/61972 co-relation queries the response was YES. [2025-01-10 06:55:42,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152460 conditions, 55394 events. 36086/55394 cut-off events. For 61972/61972 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 413559 event pairs, 15398 based on Foata normal form. 1592/56483 useless extension candidates. Maximal degree in co-relation 152434. Up to 27599 conditions per place. [2025-01-10 06:55:42,988 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 106 selfloop transitions, 5 changer transitions 3/139 dead transitions. [2025-01-10 06:55:42,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 139 transitions, 950 flow [2025-01-10 06:55:42,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:55:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:55:42,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 203 transitions. [2025-01-10 06:55:42,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5486486486486486 [2025-01-10 06:55:42,989 INFO L175 Difference]: Start difference. First operand has 110 places, 84 transitions, 428 flow. Second operand 5 states and 203 transitions. [2025-01-10 06:55:42,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 139 transitions, 950 flow [2025-01-10 06:55:43,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 139 transitions, 865 flow, removed 14 selfloop flow, removed 13 redundant places. [2025-01-10 06:55:43,328 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 382 flow [2025-01-10 06:55:43,328 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=382, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2025-01-10 06:55:43,329 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 26 predicate places. [2025-01-10 06:55:43,332 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 382 flow [2025-01-10 06:55:43,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:43,333 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:43,333 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:43,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-10 06:55:43,333 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:43,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:43,333 INFO L85 PathProgramCache]: Analyzing trace with hash -888007215, now seen corresponding path program 1 times [2025-01-10 06:55:43,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:43,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769716693] [2025-01-10 06:55:43,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:43,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:43,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:55:43,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:55:43,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:43,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:43,392 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:55:43,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769716693] [2025-01-10 06:55:43,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769716693] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:43,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909292601] [2025-01-10 06:55:43,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:43,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:43,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:43,394 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:43,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:55:43,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:55:43,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:55:43,450 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:43,450 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:43,451 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-10 06:55:43,451 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:43,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:43,605 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:43,791 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:43,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909292601] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:43,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:43,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 24 [2025-01-10 06:55:43,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575204243] [2025-01-10 06:55:43,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:43,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:55:43,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:43,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:55:43,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=476, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:55:44,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 74 [2025-01-10 06:55:44,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 82 transitions, 382 flow. Second operand has 24 states, 24 states have (on average 28.833333333333332) internal successors, (692), 24 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:44,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:44,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 74 [2025-01-10 06:55:44,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:49,725 INFO L124 PetriNetUnfolderBase]: 38981/60163 cut-off events. [2025-01-10 06:55:49,725 INFO L125 PetriNetUnfolderBase]: For 57508/57508 co-relation queries the response was YES. [2025-01-10 06:55:49,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163459 conditions, 60163 events. 38981/60163 cut-off events. For 57508/57508 co-relation queries the response was YES. Maximal size of possible extension queue 1608. Compared 476764 event pairs, 4712 based on Foata normal form. 1968/61427 useless extension candidates. Maximal degree in co-relation 163437. Up to 15338 conditions per place. [2025-01-10 06:55:50,126 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 251 selfloop transitions, 25 changer transitions 20/319 dead transitions. [2025-01-10 06:55:50,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 319 transitions, 1972 flow [2025-01-10 06:55:50,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:55:50,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:55:50,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 682 transitions. [2025-01-10 06:55:50,129 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5421303656597775 [2025-01-10 06:55:50,129 INFO L175 Difference]: Start difference. First operand has 96 places, 82 transitions, 382 flow. Second operand 17 states and 682 transitions. [2025-01-10 06:55:50,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 319 transitions, 1972 flow [2025-01-10 06:55:50,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 319 transitions, 1890 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:55:50,469 INFO L231 Difference]: Finished difference. Result has 106 places, 85 transitions, 450 flow [2025-01-10 06:55:50,469 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=450, PETRI_PLACES=106, PETRI_TRANSITIONS=85} [2025-01-10 06:55:50,469 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 36 predicate places. [2025-01-10 06:55:50,469 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 85 transitions, 450 flow [2025-01-10 06:55:50,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 28.833333333333332) internal successors, (692), 24 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:50,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:50,470 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:50,478 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:55:50,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:50,671 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:50,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:50,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1829549232, now seen corresponding path program 1 times [2025-01-10 06:55:50,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:50,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452212375] [2025-01-10 06:55:50,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:50,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:50,679 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:55:50,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:55:50,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:50,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:50,772 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-10 06:55:50,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452212375] [2025-01-10 06:55:50,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452212375] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:50,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323729343] [2025-01-10 06:55:50,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:50,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:50,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:50,775 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:50,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:55:50,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:55:50,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:55:50,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:50,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:50,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-10 06:55:50,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:50,958 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:51,286 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:55:51,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323729343] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:51,287 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:51,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 10, 10] total 23 [2025-01-10 06:55:51,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745094373] [2025-01-10 06:55:51,287 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:51,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-10 06:55:51,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:51,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-10 06:55:51,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2025-01-10 06:55:51,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 74 [2025-01-10 06:55:51,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 85 transitions, 450 flow. Second operand has 23 states, 23 states have (on average 27.608695652173914) internal successors, (635), 23 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:51,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:51,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 74 [2025-01-10 06:55:51,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:55:56,425 INFO L124 PetriNetUnfolderBase]: 38292/61274 cut-off events. [2025-01-10 06:55:56,425 INFO L125 PetriNetUnfolderBase]: For 81522/81522 co-relation queries the response was YES. [2025-01-10 06:55:56,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 165781 conditions, 61274 events. 38292/61274 cut-off events. For 81522/81522 co-relation queries the response was YES. Maximal size of possible extension queue 1385. Compared 493619 event pairs, 4401 based on Foata normal form. 1646/62614 useless extension candidates. Maximal degree in co-relation 165758. Up to 14732 conditions per place. [2025-01-10 06:55:56,758 INFO L140 encePairwiseOnDemand]: 62/74 looper letters, 214 selfloop transitions, 22 changer transitions 96/350 dead transitions. [2025-01-10 06:55:56,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 350 transitions, 2379 flow [2025-01-10 06:55:56,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-10 06:55:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-10 06:55:56,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 721 transitions. [2025-01-10 06:55:56,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5412912912912913 [2025-01-10 06:55:56,760 INFO L175 Difference]: Start difference. First operand has 106 places, 85 transitions, 450 flow. Second operand 18 states and 721 transitions. [2025-01-10 06:55:56,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 350 transitions, 2379 flow [2025-01-10 06:55:56,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 350 transitions, 2200 flow, removed 29 selfloop flow, removed 9 redundant places. [2025-01-10 06:55:56,935 INFO L231 Difference]: Finished difference. Result has 113 places, 77 transitions, 403 flow [2025-01-10 06:55:56,935 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=399, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=403, PETRI_PLACES=113, PETRI_TRANSITIONS=77} [2025-01-10 06:55:56,936 INFO L279 CegarLoopForPetriNet]: 70 programPoint places, 43 predicate places. [2025-01-10 06:55:56,936 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 77 transitions, 403 flow [2025-01-10 06:55:56,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 27.608695652173914) internal successors, (635), 23 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:56,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:55:56,936 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:55:56,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-10 06:55:57,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:57,137 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 34 more)] === [2025-01-10 06:55:57,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:55:57,137 INFO L85 PathProgramCache]: Analyzing trace with hash 132014950, now seen corresponding path program 1 times [2025-01-10 06:55:57,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:55:57,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184993393] [2025-01-10 06:55:57,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:57,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:55:57,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:55:57,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:55:57,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:57,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:57,201 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:55:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:55:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184993393] [2025-01-10 06:55:57,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184993393] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:55:57,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [357348327] [2025-01-10 06:55:57,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:55:57,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:55:57,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:55:57,207 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:55:57,208 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:55:57,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-10 06:55:57,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-10 06:55:57,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:55:57,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:55:57,263 INFO L256 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:55:57,264 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:55:57,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:55:57,281 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:55:57,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:55:57,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [357348327] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:55:57,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:55:57,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2025-01-10 06:55:57,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761413741] [2025-01-10 06:55:57,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:55:57,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-10 06:55:57,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:55:57,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-10 06:55:57,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-10 06:55:57,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 74 [2025-01-10 06:55:57,317 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 77 transitions, 403 flow. Second operand has 10 states, 10 states have (on average 35.5) internal successors, (355), 10 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:55:57,317 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:55:57,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 74 [2025-01-10 06:55:57,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand