./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-word-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-10 06:50:58,417 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-10 06:50:58,465 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:50:58,473 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-10 06:50:58,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-10 06:50:58,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-10 06:50:58,499 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-10 06:50:58,499 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-10 06:50:58,500 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-10 06:50:58,500 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-10 06:50:58,500 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-10 06:50:58,500 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-10 06:50:58,500 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-10 06:50:58,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-10 06:50:58,500 INFO L153 SettingsManager]: * Use SBE=true [2025-01-10 06:50:58,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-01-10 06:50:58,501 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-10 06:50:58,502 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:58,502 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-10 06:50:58,502 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:50:58,503 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-10 06:50:58,503 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-10 06:50:58,503 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 -> bf81f7b3bd1ceac2bf46c7c37f69effc0af9de17b18c7565156301fb49a6164e [2025-01-10 06:50:58,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-10 06:50:58,708 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-10 06:50:58,709 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-10 06:50:58,710 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-10 06:50:58,710 INFO L274 PluginConnector]: CDTParser initialized [2025-01-10 06:50:58,711 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-01-10 06:50:59,788 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74922cf35/7d0f9cf36fd042e4947f4cfa9750379a/FLAG86682b4bb [2025-01-10 06:51:00,039 INFO L384 CDTParser]: Found 1 translation units. [2025-01-10 06:51:00,039 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-01-10 06:51:00,045 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74922cf35/7d0f9cf36fd042e4947f4cfa9750379a/FLAG86682b4bb [2025-01-10 06:51:00,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/74922cf35/7d0f9cf36fd042e4947f4cfa9750379a [2025-01-10 06:51:00,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-10 06:51:00,396 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-10 06:51:00,398 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:00,398 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-10 06:51:00,402 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-10 06:51:00,403 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,403 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6981aeba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00, skipping insertion in model container [2025-01-10 06:51:00,404 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,417 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-10 06:51:00,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:00,578 INFO L200 MainTranslator]: Completed pre-run [2025-01-10 06:51:00,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-10 06:51:00,628 INFO L204 MainTranslator]: Completed translation [2025-01-10 06:51:00,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00 WrapperNode [2025-01-10 06:51:00,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-10 06:51:00,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:00,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-10 06:51:00,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-10 06:51:00,634 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:51:00" (1/1) ... [2025-01-10 06:51:00,640 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:51:00" (1/1) ... [2025-01-10 06:51:00,658 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 123 [2025-01-10 06:51:00,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-10 06:51:00,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-10 06:51:00,661 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-10 06:51:00,661 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-10 06:51:00,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,670 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,686 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-01-10 06:51:00,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,688 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,692 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,696 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,702 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-10 06:51:00,707 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-10 06:51:00,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-10 06:51:00,707 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-10 06:51:00,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (1/1) ... [2025-01-10 06:51:00,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-10 06:51:00,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:00,733 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:51:00,736 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:51:00,752 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-10 06:51:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-10 06:51:00,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-10 06:51:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-10 06:51:00,753 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-10 06:51:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-10 06:51:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-10 06:51:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-10 06:51:00,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-10 06:51:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-10 06:51:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-10 06:51:00,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-10 06:51:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-10 06:51:00,754 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-10 06:51:00,755 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:51:00,843 INFO L234 CfgBuilder]: Building ICFG [2025-01-10 06:51:00,845 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-10 06:51:01,226 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-10 06:51:01,226 INFO L283 CfgBuilder]: Performing block encoding [2025-01-10 06:51:01,379 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-10 06:51:01,379 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-10 06:51:01,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:01 BoogieIcfgContainer [2025-01-10 06:51:01,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-10 06:51:01,381 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-10 06:51:01,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-10 06:51:01,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-10 06:51:01,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:51:00" (1/3) ... [2025-01-10 06:51:01,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795935b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:01, skipping insertion in model container [2025-01-10 06:51:01,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:51:00" (2/3) ... [2025-01-10 06:51:01,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@795935b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:51:01, skipping insertion in model container [2025-01-10 06:51:01,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:01" (3/3) ... [2025-01-10 06:51:01,387 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-01-10 06:51:01,396 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-10 06:51:01,398 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-word-symm.wvr.c that has 3 procedures, 51 locations, 1 initial locations, 4 loop locations, and 12 error locations. [2025-01-10 06:51:01,398 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-10 06:51:01,489 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-10 06:51:01,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 134 flow [2025-01-10 06:51:01,547 INFO L124 PetriNetUnfolderBase]: 10/58 cut-off events. [2025-01-10 06:51:01,549 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-10 06:51:01,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67 conditions, 58 events. 10/58 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 161 event pairs, 0 based on Foata normal form. 0/36 useless extension candidates. Maximal degree in co-relation 43. Up to 3 conditions per place. [2025-01-10 06:51:01,551 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 60 transitions, 134 flow [2025-01-10 06:51:01,553 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 56 transitions, 121 flow [2025-01-10 06:51:01,560 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-10 06:51:01,568 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;@46ffb596, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-10 06:51:01,568 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-01-10 06:51:01,571 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-10 06:51:01,571 INFO L124 PetriNetUnfolderBase]: 0/3 cut-off events. [2025-01-10 06:51:01,572 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-10 06:51:01,572 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:01,572 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-01-10 06:51:01,572 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:01,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:01,576 INFO L85 PathProgramCache]: Analyzing trace with hash 559366, now seen corresponding path program 1 times [2025-01-10 06:51:01,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:01,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910875212] [2025-01-10 06:51:01,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:01,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:01,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-01-10 06:51:01,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-01-10 06:51:01,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:01,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:01,794 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:51:01,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:01,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910875212] [2025-01-10 06:51:01,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910875212] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:01,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:01,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-10 06:51:01,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199448806] [2025-01-10 06:51:01,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:01,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:01,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:01,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:01,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:01,841 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:01,843 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 56 transitions, 121 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 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:51:01,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:01,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:01,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:01,974 INFO L124 PetriNetUnfolderBase]: 283/633 cut-off events. [2025-01-10 06:51:01,974 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-01-10 06:51:01,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1067 conditions, 633 events. 283/633 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3388 event pairs, 157 based on Foata normal form. 2/471 useless extension candidates. Maximal degree in co-relation 974. Up to 403 conditions per place. [2025-01-10 06:51:01,979 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 33 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-01-10 06:51:01,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 213 flow [2025-01-10 06:51:01,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:01,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:01,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-01-10 06:51:01,989 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-01-10 06:51:01,990 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 121 flow. Second operand 4 states and 140 transitions. [2025-01-10 06:51:01,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 213 flow [2025-01-10 06:51:01,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:01,994 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 176 flow [2025-01-10 06:51:01,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=176, PETRI_PLACES=56, PETRI_TRANSITIONS=62} [2025-01-10 06:51:01,998 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-01-10 06:51:01,998 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 176 flow [2025-01-10 06:51:01,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 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:51:01,998 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:01,998 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-01-10 06:51:01,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-10 06:51:01,999 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:01,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:01,999 INFO L85 PathProgramCache]: Analyzing trace with hash -515208482, now seen corresponding path program 1 times [2025-01-10 06:51:01,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990586193] [2025-01-10 06:51:01,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:02,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:02,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:02,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:02,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:02,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:02,126 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:51:02,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:02,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990586193] [2025-01-10 06:51:02,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990586193] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:02,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829091412] [2025-01-10 06:51:02,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:02,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:02,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:02,129 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:51:02,130 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:51:02,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-01-10 06:51:02,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-01-10 06:51:02,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:02,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:02,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:02,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:02,234 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:51:02,235 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:02,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829091412] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:02,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:02,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-01-10 06:51:02,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809236132] [2025-01-10 06:51:02,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:02,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-10 06:51:02,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:02,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-10 06:51:02,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:51:02,250 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:02,250 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 62 transitions, 176 flow. Second operand has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:02,250 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:02,250 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:02,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:02,378 INFO L124 PetriNetUnfolderBase]: 283/631 cut-off events. [2025-01-10 06:51:02,378 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-10 06:51:02,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1078 conditions, 631 events. 283/631 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3377 event pairs, 157 based on Foata normal form. 2/472 useless extension candidates. Maximal degree in co-relation 1028. Up to 393 conditions per place. [2025-01-10 06:51:02,382 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 26 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2025-01-10 06:51:02,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 244 flow [2025-01-10 06:51:02,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-10 06:51:02,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-10 06:51:02,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-01-10 06:51:02,384 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-01-10 06:51:02,384 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 176 flow. Second operand 6 states and 184 transitions. [2025-01-10 06:51:02,384 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 244 flow [2025-01-10 06:51:02,385 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-10 06:51:02,386 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 192 flow [2025-01-10 06:51:02,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=59, PETRI_TRANSITIONS=60} [2025-01-10 06:51:02,386 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-01-10 06:51:02,386 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 192 flow [2025-01-10 06:51:02,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 24.833333333333332) internal successors, (149), 6 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:02,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:02,387 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-01-10 06:51:02,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:02,591 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:51:02,592 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:02,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:02,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1208406835, now seen corresponding path program 1 times [2025-01-10 06:51:02,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:02,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364346169] [2025-01-10 06:51:02,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:02,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:02,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:02,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:02,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:02,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:02,712 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:51:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364346169] [2025-01-10 06:51:02,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364346169] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:02,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061378459] [2025-01-10 06:51:02,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:02,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:02,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:02,715 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:51:02,717 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:51:02,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-01-10 06:51:02,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-01-10 06:51:02,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:02,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:02,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:02,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:02,804 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:51:02,804 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:02,835 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:51:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061378459] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:02,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-01-10 06:51:02,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933590657] [2025-01-10 06:51:02,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:02,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-10 06:51:02,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:02,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-10 06:51:02,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-01-10 06:51:02,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:02,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 60 transitions, 192 flow. Second operand has 12 states, 12 states have (on average 25.083333333333332) internal successors, (301), 12 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:51:02,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:02,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:02,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:03,025 INFO L124 PetriNetUnfolderBase]: 289/655 cut-off events. [2025-01-10 06:51:03,025 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-01-10 06:51:03,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 655 events. 289/655 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3587 event pairs, 157 based on Foata normal form. 6/499 useless extension candidates. Maximal degree in co-relation 1030. Up to 404 conditions per place. [2025-01-10 06:51:03,029 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 31 selfloop transitions, 25 changer transitions 0/78 dead transitions. [2025-01-10 06:51:03,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 418 flow [2025-01-10 06:51:03,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-10 06:51:03,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-10 06:51:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 302 transitions. [2025-01-10 06:51:03,031 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-01-10 06:51:03,031 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 192 flow. Second operand 10 states and 302 transitions. [2025-01-10 06:51:03,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 418 flow [2025-01-10 06:51:03,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 360 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:03,034 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 332 flow [2025-01-10 06:51:03,034 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=332, PETRI_PLACES=66, PETRI_TRANSITIONS=78} [2025-01-10 06:51:03,034 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-01-10 06:51:03,035 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 332 flow [2025-01-10 06:51:03,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 25.083333333333332) internal successors, (301), 12 states have internal predecessors, (301), 0 states have call successors, (0), 0 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:51:03,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:03,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:03,041 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:51:03,235 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:51:03,236 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:03,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:03,236 INFO L85 PathProgramCache]: Analyzing trace with hash 915480960, now seen corresponding path program 1 times [2025-01-10 06:51:03,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:03,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913286411] [2025-01-10 06:51:03,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:03,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:03,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-10 06:51:03,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-10 06:51:03,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:03,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:03,279 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:51:03,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:03,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913286411] [2025-01-10 06:51:03,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913286411] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:03,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:03,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:03,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276836443] [2025-01-10 06:51:03,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:03,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:03,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:03,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:03,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:03,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 06:51:03,287 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 78 transitions, 332 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:51:03,287 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:03,287 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 06:51:03,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:03,414 INFO L124 PetriNetUnfolderBase]: 514/1000 cut-off events. [2025-01-10 06:51:03,414 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-01-10 06:51:03,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 1000 events. 514/1000 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 5082 event pairs, 235 based on Foata normal form. 18/804 useless extension candidates. Maximal degree in co-relation 1814. Up to 600 conditions per place. [2025-01-10 06:51:03,418 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 82 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-01-10 06:51:03,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 566 flow [2025-01-10 06:51:03,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:03,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-01-10 06:51:03,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-01-10 06:51:03,420 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 332 flow. Second operand 4 states and 164 transitions. [2025-01-10 06:51:03,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 566 flow [2025-01-10 06:51:03,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 542 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:03,422 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 337 flow [2025-01-10 06:51:03,423 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=308, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=337, PETRI_PLACES=69, PETRI_TRANSITIONS=81} [2025-01-10 06:51:03,423 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-01-10 06:51:03,423 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 337 flow [2025-01-10 06:51:03,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 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:51:03,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:03,423 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:03,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-10 06:51:03,423 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:03,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:03,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1684891548, now seen corresponding path program 1 times [2025-01-10 06:51:03,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:03,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897733512] [2025-01-10 06:51:03,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:03,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:03,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-10 06:51:03,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-10 06:51:03,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:03,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:03,591 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:51:03,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:03,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897733512] [2025-01-10 06:51:03,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897733512] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:03,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:03,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:03,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974328785] [2025-01-10 06:51:03,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:03,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:03,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:03,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:03,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:03,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:03,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 81 transitions, 337 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:51:03,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:03,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:03,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:03,860 INFO L124 PetriNetUnfolderBase]: 1145/2219 cut-off events. [2025-01-10 06:51:03,862 INFO L125 PetriNetUnfolderBase]: For 361/363 co-relation queries the response was YES. [2025-01-10 06:51:03,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4282 conditions, 2219 events. 1145/2219 cut-off events. For 361/363 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 13418 event pairs, 584 based on Foata normal form. 34/1809 useless extension candidates. Maximal degree in co-relation 4215. Up to 806 conditions per place. [2025-01-10 06:51:03,890 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 77 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-01-10 06:51:03,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 583 flow [2025-01-10 06:51:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:03,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:03,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-01-10 06:51:03,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-01-10 06:51:03,895 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 337 flow. Second operand 5 states and 184 transitions. [2025-01-10 06:51:03,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 583 flow [2025-01-10 06:51:03,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:03,905 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 373 flow [2025-01-10 06:51:03,906 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=373, PETRI_PLACES=74, PETRI_TRANSITIONS=83} [2025-01-10 06:51:03,906 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2025-01-10 06:51:03,906 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 373 flow [2025-01-10 06:51:03,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:51:03,906 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:03,907 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:03,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-10 06:51:03,907 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:03,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:03,907 INFO L85 PathProgramCache]: Analyzing trace with hash -692029823, now seen corresponding path program 1 times [2025-01-10 06:51:03,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:03,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43710642] [2025-01-10 06:51:03,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:03,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:03,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:51:03,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:51:03,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:03,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:04,090 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:51:04,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43710642] [2025-01-10 06:51:04,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43710642] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:04,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:04,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:04,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165146656] [2025-01-10 06:51:04,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:04,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:04,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:04,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:04,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:04,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:04,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 373 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:51:04,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:04,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:04,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:04,526 INFO L124 PetriNetUnfolderBase]: 2048/4034 cut-off events. [2025-01-10 06:51:04,526 INFO L125 PetriNetUnfolderBase]: For 1286/1286 co-relation queries the response was YES. [2025-01-10 06:51:04,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8025 conditions, 4034 events. 2048/4034 cut-off events. For 1286/1286 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 28021 event pairs, 1050 based on Foata normal form. 90/3467 useless extension candidates. Maximal degree in co-relation 7928. Up to 1396 conditions per place. [2025-01-10 06:51:04,571 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 94 selfloop transitions, 10 changer transitions 0/125 dead transitions. [2025-01-10 06:51:04,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 125 transitions, 754 flow [2025-01-10 06:51:04,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 187 transitions. [2025-01-10 06:51:04,574 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6233333333333333 [2025-01-10 06:51:04,574 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 373 flow. Second operand 5 states and 187 transitions. [2025-01-10 06:51:04,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 125 transitions, 754 flow [2025-01-10 06:51:04,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 125 transitions, 748 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:04,585 INFO L231 Difference]: Finished difference. Result has 80 places, 90 transitions, 462 flow [2025-01-10 06:51:04,585 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=462, PETRI_PLACES=80, PETRI_TRANSITIONS=90} [2025-01-10 06:51:04,586 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2025-01-10 06:51:04,586 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 90 transitions, 462 flow [2025-01-10 06:51:04,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:51:04,586 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:04,586 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:04,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-10 06:51:04,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:04,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:04,586 INFO L85 PathProgramCache]: Analyzing trace with hash -448712887, now seen corresponding path program 1 times [2025-01-10 06:51:04,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:04,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886388494] [2025-01-10 06:51:04,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:04,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:04,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-01-10 06:51:04,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-01-10 06:51:04,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:04,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:04,671 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:51:04,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:04,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886388494] [2025-01-10 06:51:04,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886388494] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:04,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:04,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-10 06:51:04,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504441650] [2025-01-10 06:51:04,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:04,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:04,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:04,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:04,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:04,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 06:51:04,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 90 transitions, 462 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:51:04,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:04,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 06:51:04,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:05,081 INFO L124 PetriNetUnfolderBase]: 3020/5488 cut-off events. [2025-01-10 06:51:05,082 INFO L125 PetriNetUnfolderBase]: For 1184/1300 co-relation queries the response was YES. [2025-01-10 06:51:05,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11194 conditions, 5488 events. 3020/5488 cut-off events. For 1184/1300 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 36153 event pairs, 1356 based on Foata normal form. 100/4905 useless extension candidates. Maximal degree in co-relation 11091. Up to 3267 conditions per place. [2025-01-10 06:51:05,116 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 91 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2025-01-10 06:51:05,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 121 transitions, 740 flow [2025-01-10 06:51:05,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:05,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-01-10 06:51:05,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-01-10 06:51:05,121 INFO L175 Difference]: Start difference. First operand has 80 places, 90 transitions, 462 flow. Second operand 4 states and 162 transitions. [2025-01-10 06:51:05,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 121 transitions, 740 flow [2025-01-10 06:51:05,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 121 transitions, 729 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:05,128 INFO L231 Difference]: Finished difference. Result has 84 places, 93 transitions, 480 flow [2025-01-10 06:51:05,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=480, PETRI_PLACES=84, PETRI_TRANSITIONS=93} [2025-01-10 06:51:05,129 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 31 predicate places. [2025-01-10 06:51:05,130 INFO L471 AbstractCegarLoop]: Abstraction has has 84 places, 93 transitions, 480 flow [2025-01-10 06:51:05,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:51:05,130 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:05,130 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:05,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-10 06:51:05,130 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:05,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash 14115187, now seen corresponding path program 1 times [2025-01-10 06:51:05,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:05,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856937990] [2025-01-10 06:51:05,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:05,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:51:05,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:51:05,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:05,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:05,284 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:51:05,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856937990] [2025-01-10 06:51:05,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856937990] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:05,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336388339] [2025-01-10 06:51:05,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:05,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:05,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:05,287 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:51:05,289 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:51:05,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:51:05,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:51:05,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:05,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:05,342 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:05,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:05,387 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:51:05,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:05,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336388339] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:05,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:05,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-01-10 06:51:05,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943374678] [2025-01-10 06:51:05,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:05,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-10 06:51:05,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:05,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-10 06:51:05,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-10 06:51:05,397 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 06:51:05,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 93 transitions, 480 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:51:05,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:05,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 06:51:05,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:05,652 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L77-->thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_10 2147483648) v_~n1~0_10) InVars {~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10} OutVars{~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10} AuxVars[] AssignedVars[][76], [Black: 157#(= thread1Thread1of1ForFork0_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork0_#t~post5| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 170#true, Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 163#true, 56#true, 167#(<= ~n2~0 ~n1~0), Black: 173#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 174#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 183#(and (= thread2Thread1of1ForFork1_~i~1 0) (= 0 |thread2Thread1of1ForFork1_#t~post10|)), 28#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 12#L98-4true, Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 180#(= thread2Thread1of1ForFork1_~i~1 0), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 196#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 178#true, 23#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue]) [2025-01-10 06:51:05,653 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-10 06:51:05,653 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-10 06:51:05,653 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-10 06:51:05,653 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 06:51:05,664 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([597] L77-->thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_10 2147483648) v_~n1~0_10) InVars {~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10} OutVars{~n2~0=v_~n2~0_10, ~n1~0=v_~n1~0_10} AuxVars[] AssignedVars[][76], [Black: 157#(= thread1Thread1of1ForFork0_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork0_#t~post5| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 170#true, Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 33#L99true, Black: 163#true, 56#true, 167#(<= ~n2~0 ~n1~0), Black: 173#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 174#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 183#(and (= thread2Thread1of1ForFork1_~i~1 0) (= 0 |thread2Thread1of1ForFork1_#t~post10|)), 28#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 180#(= thread2Thread1of1ForFork1_~i~1 0), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 196#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 178#true, 23#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue]) [2025-01-10 06:51:05,664 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 06:51:05,664 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-10 06:51:05,664 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 06:51:05,664 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-10 06:51:05,665 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L57-1-->thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_5) v_~n1~0_5) InVars {~n2~0=v_~n2~0_5, ~n1~0=v_~n1~0_5} OutVars{~n2~0=v_~n2~0_5, ~n1~0=v_~n1~0_5} AuxVars[] AssignedVars[][69], [Black: 157#(= thread1Thread1of1ForFork0_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork0_#t~post5| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 170#true, Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), Black: 163#true, 56#true, 167#(<= ~n2~0 ~n1~0), Black: 173#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 174#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 183#(and (= thread2Thread1of1ForFork1_~i~1 0) (= 0 |thread2Thread1of1ForFork1_#t~post10|)), 28#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 12#L98-4true, Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 180#(= thread2Thread1of1ForFork1_~i~1 0), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 196#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 178#true, 23#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue]) [2025-01-10 06:51:05,665 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-01-10 06:51:05,665 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2025-01-10 06:51:05,665 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-01-10 06:51:05,665 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-10 06:51:05,674 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([582] L57-1-->thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_5) v_~n1~0_5) InVars {~n2~0=v_~n2~0_5, ~n1~0=v_~n1~0_5} OutVars{~n2~0=v_~n2~0_5, ~n1~0=v_~n1~0_5} AuxVars[] AssignedVars[][69], [Black: 157#(= thread1Thread1of1ForFork0_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork0_#t~post5| 0) (= thread1Thread1of1ForFork0_~i~0 0)), 170#true, Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 33#L99true, Black: 163#true, 56#true, 167#(<= ~n2~0 ~n1~0), Black: 173#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~size#1| ~n2~0)), Black: 174#(<= ~n1~0 ~n2~0), 96#true, Black: 147#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 1) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 1)), Black: 183#(and (= thread2Thread1of1ForFork1_~i~1 0) (= 0 |thread2Thread1of1ForFork1_#t~post10|)), 28#thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 180#(= thread2Thread1of1ForFork1_~i~1 0), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 196#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), 178#true, 23#thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOWtrue]) [2025-01-10 06:51:05,674 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-01-10 06:51:05,674 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-01-10 06:51:05,674 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-01-10 06:51:05,674 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-01-10 06:51:05,691 INFO L124 PetriNetUnfolderBase]: 2445/4902 cut-off events. [2025-01-10 06:51:05,691 INFO L125 PetriNetUnfolderBase]: For 2222/2242 co-relation queries the response was YES. [2025-01-10 06:51:05,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10560 conditions, 4902 events. 2445/4902 cut-off events. For 2222/2242 co-relation queries the response was YES. Maximal size of possible extension queue 223. Compared 35184 event pairs, 1358 based on Foata normal form. 142/4753 useless extension candidates. Maximal degree in co-relation 10455. Up to 3262 conditions per place. [2025-01-10 06:51:05,719 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 62 selfloop transitions, 1 changer transitions 0/89 dead transitions. [2025-01-10 06:51:05,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 89 transitions, 578 flow [2025-01-10 06:51:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-10 06:51:05,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-10 06:51:05,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-01-10 06:51:05,721 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-01-10 06:51:05,721 INFO L175 Difference]: Start difference. First operand has 84 places, 93 transitions, 480 flow. Second operand 3 states and 110 transitions. [2025-01-10 06:51:05,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 89 transitions, 578 flow [2025-01-10 06:51:05,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 89 transitions, 567 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:05,763 INFO L231 Difference]: Finished difference. Result has 80 places, 89 transitions, 443 flow [2025-01-10 06:51:05,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=80, PETRI_TRANSITIONS=89} [2025-01-10 06:51:05,764 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 27 predicate places. [2025-01-10 06:51:05,764 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 89 transitions, 443 flow [2025-01-10 06:51:05,764 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:51:05,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:05,764 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:05,770 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:51:05,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:05,965 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:05,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:05,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1598240730, now seen corresponding path program 1 times [2025-01-10 06:51:05,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:05,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989538050] [2025-01-10 06:51:05,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:05,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:05,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-01-10 06:51:05,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-01-10 06:51:05,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:05,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:06,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:51:06,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:06,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989538050] [2025-01-10 06:51:06,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989538050] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:06,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:06,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444600845] [2025-01-10 06:51:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:06,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:06,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:06,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:06,058 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 06:51:06,058 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 89 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:06,058 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:06,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 06:51:06,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:06,349 INFO L124 PetriNetUnfolderBase]: 1881/3728 cut-off events. [2025-01-10 06:51:06,349 INFO L125 PetriNetUnfolderBase]: For 1036/1044 co-relation queries the response was YES. [2025-01-10 06:51:06,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8099 conditions, 3728 events. 1881/3728 cut-off events. For 1036/1044 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 24822 event pairs, 1016 based on Foata normal form. 52/3655 useless extension candidates. Maximal degree in co-relation 8078. Up to 1801 conditions per place. [2025-01-10 06:51:06,367 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 106 selfloop transitions, 5 changer transitions 0/135 dead transitions. [2025-01-10 06:51:06,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 135 transitions, 841 flow [2025-01-10 06:51:06,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:06,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-01-10 06:51:06,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-01-10 06:51:06,368 INFO L175 Difference]: Start difference. First operand has 80 places, 89 transitions, 443 flow. Second operand 5 states and 205 transitions. [2025-01-10 06:51:06,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 135 transitions, 841 flow [2025-01-10 06:51:06,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 135 transitions, 840 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-10 06:51:06,373 INFO L231 Difference]: Finished difference. Result has 85 places, 91 transitions, 471 flow [2025-01-10 06:51:06,373 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=471, PETRI_PLACES=85, PETRI_TRANSITIONS=91} [2025-01-10 06:51:06,374 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2025-01-10 06:51:06,374 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 91 transitions, 471 flow [2025-01-10 06:51:06,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:06,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:06,374 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:06,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-10 06:51:06,374 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:06,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:06,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1271979943, now seen corresponding path program 1 times [2025-01-10 06:51:06,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:06,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046111672] [2025-01-10 06:51:06,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:06,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:06,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:06,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:06,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:06,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:06,491 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:51:06,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:06,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046111672] [2025-01-10 06:51:06,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046111672] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:06,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [614062175] [2025-01-10 06:51:06,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:06,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:06,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:06,494 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:51:06,499 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:51:06,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-10 06:51:06,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-10 06:51:06,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:06,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:06,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-10 06:51:06,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:06,595 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:51:06,595 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-10 06:51:06,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [614062175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:06,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-10 06:51:06,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2025-01-10 06:51:06,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026781570] [2025-01-10 06:51:06,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:06,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:06,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:06,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:06,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-10 06:51:06,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-01-10 06:51:06,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 91 transitions, 471 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:51:06,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:06,606 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-01-10 06:51:06,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:06,788 INFO L124 PetriNetUnfolderBase]: 1688/3472 cut-off events. [2025-01-10 06:51:06,789 INFO L125 PetriNetUnfolderBase]: For 1684/1738 co-relation queries the response was YES. [2025-01-10 06:51:06,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7457 conditions, 3472 events. 1688/3472 cut-off events. For 1684/1738 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23062 event pairs, 944 based on Foata normal form. 164/3419 useless extension candidates. Maximal degree in co-relation 7433. Up to 2287 conditions per place. [2025-01-10 06:51:06,805 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 58 selfloop transitions, 6 changer transitions 0/87 dead transitions. [2025-01-10 06:51:06,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 87 transitions, 573 flow [2025-01-10 06:51:06,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:06,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:06,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-01-10 06:51:06,806 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-01-10 06:51:06,806 INFO L175 Difference]: Start difference. First operand has 85 places, 91 transitions, 471 flow. Second operand 4 states and 136 transitions. [2025-01-10 06:51:06,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 87 transitions, 573 flow [2025-01-10 06:51:06,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 87 transitions, 559 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:06,810 INFO L231 Difference]: Finished difference. Result has 81 places, 87 transitions, 443 flow [2025-01-10 06:51:06,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=443, PETRI_PLACES=81, PETRI_TRANSITIONS=87} [2025-01-10 06:51:06,811 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2025-01-10 06:51:06,811 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 87 transitions, 443 flow [2025-01-10 06:51:06,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:51:06,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:06,811 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:06,817 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:51:07,011 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,SelfDestructingSolverStorable9 [2025-01-10 06:51:07,012 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:07,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:07,012 INFO L85 PathProgramCache]: Analyzing trace with hash -130145758, now seen corresponding path program 1 times [2025-01-10 06:51:07,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:07,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541360137] [2025-01-10 06:51:07,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:07,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:07,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-01-10 06:51:07,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-01-10 06:51:07,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:07,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,070 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:51:07,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:07,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541360137] [2025-01-10 06:51:07,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541360137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:07,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:07,070 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-10 06:51:07,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240721401] [2025-01-10 06:51:07,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:07,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:07,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:07,071 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:07,071 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:07,097 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 06:51:07,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 87 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:07,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:07,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 06:51:07,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:07,313 INFO L124 PetriNetUnfolderBase]: 1528/2998 cut-off events. [2025-01-10 06:51:07,314 INFO L125 PetriNetUnfolderBase]: For 1114/1178 co-relation queries the response was YES. [2025-01-10 06:51:07,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6648 conditions, 2998 events. 1528/2998 cut-off events. For 1114/1178 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 18498 event pairs, 884 based on Foata normal form. 40/2868 useless extension candidates. Maximal degree in co-relation 6627. Up to 1829 conditions per place. [2025-01-10 06:51:07,326 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 67 selfloop transitions, 3 changer transitions 29/119 dead transitions. [2025-01-10 06:51:07,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 119 transitions, 766 flow [2025-01-10 06:51:07,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:07,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-01-10 06:51:07,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-01-10 06:51:07,327 INFO L175 Difference]: Start difference. First operand has 81 places, 87 transitions, 443 flow. Second operand 5 states and 196 transitions. [2025-01-10 06:51:07,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 119 transitions, 766 flow [2025-01-10 06:51:07,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 119 transitions, 759 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:07,331 INFO L231 Difference]: Finished difference. Result has 85 places, 80 transitions, 392 flow [2025-01-10 06:51:07,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=392, PETRI_PLACES=85, PETRI_TRANSITIONS=80} [2025-01-10 06:51:07,332 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 32 predicate places. [2025-01-10 06:51:07,332 INFO L471 AbstractCegarLoop]: Abstraction has has 85 places, 80 transitions, 392 flow [2025-01-10 06:51:07,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:07,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:07,332 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-01-10 06:51:07,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-10 06:51:07,332 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:07,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:07,333 INFO L85 PathProgramCache]: Analyzing trace with hash 643332107, now seen corresponding path program 2 times [2025-01-10 06:51:07,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:07,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427105087] [2025-01-10 06:51:07,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:07,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:07,339 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:51:07,341 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:51:07,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:07,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,371 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:51:07,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427105087] [2025-01-10 06:51:07,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427105087] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:07,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44471144] [2025-01-10 06:51:07,372 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:07,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:07,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:07,374 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:51:07,375 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:51:07,413 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-01-10 06:51:07,420 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-01-10 06:51:07,421 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:07,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,421 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:51:07,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:07,439 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:51:07,439 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:07,455 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:51:07,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44471144] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:07,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:07,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-01-10 06:51:07,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899125600] [2025-01-10 06:51:07,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:07,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-10 06:51:07,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:07,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-10 06:51:07,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-10 06:51:07,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:07,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 80 transitions, 392 flow. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:51:07,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:07,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:07,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:07,620 INFO L124 PetriNetUnfolderBase]: 1201/2434 cut-off events. [2025-01-10 06:51:07,620 INFO L125 PetriNetUnfolderBase]: For 915/953 co-relation queries the response was YES. [2025-01-10 06:51:07,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5477 conditions, 2434 events. 1201/2434 cut-off events. For 915/953 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 15213 event pairs, 678 based on Foata normal form. 1/2292 useless extension candidates. Maximal degree in co-relation 5454. Up to 1641 conditions per place. [2025-01-10 06:51:07,632 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2025-01-10 06:51:07,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 79 transitions, 500 flow [2025-01-10 06:51:07,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-01-10 06:51:07,633 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-01-10 06:51:07,633 INFO L175 Difference]: Start difference. First operand has 85 places, 80 transitions, 392 flow. Second operand 4 states and 128 transitions. [2025-01-10 06:51:07,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 79 transitions, 500 flow [2025-01-10 06:51:07,637 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 79 transitions, 481 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-10 06:51:07,637 INFO L231 Difference]: Finished difference. Result has 78 places, 79 transitions, 395 flow [2025-01-10 06:51:07,637 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=395, PETRI_PLACES=78, PETRI_TRANSITIONS=79} [2025-01-10 06:51:07,638 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-01-10 06:51:07,638 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 79 transitions, 395 flow [2025-01-10 06:51:07,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:51:07,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:07,638 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:07,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:07,838 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,SelfDestructingSolverStorable11 [2025-01-10 06:51:07,839 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:07,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:07,839 INFO L85 PathProgramCache]: Analyzing trace with hash -1683043406, now seen corresponding path program 1 times [2025-01-10 06:51:07,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:07,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334719829] [2025-01-10 06:51:07,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:07,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:07,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-10 06:51:07,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-10 06:51:07,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:07,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:51:07,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:07,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334719829] [2025-01-10 06:51:07,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334719829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:07,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:07,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:07,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724223867] [2025-01-10 06:51:07,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:07,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:07,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:07,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:07,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 06:51:07,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 79 transitions, 395 flow. Second operand has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:07,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:07,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 06:51:07,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:08,068 INFO L124 PetriNetUnfolderBase]: 928/1859 cut-off events. [2025-01-10 06:51:08,068 INFO L125 PetriNetUnfolderBase]: For 529/531 co-relation queries the response was YES. [2025-01-10 06:51:08,071 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4055 conditions, 1859 events. 928/1859 cut-off events. For 529/531 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 10601 event pairs, 507 based on Foata normal form. 26/1823 useless extension candidates. Maximal degree in co-relation 4036. Up to 920 conditions per place. [2025-01-10 06:51:08,075 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 87 selfloop transitions, 9 changer transitions 0/115 dead transitions. [2025-01-10 06:51:08,075 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 115 transitions, 693 flow [2025-01-10 06:51:08,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:08,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2025-01-10 06:51:08,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2025-01-10 06:51:08,076 INFO L175 Difference]: Start difference. First operand has 78 places, 79 transitions, 395 flow. Second operand 5 states and 202 transitions. [2025-01-10 06:51:08,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 115 transitions, 693 flow [2025-01-10 06:51:08,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 115 transitions, 661 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:08,079 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 400 flow [2025-01-10 06:51:08,079 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=400, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2025-01-10 06:51:08,079 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 28 predicate places. [2025-01-10 06:51:08,079 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 400 flow [2025-01-10 06:51:08,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.4) internal successors, (147), 5 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:08,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:08,079 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-01-10 06:51:08,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-10 06:51:08,080 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:08,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:08,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1863572281, now seen corresponding path program 1 times [2025-01-10 06:51:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:08,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651443654] [2025-01-10 06:51:08,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:08,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:08,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:51:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:51:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:08,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651443654] [2025-01-10 06:51:08,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651443654] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:08,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833184624] [2025-01-10 06:51:08,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:08,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:08,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:08,183 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:51:08,184 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:51:08,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-10 06:51:08,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-10 06:51:08,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:08,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:08,233 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-10 06:51:08,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:08,263 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:08,371 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-10 06:51:08,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833184624] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:08,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:08,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-01-10 06:51:08,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520472157] [2025-01-10 06:51:08,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:08,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-01-10 06:51:08,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:08,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-01-10 06:51:08,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-01-10 06:51:08,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:08,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 400 flow. Second operand has 24 states, 24 states have (on average 25.083333333333332) internal successors, (602), 24 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:08,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:08,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:08,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:08,766 INFO L124 PetriNetUnfolderBase]: 859/1828 cut-off events. [2025-01-10 06:51:08,766 INFO L125 PetriNetUnfolderBase]: For 833/860 co-relation queries the response was YES. [2025-01-10 06:51:08,769 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 1828 events. 859/1828 cut-off events. For 833/860 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 10555 event pairs, 472 based on Foata normal form. 29/1749 useless extension candidates. Maximal degree in co-relation 4055. Up to 1149 conditions per place. [2025-01-10 06:51:08,772 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 35 selfloop transitions, 61 changer transitions 0/117 dead transitions. [2025-01-10 06:51:08,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 117 transitions, 856 flow [2025-01-10 06:51:08,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-10 06:51:08,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-01-10 06:51:08,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 625 transitions. [2025-01-10 06:51:08,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-01-10 06:51:08,774 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 400 flow. Second operand 22 states and 625 transitions. [2025-01-10 06:51:08,774 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 117 transitions, 856 flow [2025-01-10 06:51:08,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 117 transitions, 831 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-10 06:51:08,777 INFO L231 Difference]: Finished difference. Result has 106 places, 117 transitions, 807 flow [2025-01-10 06:51:08,778 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=807, PETRI_PLACES=106, PETRI_TRANSITIONS=117} [2025-01-10 06:51:08,778 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2025-01-10 06:51:08,778 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 117 transitions, 807 flow [2025-01-10 06:51:08,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 25.083333333333332) internal successors, (602), 24 states have internal predecessors, (602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:08,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:08,778 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:08,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:08,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-01-10 06:51:08,979 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:08,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:08,979 INFO L85 PathProgramCache]: Analyzing trace with hash -938205190, now seen corresponding path program 1 times [2025-01-10 06:51:08,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:08,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374040221] [2025-01-10 06:51:08,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:08,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:08,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-01-10 06:51:08,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-01-10 06:51:08,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:08,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-10 06:51:09,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:09,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374040221] [2025-01-10 06:51:09,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374040221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-10 06:51:09,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-10 06:51:09,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-10 06:51:09,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570213017] [2025-01-10 06:51:09,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-10 06:51:09,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:09,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:09,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:09,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:09,117 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-01-10 06:51:09,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 117 transitions, 807 flow. Second operand has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:09,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:09,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-01-10 06:51:09,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:09,286 INFO L124 PetriNetUnfolderBase]: 779/1591 cut-off events. [2025-01-10 06:51:09,286 INFO L125 PetriNetUnfolderBase]: For 896/928 co-relation queries the response was YES. [2025-01-10 06:51:09,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3780 conditions, 1591 events. 779/1591 cut-off events. For 896/928 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 8529 event pairs, 442 based on Foata normal form. 20/1525 useless extension candidates. Maximal degree in co-relation 3753. Up to 976 conditions per place. [2025-01-10 06:51:09,293 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 12 changer transitions 25/139 dead transitions. [2025-01-10 06:51:09,293 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 139 transitions, 1104 flow [2025-01-10 06:51:09,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:09,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-01-10 06:51:09,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-01-10 06:51:09,294 INFO L175 Difference]: Start difference. First operand has 106 places, 117 transitions, 807 flow. Second operand 5 states and 193 transitions. [2025-01-10 06:51:09,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 139 transitions, 1104 flow [2025-01-10 06:51:09,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 139 transitions, 948 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-01-10 06:51:09,299 INFO L231 Difference]: Finished difference. Result has 103 places, 114 transitions, 655 flow [2025-01-10 06:51:09,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=655, PETRI_PLACES=103, PETRI_TRANSITIONS=114} [2025-01-10 06:51:09,300 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 50 predicate places. [2025-01-10 06:51:09,300 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 114 transitions, 655 flow [2025-01-10 06:51:09,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.8) internal successors, (149), 5 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:09,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:09,300 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:09,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-10 06:51:09,300 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:09,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:09,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1238261139, now seen corresponding path program 1 times [2025-01-10 06:51:09,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:09,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257574528] [2025-01-10 06:51:09,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:09,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:09,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:51:09,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:51:09,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:09,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,366 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:51:09,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:09,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257574528] [2025-01-10 06:51:09,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257574528] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:09,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1130912896] [2025-01-10 06:51:09,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:09,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:09,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:09,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:09,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-10 06:51:09,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-01-10 06:51:09,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-01-10 06:51:09,427 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:09,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:09,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 06:51:09,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:09,527 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:09,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:09,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:09,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1130912896] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:09,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:09,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-01-10 06:51:09,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980702731] [2025-01-10 06:51:09,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:09,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:51:09,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:09,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:51:09,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:51:10,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-10 06:51:10,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 114 transitions, 655 flow. Second operand has 19 states, 19 states have (on average 23.157894736842106) internal successors, (440), 19 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:51:10,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:10,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-10 06:51:10,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:10,728 INFO L124 PetriNetUnfolderBase]: 1126/2199 cut-off events. [2025-01-10 06:51:10,728 INFO L125 PetriNetUnfolderBase]: For 1228/1274 co-relation queries the response was YES. [2025-01-10 06:51:10,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5399 conditions, 2199 events. 1126/2199 cut-off events. For 1228/1274 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 12699 event pairs, 284 based on Foata normal form. 52/2174 useless extension candidates. Maximal degree in co-relation 5371. Up to 413 conditions per place. [2025-01-10 06:51:10,740 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 200 selfloop transitions, 61 changer transitions 0/277 dead transitions. [2025-01-10 06:51:10,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 277 transitions, 1867 flow [2025-01-10 06:51:10,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:51:10,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:51:10,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 520 transitions. [2025-01-10 06:51:10,742 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2025-01-10 06:51:10,742 INFO L175 Difference]: Start difference. First operand has 103 places, 114 transitions, 655 flow. Second operand 17 states and 520 transitions. [2025-01-10 06:51:10,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 277 transitions, 1867 flow [2025-01-10 06:51:10,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 277 transitions, 1787 flow, removed 26 selfloop flow, removed 6 redundant places. [2025-01-10 06:51:10,753 INFO L231 Difference]: Finished difference. Result has 110 places, 143 transitions, 1063 flow [2025-01-10 06:51:10,753 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=615, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1063, PETRI_PLACES=110, PETRI_TRANSITIONS=143} [2025-01-10 06:51:10,753 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 57 predicate places. [2025-01-10 06:51:10,753 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 143 transitions, 1063 flow [2025-01-10 06:51:10,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.157894736842106) internal successors, (440), 19 states have internal predecessors, (440), 0 states have call successors, (0), 0 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:51:10,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:10,753 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:51:10,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-10 06:51:10,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:10,955 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:10,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:10,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1821818267, now seen corresponding path program 1 times [2025-01-10 06:51:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929996731] [2025-01-10 06:51:10,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:10,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:10,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:51:10,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:51:10,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:10,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,010 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-10 06:51:11,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929996731] [2025-01-10 06:51:11,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929996731] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:11,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [181374496] [2025-01-10 06:51:11,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:11,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:11,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:11,019 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:11,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-10 06:51:11,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-10 06:51:11,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-10 06:51:11,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:11,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:11,079 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 06:51:11,080 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:11,158 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:11,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:11,248 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-10 06:51:11,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [181374496] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:11,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:11,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-01-10 06:51:11,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042333967] [2025-01-10 06:51:11,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:11,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:51:11,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:11,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:51:11,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:51:11,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-10 06:51:11,627 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 143 transitions, 1063 flow. Second operand has 19 states, 19 states have (on average 23.36842105263158) internal successors, (444), 19 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:51:11,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:11,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-10 06:51:11,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:12,183 INFO L124 PetriNetUnfolderBase]: 1065/2050 cut-off events. [2025-01-10 06:51:12,183 INFO L125 PetriNetUnfolderBase]: For 1698/1710 co-relation queries the response was YES. [2025-01-10 06:51:12,188 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5102 conditions, 2050 events. 1065/2050 cut-off events. For 1698/1710 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 11158 event pairs, 289 based on Foata normal form. 44/1973 useless extension candidates. Maximal degree in co-relation 5074. Up to 445 conditions per place. [2025-01-10 06:51:12,191 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 122 selfloop transitions, 56 changer transitions 70/263 dead transitions. [2025-01-10 06:51:12,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 263 transitions, 2046 flow [2025-01-10 06:51:12,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-10 06:51:12,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-01-10 06:51:12,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 513 transitions. [2025-01-10 06:51:12,195 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5029411764705882 [2025-01-10 06:51:12,195 INFO L175 Difference]: Start difference. First operand has 110 places, 143 transitions, 1063 flow. Second operand 17 states and 513 transitions. [2025-01-10 06:51:12,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 263 transitions, 2046 flow [2025-01-10 06:51:12,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 263 transitions, 1971 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-01-10 06:51:12,204 INFO L231 Difference]: Finished difference. Result has 122 places, 137 transitions, 1124 flow [2025-01-10 06:51:12,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1034, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1124, PETRI_PLACES=122, PETRI_TRANSITIONS=137} [2025-01-10 06:51:12,205 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 69 predicate places. [2025-01-10 06:51:12,205 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 137 transitions, 1124 flow [2025-01-10 06:51:12,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.36842105263158) internal successors, (444), 19 states have internal predecessors, (444), 0 states have call successors, (0), 0 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:51:12,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:12,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:12,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-01-10 06:51:12,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-10 06:51:12,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:12,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:12,413 INFO L85 PathProgramCache]: Analyzing trace with hash -403423144, now seen corresponding path program 1 times [2025-01-10 06:51:12,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:12,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872865282] [2025-01-10 06:51:12,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:12,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:51:12,427 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:51:12,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 06:51:12,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:12,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872865282] [2025-01-10 06:51:12,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872865282] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:12,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1779475322] [2025-01-10 06:51:12,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:12,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:12,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:12,504 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:12,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-10 06:51:12,561 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-01-10 06:51:12,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-01-10 06:51:12,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:12,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:12,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 06:51:12,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:12,679 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:12,680 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:12,791 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:12,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1779475322] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:12,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:12,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-10 06:51:12,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740731108] [2025-01-10 06:51:12,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:12,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:51:12,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:12,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:51:12,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:51:13,144 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-10 06:51:13,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 137 transitions, 1124 flow. Second operand has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:51:13,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:13,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-10 06:51:13,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:13,725 INFO L124 PetriNetUnfolderBase]: 1429/2744 cut-off events. [2025-01-10 06:51:13,725 INFO L125 PetriNetUnfolderBase]: For 2412/2430 co-relation queries the response was YES. [2025-01-10 06:51:13,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7003 conditions, 2744 events. 1429/2744 cut-off events. For 2412/2430 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 15553 event pairs, 525 based on Foata normal form. 52/2712 useless extension candidates. Maximal degree in co-relation 6974. Up to 891 conditions per place. [2025-01-10 06:51:13,735 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 153 selfloop transitions, 91 changer transitions 10/269 dead transitions. [2025-01-10 06:51:13,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 269 transitions, 2136 flow [2025-01-10 06:51:13,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:51:13,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:51:13,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 453 transitions. [2025-01-10 06:51:13,737 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5392857142857143 [2025-01-10 06:51:13,737 INFO L175 Difference]: Start difference. First operand has 122 places, 137 transitions, 1124 flow. Second operand 14 states and 453 transitions. [2025-01-10 06:51:13,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 269 transitions, 2136 flow [2025-01-10 06:51:13,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 269 transitions, 1980 flow, removed 23 selfloop flow, removed 12 redundant places. [2025-01-10 06:51:13,748 INFO L231 Difference]: Finished difference. Result has 120 places, 145 transitions, 1293 flow [2025-01-10 06:51:13,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1293, PETRI_PLACES=120, PETRI_TRANSITIONS=145} [2025-01-10 06:51:13,748 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 67 predicate places. [2025-01-10 06:51:13,749 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 145 transitions, 1293 flow [2025-01-10 06:51:13,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.0) internal successors, (437), 19 states have internal predecessors, (437), 0 states have call successors, (0), 0 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:51:13,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:13,749 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:13,756 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:13,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-10 06:51:13,954 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:13,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:13,955 INFO L85 PathProgramCache]: Analyzing trace with hash -64866461, now seen corresponding path program 1 times [2025-01-10 06:51:13,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:13,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381855793] [2025-01-10 06:51:13,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:13,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:13,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:51:13,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:51:13,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:13,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,030 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-10 06:51:14,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381855793] [2025-01-10 06:51:14,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381855793] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:14,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [170414183] [2025-01-10 06:51:14,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-10 06:51:14,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:14,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:14,040 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:14,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-10 06:51:14,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-10 06:51:14,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-10 06:51:14,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-10 06:51:14,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:14,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-10 06:51:14,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:14,306 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:14,306 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-10 06:51:14,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [170414183] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:14,422 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:14,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-01-10 06:51:14,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180898461] [2025-01-10 06:51:14,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:14,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-10 06:51:14,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:14,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-10 06:51:14,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-01-10 06:51:14,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-01-10 06:51:14,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 145 transitions, 1293 flow. Second operand has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:14,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:14,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-01-10 06:51:14,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:15,260 INFO L124 PetriNetUnfolderBase]: 1584/3030 cut-off events. [2025-01-10 06:51:15,261 INFO L125 PetriNetUnfolderBase]: For 3083/3131 co-relation queries the response was YES. [2025-01-10 06:51:15,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7785 conditions, 3030 events. 1584/3030 cut-off events. For 3083/3131 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 16897 event pairs, 592 based on Foata normal form. 52/2976 useless extension candidates. Maximal degree in co-relation 7756. Up to 1119 conditions per place. [2025-01-10 06:51:15,274 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 105 selfloop transitions, 85 changer transitions 61/267 dead transitions. [2025-01-10 06:51:15,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 267 transitions, 2286 flow [2025-01-10 06:51:15,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-10 06:51:15,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-10 06:51:15,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 446 transitions. [2025-01-10 06:51:15,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.530952380952381 [2025-01-10 06:51:15,275 INFO L175 Difference]: Start difference. First operand has 120 places, 145 transitions, 1293 flow. Second operand 14 states and 446 transitions. [2025-01-10 06:51:15,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 267 transitions, 2286 flow [2025-01-10 06:51:15,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 267 transitions, 2201 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-10 06:51:15,285 INFO L231 Difference]: Finished difference. Result has 131 places, 142 transitions, 1404 flow [2025-01-10 06:51:15,285 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1244, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=82, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=1404, PETRI_PLACES=131, PETRI_TRANSITIONS=142} [2025-01-10 06:51:15,286 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 78 predicate places. [2025-01-10 06:51:15,286 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 142 transitions, 1404 flow [2025-01-10 06:51:15,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 23.210526315789473) internal successors, (441), 19 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:15,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:15,286 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:15,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:15,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:15,491 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:15,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:15,492 INFO L85 PathProgramCache]: Analyzing trace with hash 497825871, now seen corresponding path program 2 times [2025-01-10 06:51:15,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:15,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873398236] [2025-01-10 06:51:15,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:15,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:15,498 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:51:15,502 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-01-10 06:51:15,505 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:15,527 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:15,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873398236] [2025-01-10 06:51:15,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873398236] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:15,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715758804] [2025-01-10 06:51:15,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:15,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:15,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:15,530 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:15,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-10 06:51:15,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-01-10 06:51:15,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-01-10 06:51:15,600 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:15,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:15,600 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:51:15,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:15,631 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:15,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:15,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:15,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [715758804] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:15,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:15,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:51:15,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6931579] [2025-01-10 06:51:15,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:15,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:15,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:15,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:15,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:15,682 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 06:51:15,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 142 transitions, 1404 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:15,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:15,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 06:51:15,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:15,872 INFO L124 PetriNetUnfolderBase]: 1209/2269 cut-off events. [2025-01-10 06:51:15,872 INFO L125 PetriNetUnfolderBase]: For 3756/3760 co-relation queries the response was YES. [2025-01-10 06:51:15,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6775 conditions, 2269 events. 1209/2269 cut-off events. For 3756/3760 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11624 event pairs, 316 based on Foata normal form. 34/2249 useless extension candidates. Maximal degree in co-relation 6743. Up to 965 conditions per place. [2025-01-10 06:51:15,884 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 140 selfloop transitions, 12 changer transitions 7/176 dead transitions. [2025-01-10 06:51:15,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 176 transitions, 1883 flow [2025-01-10 06:51:15,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:15,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 183 transitions. [2025-01-10 06:51:15,885 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.61 [2025-01-10 06:51:15,885 INFO L175 Difference]: Start difference. First operand has 131 places, 142 transitions, 1404 flow. Second operand 5 states and 183 transitions. [2025-01-10 06:51:15,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 176 transitions, 1883 flow [2025-01-10 06:51:15,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 176 transitions, 1764 flow, removed 10 selfloop flow, removed 9 redundant places. [2025-01-10 06:51:15,895 INFO L231 Difference]: Finished difference. Result has 119 places, 143 transitions, 1359 flow [2025-01-10 06:51:15,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1359, PETRI_PLACES=119, PETRI_TRANSITIONS=143} [2025-01-10 06:51:15,895 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2025-01-10 06:51:15,895 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 143 transitions, 1359 flow [2025-01-10 06:51:15,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:15,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:15,895 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:15,901 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:16,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:16,096 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:16,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:16,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1958802949, now seen corresponding path program 2 times [2025-01-10 06:51:16,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:16,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965279663] [2025-01-10 06:51:16,097 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:16,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:16,104 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 06:51:16,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-01-10 06:51:16,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:16,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:16,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965279663] [2025-01-10 06:51:16,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965279663] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:16,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474542520] [2025-01-10 06:51:16,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:16,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:16,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:16,148 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:16,153 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-10 06:51:16,203 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-10 06:51:16,220 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-01-10 06:51:16,220 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:16,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,221 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-10 06:51:16,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:16,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:16,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:16,299 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-10 06:51:16,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474542520] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:16,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:16,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:51:16,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783679572] [2025-01-10 06:51:16,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:16,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:16,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:16,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:16,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:16,333 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-01-10 06:51:16,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 143 transitions, 1359 flow. Second operand has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:16,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:16,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-01-10 06:51:16,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:16,532 INFO L124 PetriNetUnfolderBase]: 1157/2169 cut-off events. [2025-01-10 06:51:16,532 INFO L125 PetriNetUnfolderBase]: For 4099/4121 co-relation queries the response was YES. [2025-01-10 06:51:16,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6706 conditions, 2169 events. 1157/2169 cut-off events. For 4099/4121 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11008 event pairs, 300 based on Foata normal form. 55/2172 useless extension candidates. Maximal degree in co-relation 6673. Up to 919 conditions per place. [2025-01-10 06:51:16,543 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 80 selfloop transitions, 1 changer transitions 93/177 dead transitions. [2025-01-10 06:51:16,543 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 177 transitions, 1866 flow [2025-01-10 06:51:16,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-10 06:51:16,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-10 06:51:16,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2025-01-10 06:51:16,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6 [2025-01-10 06:51:16,547 INFO L175 Difference]: Start difference. First operand has 119 places, 143 transitions, 1359 flow. Second operand 5 states and 180 transitions. [2025-01-10 06:51:16,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 177 transitions, 1866 flow [2025-01-10 06:51:16,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 177 transitions, 1843 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-01-10 06:51:16,557 INFO L231 Difference]: Finished difference. Result has 118 places, 84 transitions, 1046 flow [2025-01-10 06:51:16,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1046, PETRI_PLACES=118, PETRI_TRANSITIONS=84} [2025-01-10 06:51:16,557 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2025-01-10 06:51:16,558 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 84 transitions, 1046 flow [2025-01-10 06:51:16,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.6) internal successors, (143), 5 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-10 06:51:16,558 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-10 06:51:16,558 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-01-10 06:51:16,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:16,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:16,759 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-01-10 06:51:16,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-10 06:51:16,760 INFO L85 PathProgramCache]: Analyzing trace with hash -178769319, now seen corresponding path program 2 times [2025-01-10 06:51:16,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-10 06:51:16,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635407756] [2025-01-10 06:51:16,760 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:16,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-10 06:51:16,768 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 06:51:16,770 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-01-10 06:51:16,770 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:16,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,794 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:51:16,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-10 06:51:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635407756] [2025-01-10 06:51:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635407756] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-10 06:51:16,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191459105] [2025-01-10 06:51:16,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-10 06:51:16,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:16,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-10 06:51:16,796 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-10 06:51:16,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-01-10 06:51:16,859 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-01-10 06:51:16,868 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-01-10 06:51:16,868 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-10 06:51:16,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-10 06:51:16,869 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-10 06:51:16,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-10 06:51:16,903 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:51:16,903 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-10 06:51:16,946 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-01-10 06:51:16,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191459105] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-10 06:51:16,947 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-10 06:51:16,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-01-10 06:51:16,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695899801] [2025-01-10 06:51:16,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-10 06:51:16,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-10 06:51:16,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-10 06:51:16,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-10 06:51:16,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-10 06:51:16,973 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-01-10 06:51:16,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 84 transitions, 1046 flow. Second operand has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:51:16,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-10 06:51:16,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-01-10 06:51:16,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-10 06:51:16,998 INFO L124 PetriNetUnfolderBase]: 12/144 cut-off events. [2025-01-10 06:51:16,998 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2025-01-10 06:51:17,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 790 conditions, 144 events. 12/144 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 360 event pairs, 0 based on Foata normal form. 3/147 useless extension candidates. Maximal degree in co-relation 764. Up to 56 conditions per place. [2025-01-10 06:51:17,000 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-01-10 06:51:17,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 83 transitions, 1186 flow [2025-01-10 06:51:17,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-10 06:51:17,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-10 06:51:17,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-01-10 06:51:17,001 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2025-01-10 06:51:17,001 INFO L175 Difference]: Start difference. First operand has 118 places, 84 transitions, 1046 flow. Second operand 4 states and 103 transitions. [2025-01-10 06:51:17,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 83 transitions, 1186 flow [2025-01-10 06:51:17,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 1000 flow, removed 3 selfloop flow, removed 15 redundant places. [2025-01-10 06:51:17,004 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-01-10 06:51:17,004 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=838, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=0, PETRI_PLACES=60, PETRI_TRANSITIONS=0} [2025-01-10 06:51:17,004 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-01-10 06:51:17,004 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-01-10 06:51:17,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.2) internal successors, (126), 5 states have internal predecessors, (126), 0 states have call successors, (0), 0 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:51:17,006 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-01-10 06:51:17,007 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-01-10 06:51:17,008 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-01-10 06:51:17,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-01-10 06:51:17,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-10 06:51:17,210 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-10 06:51:17,214 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-10 06:51:17,214 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-10 06:51:17,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 06:51:17 BasicIcfg [2025-01-10 06:51:17,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-10 06:51:17,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-10 06:51:17,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-10 06:51:17,220 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-10 06:51:17,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:51:01" (3/4) ... [2025-01-10 06:51:17,221 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-10 06:51:17,223 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-10 06:51:17,223 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-10 06:51:17,230 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 135 nodes and edges [2025-01-10 06:51:17,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 24 nodes and edges [2025-01-10 06:51:17,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-10 06:51:17,231 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-10 06:51:17,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-10 06:51:17,283 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-10 06:51:17,284 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-10 06:51:17,285 INFO L158 Benchmark]: Toolchain (without parser) took 16889.24ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 110.3MB in the beginning and 392.8MB in the end (delta: -282.5MB). Peak memory consumption was 62.8MB. Max. memory is 16.1GB. [2025-01-10 06:51:17,285 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:17,285 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.67ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 98.2MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-10 06:51:17,286 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.07ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:17,286 INFO L158 Benchmark]: Boogie Preprocessor took 45.84ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:17,286 INFO L158 Benchmark]: RCFGBuilder took 672.96ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 43.2MB in the end (delta: 51.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-10 06:51:17,286 INFO L158 Benchmark]: TraceAbstraction took 15837.57ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 43.2MB in the beginning and 400.9MB in the end (delta: -357.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-10 06:51:17,286 INFO L158 Benchmark]: Witness Printer took 64.55ms. Allocated memory is still 486.5MB. Free memory was 400.9MB in the beginning and 392.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-10 06:51:17,287 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.67ms. Allocated memory is still 142.6MB. Free memory was 110.3MB in the beginning and 98.2MB in the end (delta: 12.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.07ms. Allocated memory is still 142.6MB. Free memory was 98.2MB in the beginning and 96.3MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 45.84ms. Allocated memory is still 142.6MB. Free memory was 96.3MB in the beginning and 94.5MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 672.96ms. Allocated memory is still 142.6MB. Free memory was 94.5MB in the beginning and 43.2MB in the end (delta: 51.3MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15837.57ms. Allocated memory was 142.6MB in the beginning and 486.5MB in the end (delta: 343.9MB). Free memory was 43.2MB in the beginning and 400.9MB in the end (delta: -357.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 64.55ms. Allocated memory is still 486.5MB. Free memory was 400.9MB in the beginning and 392.8MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 49]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 57]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 69]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 77]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 115]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 85 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 15.7s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2618 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2288 mSDsluCounter, 2120 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2065 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10216 IncrementalHoareTripleChecker+Invalid, 10370 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 55 mSDtfsCounter, 10216 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 610 GetRequests, 391 SyntacticMatches, 11 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1404occurred in iteration=19, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 622 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 2590 SizeOfPredicates, 49 NumberOfNonLiveVariables, 1728 ConjunctsInSsa, 91 ConjunctsInUnsatCore, 45 InterpolantComputations, 12 PerfectInterpolantSequences, 683/928 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-10 06:51:17,311 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE