./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.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-bad-commit-1.wvr-bad.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 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:52:32,248 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:52:32,297 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:52:32,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:52:32,301 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:52:32,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:52:32,322 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:52:32,322 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:52:32,323 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:52:32,323 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:52:32,324 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:52:32,324 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:52:32,324 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:52:32,324 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:52:32,325 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:52:32,325 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:52:32,326 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:52:32,326 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:52:32,326 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:52:32,326 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:32,326 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:32,326 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:32,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:32,327 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:52:32,327 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:52:32,328 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:52:32,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:52:32,328 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:52:32,328 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:52:32,328 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:52:32,328 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:52:32,328 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 -> 83c7202603a0719c5812e4d7043f4665de4d954c89c656bd6312ac9e8fdcb494 [2025-01-10 06:52:32,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:52:32,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:52:32,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:52:32,562 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:52:32,562 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:52:32,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-01-10 06:52:33,804 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c584f3be9/de4bcd8baf714d27b53ad02e22a8c56f/FLAG82074bf40 [2025-01-10 06:52:34,041 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:52:34,041 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-commit-1.wvr-bad.c [2025-01-10 06:52:34,051 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c584f3be9/de4bcd8baf714d27b53ad02e22a8c56f/FLAG82074bf40 [2025-01-10 06:52:34,352 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c584f3be9/de4bcd8baf714d27b53ad02e22a8c56f [2025-01-10 06:52:34,354 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:52:34,356 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:52:34,357 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:34,357 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:52:34,361 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:52:34,362 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,363 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cf761fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34, skipping insertion in model container [2025-01-10 06:52:34,363 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,380 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:52:34,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:34,536 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:52:34,567 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:52:34,583 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:52:34,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34 WrapperNode [2025-01-10 06:52:34,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:52:34,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:34,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:52:34,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:52:34,591 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:52:34" (1/1) ... [2025-01-10 06:52:34,597 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:52:34" (1/1) ... [2025-01-10 06:52:34,625 INFO L138 Inliner]: procedures = 24, calls = 54, calls flagged for inlining = 21, calls inlined = 25, statements flattened = 349 [2025-01-10 06:52:34,627 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:52:34,628 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:52:34,631 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:52:34,631 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:52:34,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,642 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,660 INFO L175 MemorySlicer]: Split 13 memory accesses to 2 slices as follows [2, 11]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-10 06:52:34,660 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,660 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,671 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,677 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,680 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,685 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,686 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,688 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:52:34,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:52:34,697 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:52:34,697 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:52:34,698 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (1/1) ... [2025-01-10 06:52:34,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:52:34,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:34,734 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:52:34,748 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:52:34,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:52:34,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:52:34,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-10 06:52:34,766 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-10 06:52:34,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-10 06:52:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:52:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:52:34,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:52:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:52:34,767 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:52:34,768 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:52:34,865 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:52:34,866 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:52:35,294 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:52:35,294 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:52:35,630 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:52:35,631 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-10 06:52:35,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:35 BoogieIcfgContainer [2025-01-10 06:52:35,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:52:35,633 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:52:35,633 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:52:35,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:52:35,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:52:34" (1/3) ... [2025-01-10 06:52:35,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4659e5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:35, skipping insertion in model container [2025-01-10 06:52:35,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:52:34" (2/3) ... [2025-01-10 06:52:35,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4659e5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:52:35, skipping insertion in model container [2025-01-10 06:52:35,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:52:35" (3/3) ... [2025-01-10 06:52:35,639 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-commit-1.wvr-bad.c [2025-01-10 06:52:35,650 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:52:35,652 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-commit-1.wvr-bad.c that has 4 procedures, 71 locations, 1 initial locations, 6 loop locations, and 22 error locations. [2025-01-10 06:52:35,652 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:52:35,733 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-10 06:52:35,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 80 places, 87 transitions, 195 flow [2025-01-10 06:52:35,847 INFO L124 PetriNetUnfolderBase]: 17/84 cut-off events. [2025-01-10 06:52:35,849 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-10 06:52:35,852 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97 conditions, 84 events. 17/84 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 256 event pairs, 0 based on Foata normal form. 0/45 useless extension candidates. Maximal degree in co-relation 67. Up to 6 conditions per place. [2025-01-10 06:52:35,852 INFO L82 GeneralOperation]: Start removeDead. Operand has 80 places, 87 transitions, 195 flow [2025-01-10 06:52:35,854 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 82 transitions, 179 flow [2025-01-10 06:52:35,861 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:52:35,872 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;@3441962, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:52:35,873 INFO L334 AbstractCegarLoop]: Starting to check reachability of 41 error locations. [2025-01-10 06:52:35,876 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:52:35,876 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:52:35,877 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:52:35,877 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:35,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:52:35,877 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:35,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:35,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1064465, now seen corresponding path program 1 times [2025-01-10 06:52:35,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45100619] [2025-01-10 06:52:35,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:35,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:52:35,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:52:35,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:35,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:36,085 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:52:36,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:36,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45100619] [2025-01-10 06:52:36,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45100619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:36,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:36,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:36,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144952365] [2025-01-10 06:52:36,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:36,093 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:36,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:36,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:36,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:36,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-01-10 06:52:36,148 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 82 transitions, 179 flow. Second operand has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:52:36,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:36,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-01-10 06:52:36,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:36,849 INFO L124 PetriNetUnfolderBase]: 3360/4913 cut-off events. [2025-01-10 06:52:36,850 INFO L125 PetriNetUnfolderBase]: For 178/178 co-relation queries the response was YES. [2025-01-10 06:52:36,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9435 conditions, 4913 events. 3360/4913 cut-off events. For 178/178 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 27410 event pairs, 2182 based on Foata normal form. 3/3119 useless extension candidates. Maximal degree in co-relation 8962. Up to 4308 conditions per place. [2025-01-10 06:52:36,888 INFO L140 encePairwiseOnDemand]: 60/87 looper letters, 51 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2025-01-10 06:52:36,889 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 80 transitions, 297 flow [2025-01-10 06:52:36,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:36,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 166 transitions. [2025-01-10 06:52:36,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.47701149425287354 [2025-01-10 06:52:36,898 INFO L175 Difference]: Start difference. First operand has 75 places, 82 transitions, 179 flow. Second operand 4 states and 166 transitions. [2025-01-10 06:52:36,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 80 transitions, 297 flow [2025-01-10 06:52:36,912 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 80 transitions, 288 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:36,914 INFO L231 Difference]: Finished difference. Result has 68 places, 80 transitions, 236 flow [2025-01-10 06:52:36,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=236, PETRI_PLACES=68, PETRI_TRANSITIONS=80} [2025-01-10 06:52:36,918 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -7 predicate places. [2025-01-10 06:52:36,918 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 80 transitions, 236 flow [2025-01-10 06:52:36,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.75) internal successors, (91), 4 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:52:36,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:36,919 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:52:36,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:52:36,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:36,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:36,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1647755793, now seen corresponding path program 1 times [2025-01-10 06:52:36,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:36,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513325908] [2025-01-10 06:52:36,920 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:36,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:36,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:36,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:37,089 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:52:37,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513325908] [2025-01-10 06:52:37,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513325908] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:37,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661113621] [2025-01-10 06:52:37,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:37,089 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:37,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:37,093 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:52:37,094 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:52:37,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:52:37,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:52:37,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:37,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:37,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:37,166 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:37,204 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:52:37,205 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:37,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661113621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:37,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:37,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:52:37,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038360541] [2025-01-10 06:52:37,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:37,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:52:37,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:37,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:52:37,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:52:37,231 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-01-10 06:52:37,232 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 80 transitions, 236 flow. Second operand has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:52:37,232 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:37,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-01-10 06:52:37,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:37,769 INFO L124 PetriNetUnfolderBase]: 3360/4910 cut-off events. [2025-01-10 06:52:37,770 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-10 06:52:37,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9395 conditions, 4910 events. 3360/4910 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 387. Compared 27429 event pairs, 2182 based on Foata normal form. 3/3121 useless extension candidates. Maximal degree in co-relation 9322. Up to 4293 conditions per place. [2025-01-10 06:52:37,792 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 41 selfloop transitions, 17 changer transitions 0/77 dead transitions. [2025-01-10 06:52:37,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 77 transitions, 340 flow [2025-01-10 06:52:37,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:52:37,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:52:37,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 193 transitions. [2025-01-10 06:52:37,798 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36973180076628354 [2025-01-10 06:52:37,798 INFO L175 Difference]: Start difference. First operand has 68 places, 80 transitions, 236 flow. Second operand 6 states and 193 transitions. [2025-01-10 06:52:37,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 77 transitions, 340 flow [2025-01-10 06:52:37,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 77 transitions, 340 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:52:37,799 INFO L231 Difference]: Finished difference. Result has 70 places, 77 transitions, 258 flow [2025-01-10 06:52:37,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=258, PETRI_PLACES=70, PETRI_TRANSITIONS=77} [2025-01-10 06:52:37,800 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -5 predicate places. [2025-01-10 06:52:37,800 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 77 transitions, 258 flow [2025-01-10 06:52:37,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.833333333333332) internal successors, (137), 6 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:52:37,800 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:37,800 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:52:37,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-10 06:52:38,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:38,007 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:38,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:38,007 INFO L85 PathProgramCache]: Analyzing trace with hash -459176912, now seen corresponding path program 1 times [2025-01-10 06:52:38,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:38,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909873919] [2025-01-10 06:52:38,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:38,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:38,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:52:38,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:52:38,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:38,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:38,120 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:52:38,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:38,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909873919] [2025-01-10 06:52:38,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909873919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:38,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875926730] [2025-01-10 06:52:38,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:38,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:38,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:38,123 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:52:38,128 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:52:38,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:52:38,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:52:38,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:38,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:38,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:52:38,186 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:38,207 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:52:38,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:52:38,244 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:52:38,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875926730] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:52:38,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:52:38,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:52:38,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648157788] [2025-01-10 06:52:38,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:52:38,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:52:38,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:38,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:52:38,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:52:38,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-01-10 06:52:38,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 77 transitions, 258 flow. Second operand has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:52:38,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:38,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-01-10 06:52:38,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:38,804 INFO L124 PetriNetUnfolderBase]: 3369/4946 cut-off events. [2025-01-10 06:52:38,805 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-01-10 06:52:38,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9536 conditions, 4946 events. 3369/4946 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 389. Compared 27843 event pairs, 2182 based on Foata normal form. 9/3163 useless extension candidates. Maximal degree in co-relation 9324. Up to 4308 conditions per place. [2025-01-10 06:52:38,835 INFO L140 encePairwiseOnDemand]: 74/87 looper letters, 48 selfloop transitions, 37 changer transitions 0/104 dead transitions. [2025-01-10 06:52:38,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 104 transitions, 602 flow [2025-01-10 06:52:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:52:38,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:52:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 314 transitions. [2025-01-10 06:52:38,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.36091954022988504 [2025-01-10 06:52:38,841 INFO L175 Difference]: Start difference. First operand has 70 places, 77 transitions, 258 flow. Second operand 10 states and 314 transitions. [2025-01-10 06:52:38,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 104 transitions, 602 flow [2025-01-10 06:52:38,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 104 transitions, 519 flow, removed 16 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:38,848 INFO L231 Difference]: Finished difference. Result has 77 places, 104 transitions, 473 flow [2025-01-10 06:52:38,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=473, PETRI_PLACES=77, PETRI_TRANSITIONS=104} [2025-01-10 06:52:38,849 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 2 predicate places. [2025-01-10 06:52:38,850 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 104 transitions, 473 flow [2025-01-10 06:52:38,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 23.083333333333332) internal successors, (277), 12 states have internal predecessors, (277), 0 states have call successors, (0), 0 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:52:38,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:38,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:38,860 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:52:39,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:39,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:39,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:39,059 INFO L85 PathProgramCache]: Analyzing trace with hash 857350127, now seen corresponding path program 1 times [2025-01-10 06:52:39,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:39,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645081542] [2025-01-10 06:52:39,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:39,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:39,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:52:39,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:52:39,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:39,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:39,158 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:52:39,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:39,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645081542] [2025-01-10 06:52:39,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645081542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:39,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:39,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-01-10 06:52:39,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540088363] [2025-01-10 06:52:39,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:39,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:39,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:39,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:39,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:39,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:39,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 104 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:52:39,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:39,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:39,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:39,861 INFO L124 PetriNetUnfolderBase]: 5830/8591 cut-off events. [2025-01-10 06:52:39,862 INFO L125 PetriNetUnfolderBase]: For 206/206 co-relation queries the response was YES. [2025-01-10 06:52:39,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16477 conditions, 8591 events. 5830/8591 cut-off events. For 206/206 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 51491 event pairs, 1884 based on Foata normal form. 220/5795 useless extension candidates. Maximal degree in co-relation 16379. Up to 4473 conditions per place. [2025-01-10 06:52:39,899 INFO L140 encePairwiseOnDemand]: 80/87 looper letters, 108 selfloop transitions, 3 changer transitions 0/133 dead transitions. [2025-01-10 06:52:39,899 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 757 flow [2025-01-10 06:52:39,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 06:52:39,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245210727969349 [2025-01-10 06:52:39,901 INFO L175 Difference]: Start difference. First operand has 77 places, 104 transitions, 473 flow. Second operand 3 states and 163 transitions. [2025-01-10 06:52:39,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 757 flow [2025-01-10 06:52:39,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 720 flow, removed 9 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:39,903 INFO L231 Difference]: Finished difference. Result has 78 places, 106 transitions, 461 flow [2025-01-10 06:52:39,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=78, PETRI_TRANSITIONS=106} [2025-01-10 06:52:39,904 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-01-10 06:52:39,904 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 106 transitions, 461 flow [2025-01-10 06:52:39,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:52:39,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:39,904 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:39,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:52:39,904 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:39,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 808052280, now seen corresponding path program 1 times [2025-01-10 06:52:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006313393] [2025-01-10 06:52:39,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:39,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:39,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:52:39,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:52:39,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:39,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:39,946 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:52:39,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:39,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006313393] [2025-01-10 06:52:39,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006313393] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:39,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:39,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:39,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630644154] [2025-01-10 06:52:39,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:39,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:39,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:39,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:39,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-01-10 06:52:39,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 106 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:52:39,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:39,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-01-10 06:52:39,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:40,683 INFO L124 PetriNetUnfolderBase]: 8489/12318 cut-off events. [2025-01-10 06:52:40,683 INFO L125 PetriNetUnfolderBase]: For 951/963 co-relation queries the response was YES. [2025-01-10 06:52:40,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25428 conditions, 12318 events. 8489/12318 cut-off events. For 951/963 co-relation queries the response was YES. Maximal size of possible extension queue 421. Compared 69973 event pairs, 3181 based on Foata normal form. 0/9369 useless extension candidates. Maximal degree in co-relation 25333. Up to 5816 conditions per place. [2025-01-10 06:52:40,741 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 4 changer transitions 0/132 dead transitions. [2025-01-10 06:52:40,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 132 transitions, 751 flow [2025-01-10 06:52:40,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:40,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:40,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2025-01-10 06:52:40,743 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5632183908045977 [2025-01-10 06:52:40,743 INFO L175 Difference]: Start difference. First operand has 78 places, 106 transitions, 461 flow. Second operand 3 states and 147 transitions. [2025-01-10 06:52:40,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 132 transitions, 751 flow [2025-01-10 06:52:40,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 132 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:40,746 INFO L231 Difference]: Finished difference. Result has 81 places, 107 transitions, 480 flow [2025-01-10 06:52:40,746 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=81, PETRI_TRANSITIONS=107} [2025-01-10 06:52:40,747 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 6 predicate places. [2025-01-10 06:52:40,747 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 107 transitions, 480 flow [2025-01-10 06:52:40,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 0 states have call successors, (0), 0 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:52:40,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:40,747 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:40,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:52:40,747 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:40,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1192714781, now seen corresponding path program 1 times [2025-01-10 06:52:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:40,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974319631] [2025-01-10 06:52:40,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:40,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:40,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:52:40,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:52:40,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:40,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:40,829 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:52:40,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:40,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974319631] [2025-01-10 06:52:40,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974319631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:40,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:40,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:40,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559606211] [2025-01-10 06:52:40,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:40,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:40,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:40,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:40,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:40,831 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:40,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 107 transitions, 480 flow. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:52:40,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:40,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:40,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:41,825 INFO L124 PetriNetUnfolderBase]: 10414/15890 cut-off events. [2025-01-10 06:52:41,825 INFO L125 PetriNetUnfolderBase]: For 3256/3364 co-relation queries the response was YES. [2025-01-10 06:52:41,858 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33866 conditions, 15890 events. 10414/15890 cut-off events. For 3256/3364 co-relation queries the response was YES. Maximal size of possible extension queue 466. Compared 99246 event pairs, 4177 based on Foata normal form. 320/12560 useless extension candidates. Maximal degree in co-relation 33770. Up to 7196 conditions per place. [2025-01-10 06:52:41,924 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 113 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-01-10 06:52:41,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 138 transitions, 796 flow [2025-01-10 06:52:41,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:41,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2025-01-10 06:52:41,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6245210727969349 [2025-01-10 06:52:41,926 INFO L175 Difference]: Start difference. First operand has 81 places, 107 transitions, 480 flow. Second operand 3 states and 163 transitions. [2025-01-10 06:52:41,926 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 138 transitions, 796 flow [2025-01-10 06:52:41,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 138 transitions, 784 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:41,933 INFO L231 Difference]: Finished difference. Result has 82 places, 108 transitions, 486 flow [2025-01-10 06:52:41,933 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=472, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=486, PETRI_PLACES=82, PETRI_TRANSITIONS=108} [2025-01-10 06:52:41,933 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-01-10 06:52:41,933 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 108 transitions, 486 flow [2025-01-10 06:52:41,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:52:41,934 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:41,934 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:41,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:52:41,934 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:41,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:41,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1680545309, now seen corresponding path program 1 times [2025-01-10 06:52:41,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:41,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106480837] [2025-01-10 06:52:41,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:41,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:41,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-01-10 06:52:41,946 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-01-10 06:52:41,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:41,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:41,969 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:52:41,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:41,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106480837] [2025-01-10 06:52:41,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106480837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:41,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:41,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:41,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87152799] [2025-01-10 06:52:41,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:41,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:41,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:41,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:41,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:41,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 87 [2025-01-10 06:52:41,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 108 transitions, 486 flow. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:52:41,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:41,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 87 [2025-01-10 06:52:41,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:43,222 INFO L124 PetriNetUnfolderBase]: 14063/20641 cut-off events. [2025-01-10 06:52:43,223 INFO L125 PetriNetUnfolderBase]: For 3133/3357 co-relation queries the response was YES. [2025-01-10 06:52:43,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43482 conditions, 20641 events. 14063/20641 cut-off events. For 3133/3357 co-relation queries the response was YES. Maximal size of possible extension queue 694. Compared 124291 event pairs, 6937 based on Foata normal form. 0/15999 useless extension candidates. Maximal degree in co-relation 43385. Up to 12185 conditions per place. [2025-01-10 06:52:43,344 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 4 changer transitions 0/135 dead transitions. [2025-01-10 06:52:43,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 786 flow [2025-01-10 06:52:43,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:43,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:43,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-01-10 06:52:43,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-01-10 06:52:43,345 INFO L175 Difference]: Start difference. First operand has 82 places, 108 transitions, 486 flow. Second operand 3 states and 153 transitions. [2025-01-10 06:52:43,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 786 flow [2025-01-10 06:52:43,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:43,350 INFO L231 Difference]: Finished difference. Result has 85 places, 108 transitions, 502 flow [2025-01-10 06:52:43,350 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=502, PETRI_PLACES=85, PETRI_TRANSITIONS=108} [2025-01-10 06:52:43,351 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-01-10 06:52:43,351 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 108 transitions, 502 flow [2025-01-10 06:52:43,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 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:52:43,351 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:43,351 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:43,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:52:43,351 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:43,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:43,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1448568656, now seen corresponding path program 1 times [2025-01-10 06:52:43,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:43,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006375151] [2025-01-10 06:52:43,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:43,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:43,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:52:43,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:52:43,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:43,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:43,454 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:52:43,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:43,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006375151] [2025-01-10 06:52:43,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006375151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:43,455 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:43,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:43,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895960475] [2025-01-10 06:52:43,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:43,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:43,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:43,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:43,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:43,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:43,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 108 transitions, 502 flow. Second operand has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:52:43,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:43,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:43,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:44,535 INFO L124 PetriNetUnfolderBase]: 12513/19139 cut-off events. [2025-01-10 06:52:44,536 INFO L125 PetriNetUnfolderBase]: For 6631/7023 co-relation queries the response was YES. [2025-01-10 06:52:44,567 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41664 conditions, 19139 events. 12513/19139 cut-off events. For 6631/7023 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 119914 event pairs, 9361 based on Foata normal form. 112/14986 useless extension candidates. Maximal degree in co-relation 41509. Up to 15248 conditions per place. [2025-01-10 06:52:44,620 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 131 selfloop transitions, 3 changer transitions 2/160 dead transitions. [2025-01-10 06:52:44,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 160 transitions, 1013 flow [2025-01-10 06:52:44,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:44,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:44,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 191 transitions. [2025-01-10 06:52:44,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5488505747126436 [2025-01-10 06:52:44,622 INFO L175 Difference]: Start difference. First operand has 85 places, 108 transitions, 502 flow. Second operand 4 states and 191 transitions. [2025-01-10 06:52:44,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 160 transitions, 1013 flow [2025-01-10 06:52:44,634 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 160 transitions, 1005 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:44,636 INFO L231 Difference]: Finished difference. Result has 87 places, 108 transitions, 505 flow [2025-01-10 06:52:44,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=505, PETRI_PLACES=87, PETRI_TRANSITIONS=108} [2025-01-10 06:52:44,640 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 12 predicate places. [2025-01-10 06:52:44,640 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 108 transitions, 505 flow [2025-01-10 06:52:44,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.0) internal successors, (124), 4 states have internal predecessors, (124), 0 states have call successors, (0), 0 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:52:44,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:44,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:44,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-10 06:52:44,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:44,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1955957535, now seen corresponding path program 1 times [2025-01-10 06:52:44,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:44,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965552971] [2025-01-10 06:52:44,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:44,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:44,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:52:44,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:52:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:44,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:44,730 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:52:44,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:44,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965552971] [2025-01-10 06:52:44,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965552971] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:44,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:44,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:44,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054077616] [2025-01-10 06:52:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:44,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:44,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:44,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:44,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:44,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 87 [2025-01-10 06:52:44,744 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 108 transitions, 505 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:52:44,744 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:44,744 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 87 [2025-01-10 06:52:44,744 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:46,927 INFO L124 PetriNetUnfolderBase]: 23803/34687 cut-off events. [2025-01-10 06:52:46,927 INFO L125 PetriNetUnfolderBase]: For 10133/10947 co-relation queries the response was YES. [2025-01-10 06:52:47,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76569 conditions, 34687 events. 23803/34687 cut-off events. For 10133/10947 co-relation queries the response was YES. Maximal size of possible extension queue 1106. Compared 216220 event pairs, 13589 based on Foata normal form. 0/26657 useless extension candidates. Maximal degree in co-relation 76413. Up to 16287 conditions per place. [2025-01-10 06:52:47,140 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 111 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-01-10 06:52:47,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 137 transitions, 823 flow [2025-01-10 06:52:47,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:47,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:47,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-01-10 06:52:47,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-01-10 06:52:47,142 INFO L175 Difference]: Start difference. First operand has 87 places, 108 transitions, 505 flow. Second operand 3 states and 153 transitions. [2025-01-10 06:52:47,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 137 transitions, 823 flow [2025-01-10 06:52:47,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 137 transitions, 819 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:47,149 INFO L231 Difference]: Finished difference. Result has 90 places, 109 transitions, 527 flow [2025-01-10 06:52:47,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=90, PETRI_TRANSITIONS=109} [2025-01-10 06:52:47,150 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 15 predicate places. [2025-01-10 06:52:47,151 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 109 transitions, 527 flow [2025-01-10 06:52:47,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:52:47,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:47,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:47,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:52:47,152 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread3Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:47,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:47,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1389827248, now seen corresponding path program 1 times [2025-01-10 06:52:47,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:47,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009847408] [2025-01-10 06:52:47,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:47,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:47,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:52:47,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:52:47,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:47,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:47,531 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:52:47,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009847408] [2025-01-10 06:52:47,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009847408] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:47,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754808514] [2025-01-10 06:52:47,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:47,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:47,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:47,534 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:52:47,535 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:52:47,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:52:47,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:52:47,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:47,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:47,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:52:47,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:47,627 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:52:47,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:47,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754808514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:47,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:47,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [4] total 5 [2025-01-10 06:52:47,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840407238] [2025-01-10 06:52:47,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:47,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:47,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:47,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:47,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:52:47,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:47,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 109 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:52:47,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:47,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:47,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:49,298 INFO L124 PetriNetUnfolderBase]: 14442/22518 cut-off events. [2025-01-10 06:52:49,298 INFO L125 PetriNetUnfolderBase]: For 10236/11148 co-relation queries the response was YES. [2025-01-10 06:52:49,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49978 conditions, 22518 events. 14442/22518 cut-off events. For 10236/11148 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 149203 event pairs, 11366 based on Foata normal form. 1221/19049 useless extension candidates. Maximal degree in co-relation 49821. Up to 19100 conditions per place. [2025-01-10 06:52:49,399 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 79 selfloop transitions, 1 changer transitions 0/105 dead transitions. [2025-01-10 06:52:49,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 105 transitions, 673 flow [2025-01-10 06:52:49,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:49,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2025-01-10 06:52:49,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.49808429118773945 [2025-01-10 06:52:49,401 INFO L175 Difference]: Start difference. First operand has 90 places, 109 transitions, 527 flow. Second operand 3 states and 130 transitions. [2025-01-10 06:52:49,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 105 transitions, 673 flow [2025-01-10 06:52:49,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 105 transitions, 663 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:49,420 INFO L231 Difference]: Finished difference. Result has 86 places, 105 transitions, 505 flow [2025-01-10 06:52:49,424 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=503, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=505, PETRI_PLACES=86, PETRI_TRANSITIONS=105} [2025-01-10 06:52:49,424 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 11 predicate places. [2025-01-10 06:52:49,424 INFO L471 AbstractCegarLoop]: Abstraction has has 86 places, 105 transitions, 505 flow [2025-01-10 06:52:49,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:52:49,424 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:49,424 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:52:49,435 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:52:49,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:49,625 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:49,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:49,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2131458000, now seen corresponding path program 2 times [2025-01-10 06:52:49,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:49,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248631077] [2025-01-10 06:52:49,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:52:49,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:49,636 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:52:49,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:52:49,647 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:52:49,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:49,676 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:52:49,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248631077] [2025-01-10 06:52:49,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248631077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:49,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144754660] [2025-01-10 06:52:49,677 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:52:49,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:49,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:49,681 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:52:49,683 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:52:49,725 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:52:49,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:52:49,733 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:52:49,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:49,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:52:49,735 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:49,759 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:52:49,759 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:52:49,781 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:52:49,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144754660] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:52:49,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:52:49,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:52:49,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598334856] [2025-01-10 06:52:49,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:52:49,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:49,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:49,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:49,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:49,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-01-10 06:52:49,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 105 transitions, 505 flow. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:52:49,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:49,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-01-10 06:52:49,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:51,082 INFO L124 PetriNetUnfolderBase]: 14442/22513 cut-off events. [2025-01-10 06:52:51,083 INFO L125 PetriNetUnfolderBase]: For 7143/8055 co-relation queries the response was YES. [2025-01-10 06:52:51,128 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49003 conditions, 22513 events. 14442/22513 cut-off events. For 7143/8055 co-relation queries the response was YES. Maximal size of possible extension queue 662. Compared 149187 event pairs, 11366 based on Foata normal form. 5/17778 useless extension candidates. Maximal degree in co-relation 48978. Up to 19035 conditions per place. [2025-01-10 06:52:51,187 INFO L140 encePairwiseOnDemand]: 76/87 looper letters, 43 selfloop transitions, 36 changer transitions 1/102 dead transitions. [2025-01-10 06:52:51,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 102 transitions, 635 flow [2025-01-10 06:52:51,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:52:51,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:52:51,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 133 transitions. [2025-01-10 06:52:51,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.382183908045977 [2025-01-10 06:52:51,188 INFO L175 Difference]: Start difference. First operand has 86 places, 105 transitions, 505 flow. Second operand 4 states and 133 transitions. [2025-01-10 06:52:51,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 102 transitions, 635 flow [2025-01-10 06:52:51,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 102 transitions, 604 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-01-10 06:52:51,195 INFO L231 Difference]: Finished difference. Result has 81 places, 101 transitions, 511 flow [2025-01-10 06:52:51,195 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=511, PETRI_PLACES=81, PETRI_TRANSITIONS=101} [2025-01-10 06:52:51,195 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 6 predicate places. [2025-01-10 06:52:51,196 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 101 transitions, 511 flow [2025-01-10 06:52:51,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 0 states have call successors, (0), 0 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:52:51,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:51,196 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:51,203 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:52:51,396 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,SelfDestructingSolverStorable10 [2025-01-10 06:52:51,397 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:51,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:51,397 INFO L85 PathProgramCache]: Analyzing trace with hash 416982873, now seen corresponding path program 1 times [2025-01-10 06:52:51,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:51,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318740849] [2025-01-10 06:52:51,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:51,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:51,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:52:51,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:52:51,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:51,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:51,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:52:51,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:51,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318740849] [2025-01-10 06:52:51,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318740849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:51,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:51,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:52:51,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532943644] [2025-01-10 06:52:51,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:51,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:51,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:51,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:51,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:51,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:51,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 101 transitions, 511 flow. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:52:51,456 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:51,456 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:51,456 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:53,474 INFO L124 PetriNetUnfolderBase]: 18120/27220 cut-off events. [2025-01-10 06:52:53,475 INFO L125 PetriNetUnfolderBase]: For 11219/13037 co-relation queries the response was YES. [2025-01-10 06:52:53,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61229 conditions, 27220 events. 18120/27220 cut-off events. For 11219/13037 co-relation queries the response was YES. Maximal size of possible extension queue 706. Compared 170707 event pairs, 6045 based on Foata normal form. 566/22683 useless extension candidates. Maximal degree in co-relation 61207. Up to 17545 conditions per place. [2025-01-10 06:52:53,635 INFO L140 encePairwiseOnDemand]: 83/87 looper letters, 103 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2025-01-10 06:52:53,635 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 127 transitions, 801 flow [2025-01-10 06:52:53,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:53,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2025-01-10 06:52:53,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5862068965517241 [2025-01-10 06:52:53,636 INFO L175 Difference]: Start difference. First operand has 81 places, 101 transitions, 511 flow. Second operand 3 states and 153 transitions. [2025-01-10 06:52:53,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 127 transitions, 801 flow [2025-01-10 06:52:53,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 127 transitions, 727 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-01-10 06:52:53,646 INFO L231 Difference]: Finished difference. Result has 79 places, 102 transitions, 453 flow [2025-01-10 06:52:53,646 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=79, PETRI_TRANSITIONS=102} [2025-01-10 06:52:53,647 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-01-10 06:52:53,647 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 102 transitions, 453 flow [2025-01-10 06:52:53,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:52:53,647 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:53,647 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:53,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-10 06:52:53,647 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:53,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1735421959, now seen corresponding path program 1 times [2025-01-10 06:52:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:53,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727613105] [2025-01-10 06:52:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:53,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:53,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:52:53,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:52:53,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:53,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:53,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-10 06:52:53,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:53,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727613105] [2025-01-10 06:52:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727613105] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:53,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:53,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:53,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300845244] [2025-01-10 06:52:53,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:53,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:52:53,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:53,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:52:53,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:52:53,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:53,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 102 transitions, 453 flow. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:52:53,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:53,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:53,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:56,579 INFO L124 PetriNetUnfolderBase]: 23693/36192 cut-off events. [2025-01-10 06:52:56,579 INFO L125 PetriNetUnfolderBase]: For 15278/17325 co-relation queries the response was YES. [2025-01-10 06:52:56,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82214 conditions, 36192 events. 23693/36192 cut-off events. For 15278/17325 co-relation queries the response was YES. Maximal size of possible extension queue 850. Compared 242828 event pairs, 18637 based on Foata normal form. 320/29474 useless extension candidates. Maximal degree in co-relation 82192. Up to 24052 conditions per place. [2025-01-10 06:52:56,777 INFO L140 encePairwiseOnDemand]: 78/87 looper letters, 95 selfloop transitions, 14 changer transitions 0/131 dead transitions. [2025-01-10 06:52:56,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 131 transitions, 764 flow [2025-01-10 06:52:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:52:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:52:56,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 219 transitions. [2025-01-10 06:52:56,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.503448275862069 [2025-01-10 06:52:56,779 INFO L175 Difference]: Start difference. First operand has 79 places, 102 transitions, 453 flow. Second operand 5 states and 219 transitions. [2025-01-10 06:52:56,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 131 transitions, 764 flow [2025-01-10 06:52:56,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 131 transitions, 761 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:52:56,788 INFO L231 Difference]: Finished difference. Result has 83 places, 102 transitions, 494 flow [2025-01-10 06:52:56,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=494, PETRI_PLACES=83, PETRI_TRANSITIONS=102} [2025-01-10 06:52:56,788 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 8 predicate places. [2025-01-10 06:52:56,788 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 102 transitions, 494 flow [2025-01-10 06:52:56,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:52:56,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:56,789 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:56,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:52:56,789 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:56,789 INFO L85 PathProgramCache]: Analyzing trace with hash -1293123778, now seen corresponding path program 1 times [2025-01-10 06:52:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548445803] [2025-01-10 06:52:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:56,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-01-10 06:52:56,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-01-10 06:52:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:56,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:52:56,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:56,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548445803] [2025-01-10 06:52:56,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548445803] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:56,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:52:56,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:52:56,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903757197] [2025-01-10 06:52:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:56,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:56,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:52:56,828 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-01-10 06:52:56,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 102 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:52:56,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:56,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-01-10 06:52:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:52:59,202 INFO L124 PetriNetUnfolderBase]: 26991/38852 cut-off events. [2025-01-10 06:52:59,202 INFO L125 PetriNetUnfolderBase]: For 18056/20219 co-relation queries the response was YES. [2025-01-10 06:52:59,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91696 conditions, 38852 events. 26991/38852 cut-off events. For 18056/20219 co-relation queries the response was YES. Maximal size of possible extension queue 686. Compared 225900 event pairs, 14081 based on Foata normal form. 452/33478 useless extension candidates. Maximal degree in co-relation 91672. Up to 24066 conditions per place. [2025-01-10 06:52:59,580 INFO L140 encePairwiseOnDemand]: 82/87 looper letters, 103 selfloop transitions, 4 changer transitions 1/124 dead transitions. [2025-01-10 06:52:59,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 124 transitions, 776 flow [2025-01-10 06:52:59,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:52:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:52:59,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2025-01-10 06:52:59,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5363984674329502 [2025-01-10 06:52:59,582 INFO L175 Difference]: Start difference. First operand has 83 places, 102 transitions, 494 flow. Second operand 3 states and 140 transitions. [2025-01-10 06:52:59,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 124 transitions, 776 flow [2025-01-10 06:52:59,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 124 transitions, 759 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-10 06:52:59,590 INFO L231 Difference]: Finished difference. Result has 85 places, 102 transitions, 494 flow [2025-01-10 06:52:59,590 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=477, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=85, PETRI_TRANSITIONS=102} [2025-01-10 06:52:59,591 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-01-10 06:52:59,592 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 102 transitions, 494 flow [2025-01-10 06:52:59,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 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:52:59,592 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:52:59,593 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:52:59,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-10 06:52:59,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:52:59,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:52:59,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1859035696, now seen corresponding path program 1 times [2025-01-10 06:52:59,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:52:59,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645510490] [2025-01-10 06:52:59,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:59,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:52:59,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:52:59,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:52:59,617 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:59,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:52:59,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:52:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645510490] [2025-01-10 06:52:59,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645510490] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:52:59,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345546357] [2025-01-10 06:52:59,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:52:59,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:52:59,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:52:59,727 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:52:59,728 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:52:59,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-10 06:52:59,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-10 06:52:59,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:52:59,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:52:59,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:52:59,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:52:59,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:52:59,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:52:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345546357] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:52:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:52:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-10 06:52:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373661801] [2025-01-10 06:52:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:52:59,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:52:59,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:52:59,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:52:59,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-10 06:52:59,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:52:59,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 102 transitions, 494 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:52:59,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:52:59,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:52:59,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:01,416 INFO L124 PetriNetUnfolderBase]: 16299/24734 cut-off events. [2025-01-10 06:53:01,417 INFO L125 PetriNetUnfolderBase]: For 17151/18944 co-relation queries the response was YES. [2025-01-10 06:53:01,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58675 conditions, 24734 events. 16299/24734 cut-off events. For 17151/18944 co-relation queries the response was YES. Maximal size of possible extension queue 582. Compared 154975 event pairs, 12973 based on Foata normal form. 1360/21564 useless extension candidates. Maximal degree in co-relation 58651. Up to 21771 conditions per place. [2025-01-10 06:53:01,538 INFO L140 encePairwiseOnDemand]: 84/87 looper letters, 76 selfloop transitions, 1 changer transitions 0/100 dead transitions. [2025-01-10 06:53:01,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 100 transitions, 640 flow [2025-01-10 06:53:01,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:01,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:01,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2025-01-10 06:53:01,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4827586206896552 [2025-01-10 06:53:01,539 INFO L175 Difference]: Start difference. First operand has 85 places, 102 transitions, 494 flow. Second operand 3 states and 126 transitions. [2025-01-10 06:53:01,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 100 transitions, 640 flow [2025-01-10 06:53:01,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 100 transitions, 620 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:53:01,549 INFO L231 Difference]: Finished difference. Result has 82 places, 100 transitions, 468 flow [2025-01-10 06:53:01,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=468, PETRI_PLACES=82, PETRI_TRANSITIONS=100} [2025-01-10 06:53:01,549 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 7 predicate places. [2025-01-10 06:53:01,549 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 100 transitions, 468 flow [2025-01-10 06:53:01,550 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:53:01,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:01,550 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:01,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-10 06:53:01,750 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,SelfDestructingSolverStorable14 [2025-01-10 06:53:01,751 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:53:01,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:01,751 INFO L85 PathProgramCache]: Analyzing trace with hash 2019937416, now seen corresponding path program 1 times [2025-01-10 06:53:01,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:01,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232533730] [2025-01-10 06:53:01,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:01,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:01,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-10 06:53:01,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-10 06:53:01,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:01,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:53:01,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:01,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232533730] [2025-01-10 06:53:01,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232533730] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:01,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559886165] [2025-01-10 06:53:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:01,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:53:01,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:01,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:53:01,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-10 06:53:01,790 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 87 [2025-01-10 06:53:01,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 100 transitions, 468 flow. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:53:01,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:01,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 87 [2025-01-10 06:53:01,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:04,198 INFO L124 PetriNetUnfolderBase]: 25849/37643 cut-off events. [2025-01-10 06:53:04,199 INFO L125 PetriNetUnfolderBase]: For 20578/23366 co-relation queries the response was YES. [2025-01-10 06:53:04,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89722 conditions, 37643 events. 25849/37643 cut-off events. For 20578/23366 co-relation queries the response was YES. Maximal size of possible extension queue 557. Compared 221681 event pairs, 16025 based on Foata normal form. 640/32458 useless extension candidates. Maximal degree in co-relation 89698. Up to 27157 conditions per place. [2025-01-10 06:53:04,561 INFO L140 encePairwiseOnDemand]: 81/87 looper letters, 101 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-01-10 06:53:04,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 121 transitions, 740 flow [2025-01-10 06:53:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:53:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:53:04,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-01-10 06:53:04,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5287356321839081 [2025-01-10 06:53:04,563 INFO L175 Difference]: Start difference. First operand has 82 places, 100 transitions, 468 flow. Second operand 3 states and 138 transitions. [2025-01-10 06:53:04,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 121 transitions, 740 flow [2025-01-10 06:53:04,570 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 121 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:53:04,571 INFO L231 Difference]: Finished difference. Result has 85 places, 101 transitions, 493 flow [2025-01-10 06:53:04,571 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=85, PETRI_TRANSITIONS=101} [2025-01-10 06:53:04,572 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 10 predicate places. [2025-01-10 06:53:04,572 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 101 transitions, 493 flow [2025-01-10 06:53:04,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:53:04,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:04,572 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:04,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-10 06:53:04,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:53:04,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:04,573 INFO L85 PathProgramCache]: Analyzing trace with hash 448352171, now seen corresponding path program 1 times [2025-01-10 06:53:04,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:04,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576951155] [2025-01-10 06:53:04,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:04,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:04,580 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-10 06:53:04,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-10 06:53:04,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:04,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:04,655 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:53:04,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:04,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576951155] [2025-01-10 06:53:04,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576951155] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:53:04,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:53:04,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:53:04,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048464521] [2025-01-10 06:53:04,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:53:04,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:53:04,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:04,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:53:04,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:53:04,656 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 87 [2025-01-10 06:53:04,656 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 101 transitions, 493 flow. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:04,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:04,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 87 [2025-01-10 06:53:04,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:53:07,626 INFO L124 PetriNetUnfolderBase]: 27356/42128 cut-off events. [2025-01-10 06:53:07,626 INFO L125 PetriNetUnfolderBase]: For 26573/29471 co-relation queries the response was YES. [2025-01-10 06:53:07,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99382 conditions, 42128 events. 27356/42128 cut-off events. For 26573/29471 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 276569 event pairs, 22206 based on Foata normal form. 120/34605 useless extension candidates. Maximal degree in co-relation 99357. Up to 27867 conditions per place. [2025-01-10 06:53:07,818 INFO L140 encePairwiseOnDemand]: 79/87 looper letters, 69 selfloop transitions, 7 changer transitions 43/143 dead transitions. [2025-01-10 06:53:07,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 143 transitions, 915 flow [2025-01-10 06:53:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:53:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:53:07,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 218 transitions. [2025-01-10 06:53:07,819 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5011494252873563 [2025-01-10 06:53:07,819 INFO L175 Difference]: Start difference. First operand has 85 places, 101 transitions, 493 flow. Second operand 5 states and 218 transitions. [2025-01-10 06:53:07,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 143 transitions, 915 flow [2025-01-10 06:53:07,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 143 transitions, 901 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:53:07,835 INFO L231 Difference]: Finished difference. Result has 89 places, 100 transitions, 508 flow [2025-01-10 06:53:07,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=87, PETRI_DIFFERENCE_MINUEND_FLOW=485, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=508, PETRI_PLACES=89, PETRI_TRANSITIONS=100} [2025-01-10 06:53:07,835 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 14 predicate places. [2025-01-10 06:53:07,835 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 100 transitions, 508 flow [2025-01-10 06:53:07,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:07,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:53:07,836 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:53:07,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-10 06:53:07,836 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 38 more)] === [2025-01-10 06:53:07,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:53:07,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1251958933, now seen corresponding path program 1 times [2025-01-10 06:53:07,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:53:07,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919819698] [2025-01-10 06:53:07,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:07,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:53:07,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:53:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:53:07,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-10 06:53:07,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:53:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919819698] [2025-01-10 06:53:07,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919819698] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:53:07,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389715843] [2025-01-10 06:53:07,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:53:07,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:53:07,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:53:07,959 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:53:07,967 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:53:08,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-10 06:53:08,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-10 06:53:08,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:53:08,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:53:08,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:53:08,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:53:08,116 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-10 06:53:08,116 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:53:08,267 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-10 06:53:08,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389715843] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:53:08,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:53:08,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 11 [2025-01-10 06:53:08,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131745512] [2025-01-10 06:53:08,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:53:08,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-10 06:53:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:53:08,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-10 06:53:08,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-01-10 06:53:08,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 87 [2025-01-10 06:53:08,311 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 100 transitions, 508 flow. Second operand has 11 states, 11 states have (on average 28.818181818181817) internal successors, (317), 11 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:53:08,311 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:53:08,311 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 87 [2025-01-10 06:53:08,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand