./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 48c9605d 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-?-48c9605-m [2025-02-08 14:09:35,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 14:09:35,453 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-02-08 14:09:35,460 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 14:09:35,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 14:09:35,488 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 14:09:35,489 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 14:09:35,489 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 14:09:35,489 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 14:09:35,489 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 14:09:35,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 14:09:35,489 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 14:09:35,489 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 14:09:35,489 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 14:09:35,489 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 14:09:35,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 14:09:35,490 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 14:09:35,490 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:35,490 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 14:09:35,491 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 14:09:35,491 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-02-08 14:09:35,731 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 14:09:35,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 14:09:35,737 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 14:09:35,738 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 14:09:35,738 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 14:09:35,739 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-02-08 14:09:36,914 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed9d9731/f9663269b0d444ecb15df5b6a120dc38/FLAG7b4bffebf [2025-02-08 14:09:37,221 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 14:09:37,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-word-symm.wvr.c [2025-02-08 14:09:37,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed9d9731/f9663269b0d444ecb15df5b6a120dc38/FLAG7b4bffebf [2025-02-08 14:09:37,507 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ed9d9731/f9663269b0d444ecb15df5b6a120dc38 [2025-02-08 14:09:37,510 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 14:09:37,511 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 14:09:37,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:37,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 14:09:37,515 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 14:09:37,516 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,520 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bed23b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37, skipping insertion in model container [2025-02-08 14:09:37,521 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,545 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 14:09:37,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:37,817 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 14:09:37,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 14:09:37,884 INFO L204 MainTranslator]: Completed translation [2025-02-08 14:09:37,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37 WrapperNode [2025-02-08 14:09:37,888 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 14:09:37,889 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:37,889 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 14:09:37,889 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 14:09:37,894 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,907 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,942 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 123 [2025-02-08 14:09:37,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 14:09:37,947 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 14:09:37,947 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 14:09:37,947 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 14:09:37,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,989 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-02-08 14:09:37,995 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:37,995 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:38,008 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:38,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:38,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:38,024 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:38,026 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 14:09:38,026 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 14:09:38,026 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 14:09:38,026 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 14:09:38,027 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (1/1) ... [2025-02-08 14:09:38,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 14:09:38,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:38,056 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 14:09:38,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 14:09:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 14:09:38,077 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 14:09:38,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 14:09:38,078 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 14:09:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 14:09:38,078 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 14:09:38,078 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 14:09:38,171 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 14:09:38,172 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 14:09:38,489 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 14:09:38,490 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 14:09:38,637 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 14:09:38,637 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 14:09:38,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:38 BoogieIcfgContainer [2025-02-08 14:09:38,637 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 14:09:38,639 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 14:09:38,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 14:09:38,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 14:09:38,642 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 02:09:37" (1/3) ... [2025-02-08 14:09:38,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8605c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:38, skipping insertion in model container [2025-02-08 14:09:38,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 02:09:37" (2/3) ... [2025-02-08 14:09:38,643 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8605c5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 02:09:38, skipping insertion in model container [2025-02-08 14:09:38,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:38" (3/3) ... [2025-02-08 14:09:38,644 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-word-symm.wvr.c [2025-02-08 14:09:38,654 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 14:09:38,655 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-02-08 14:09:38,655 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 14:09:38,717 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 14:09:38,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 57 places, 60 transitions, 134 flow [2025-02-08 14:09:38,758 INFO L124 PetriNetUnfolderBase]: 10/58 cut-off events. [2025-02-08 14:09:38,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 14:09:38,761 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 160 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-02-08 14:09:38,762 INFO L82 GeneralOperation]: Start removeDead. Operand has 57 places, 60 transitions, 134 flow [2025-02-08 14:09:38,764 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 53 places, 56 transitions, 121 flow [2025-02-08 14:09:38,769 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 14:09:38,776 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;@184164ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 14:09:38,776 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-02-08 14:09:38,779 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 14:09:38,779 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-02-08 14:09:38,779 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 14:09:38,779 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:38,779 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-02-08 14:09:38,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:38,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:38,783 INFO L85 PathProgramCache]: Analyzing trace with hash 498711, now seen corresponding path program 1 times [2025-02-08 14:09:38,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:38,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310719212] [2025-02-08 14:09:38,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:38,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:38,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-02-08 14:09:38,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-02-08 14:09:38,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:38,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:38,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310719212] [2025-02-08 14:09:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310719212] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:38,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:38,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817587496] [2025-02-08 14:09:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:38,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:38,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:38,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:38,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:38,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:39,001 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-02-08 14:09:39,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:39,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:39,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:39,169 INFO L124 PetriNetUnfolderBase]: 291/673 cut-off events. [2025-02-08 14:09:39,169 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 14:09:39,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1114 conditions, 673 events. 291/673 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3749 event pairs, 157 based on Foata normal form. 2/493 useless extension candidates. Maximal degree in co-relation 1021. Up to 410 conditions per place. [2025-02-08 14:09:39,176 INFO L140 encePairwiseOnDemand]: 49/60 looper letters, 33 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2025-02-08 14:09:39,176 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 62 transitions, 213 flow [2025-02-08 14:09:39,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:39,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2025-02-08 14:09:39,189 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5833333333333334 [2025-02-08 14:09:39,190 INFO L175 Difference]: Start difference. First operand has 53 places, 56 transitions, 121 flow. Second operand 4 states and 140 transitions. [2025-02-08 14:09:39,191 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 62 transitions, 213 flow [2025-02-08 14:09:39,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:39,196 INFO L231 Difference]: Finished difference. Result has 56 places, 62 transitions, 176 flow [2025-02-08 14:09:39,197 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-02-08 14:09:39,200 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 3 predicate places. [2025-02-08 14:09:39,200 INFO L471 AbstractCegarLoop]: Abstraction has has 56 places, 62 transitions, 176 flow [2025-02-08 14:09:39,200 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-02-08 14:09:39,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:39,200 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-02-08 14:09:39,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 14:09:39,201 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:39,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:39,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1972624149, now seen corresponding path program 1 times [2025-02-08 14:09:39,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:39,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585780319] [2025-02-08 14:09:39,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:39,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:39,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:39,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:39,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:39,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:39,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585780319] [2025-02-08 14:09:39,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585780319] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:39,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454904281] [2025-02-08 14:09:39,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:39,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:39,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:39,289 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:39,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 14:09:39,329 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 14:09:39,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 14:09:39,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:39,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:39,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:39,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:39,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:09:39,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454904281] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:39,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:09:39,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-02-08 14:09:39,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928306266] [2025-02-08 14:09:39,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:39,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:39,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:39,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:09:39,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:39,389 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-02-08 14:09:39,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:39,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:39,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:39,533 INFO L124 PetriNetUnfolderBase]: 291/671 cut-off events. [2025-02-08 14:09:39,534 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-08 14:09:39,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 671 events. 291/671 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3737 event pairs, 157 based on Foata normal form. 2/494 useless extension candidates. Maximal degree in co-relation 1075. Up to 400 conditions per place. [2025-02-08 14:09:39,538 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 26 selfloop transitions, 12 changer transitions 0/60 dead transitions. [2025-02-08 14:09:39,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 60 transitions, 244 flow [2025-02-08 14:09:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 14:09:39,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 14:09:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 184 transitions. [2025-02-08 14:09:39,540 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5111111111111111 [2025-02-08 14:09:39,540 INFO L175 Difference]: Start difference. First operand has 56 places, 62 transitions, 176 flow. Second operand 6 states and 184 transitions. [2025-02-08 14:09:39,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 60 transitions, 244 flow [2025-02-08 14:09:39,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 244 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 14:09:39,542 INFO L231 Difference]: Finished difference. Result has 59 places, 60 transitions, 192 flow [2025-02-08 14:09:39,542 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-02-08 14:09:39,543 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 6 predicate places. [2025-02-08 14:09:39,543 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 60 transitions, 192 flow [2025-02-08 14:09:39,543 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-02-08 14:09:39,543 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:39,543 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-02-08 14:09:39,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 14:09:39,747 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-02-08 14:09:39,747 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:39,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:39,748 INFO L85 PathProgramCache]: Analyzing trace with hash 1021806902, now seen corresponding path program 1 times [2025-02-08 14:09:39,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:39,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094875570] [2025-02-08 14:09:39,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:39,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:39,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:09:39,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:09:39,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:39,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,827 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:39,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:39,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094875570] [2025-02-08 14:09:39,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094875570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:39,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [372902813] [2025-02-08 14:09:39,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:39,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:39,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:39,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:39,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 14:09:39,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-08 14:09:39,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-08 14:09:39,889 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:39,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:39,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:39,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:39,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:39,912 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:39,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [372902813] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:39,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:39,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-02-08 14:09:39,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102161818] [2025-02-08 14:09:39,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:39,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-08 14:09:39,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:39,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-08 14:09:39,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-08 14:09:39,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:39,966 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-02-08 14:09:39,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:39,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:39,966 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:40,150 INFO L124 PetriNetUnfolderBase]: 297/695 cut-off events. [2025-02-08 14:09:40,150 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-02-08 14:09:40,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1219 conditions, 695 events. 297/695 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 3977 event pairs, 157 based on Foata normal form. 6/521 useless extension candidates. Maximal degree in co-relation 1077. Up to 411 conditions per place. [2025-02-08 14:09:40,154 INFO L140 encePairwiseOnDemand]: 51/60 looper letters, 31 selfloop transitions, 25 changer transitions 0/78 dead transitions. [2025-02-08 14:09:40,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 78 transitions, 418 flow [2025-02-08 14:09:40,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 14:09:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 14:09:40,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 302 transitions. [2025-02-08 14:09:40,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033333333333333 [2025-02-08 14:09:40,156 INFO L175 Difference]: Start difference. First operand has 59 places, 60 transitions, 192 flow. Second operand 10 states and 302 transitions. [2025-02-08 14:09:40,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 78 transitions, 418 flow [2025-02-08 14:09:40,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 78 transitions, 360 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:40,159 INFO L231 Difference]: Finished difference. Result has 66 places, 78 transitions, 332 flow [2025-02-08 14:09:40,159 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-02-08 14:09:40,159 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 13 predicate places. [2025-02-08 14:09:40,160 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 78 transitions, 332 flow [2025-02-08 14:09:40,160 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-02-08 14:09:40,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:40,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:40,166 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 14:09:40,364 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-02-08 14:09:40,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:40,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:40,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1648226969, now seen corresponding path program 1 times [2025-02-08 14:09:40,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:40,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385955388] [2025-02-08 14:09:40,366 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:40,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:40,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-02-08 14:09:40,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-02-08 14:09:40,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:40,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:40,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:40,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:40,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385955388] [2025-02-08 14:09:40,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385955388] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:40,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:40,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:40,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497707908] [2025-02-08 14:09:40,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:40,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:40,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:40,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:40,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:40,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-02-08 14:09:40,439 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-02-08 14:09:40,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:40,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-02-08 14:09:40,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:40,570 INFO L124 PetriNetUnfolderBase]: 513/1003 cut-off events. [2025-02-08 14:09:40,570 INFO L125 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-02-08 14:09:40,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1881 conditions, 1003 events. 513/1003 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 5189 event pairs, 233 based on Foata normal form. 18/806 useless extension candidates. Maximal degree in co-relation 1814. Up to 597 conditions per place. [2025-02-08 14:09:40,578 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 82 selfloop transitions, 4 changer transitions 0/107 dead transitions. [2025-02-08 14:09:40,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 107 transitions, 566 flow [2025-02-08 14:09:40,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:40,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:40,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 164 transitions. [2025-02-08 14:09:40,580 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-02-08 14:09:40,580 INFO L175 Difference]: Start difference. First operand has 66 places, 78 transitions, 332 flow. Second operand 4 states and 164 transitions. [2025-02-08 14:09:40,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 107 transitions, 566 flow [2025-02-08 14:09:40,582 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 107 transitions, 542 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:40,583 INFO L231 Difference]: Finished difference. Result has 69 places, 81 transitions, 337 flow [2025-02-08 14:09:40,583 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-02-08 14:09:40,584 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 16 predicate places. [2025-02-08 14:09:40,584 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 81 transitions, 337 flow [2025-02-08 14:09:40,584 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-02-08 14:09:40,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:40,584 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:40,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 14:09:40,584 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:40,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:40,585 INFO L85 PathProgramCache]: Analyzing trace with hash -444602813, now seen corresponding path program 1 times [2025-02-08 14:09:40,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:40,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21849766] [2025-02-08 14:09:40,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:40,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:40,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-02-08 14:09:40,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-02-08 14:09:40,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:40,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:40,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:40,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:40,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21849766] [2025-02-08 14:09:40,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21849766] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:40,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:40,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:40,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108510615] [2025-02-08 14:09:40,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:40,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:40,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:40,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:40,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:40,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:40,709 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-02-08 14:09:40,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:40,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:40,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:40,916 INFO L124 PetriNetUnfolderBase]: 1170/2280 cut-off events. [2025-02-08 14:09:40,916 INFO L125 PetriNetUnfolderBase]: For 341/341 co-relation queries the response was YES. [2025-02-08 14:09:40,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4406 conditions, 2280 events. 1170/2280 cut-off events. For 341/341 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 14054 event pairs, 586 based on Foata normal form. 26/1847 useless extension candidates. Maximal degree in co-relation 4339. Up to 812 conditions per place. [2025-02-08 14:09:40,927 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 77 selfloop transitions, 10 changer transitions 0/108 dead transitions. [2025-02-08 14:09:40,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 108 transitions, 583 flow [2025-02-08 14:09:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:40,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-02-08 14:09:40,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2025-02-08 14:09:40,928 INFO L175 Difference]: Start difference. First operand has 69 places, 81 transitions, 337 flow. Second operand 5 states and 184 transitions. [2025-02-08 14:09:40,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 108 transitions, 583 flow [2025-02-08 14:09:40,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 108 transitions, 578 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:40,931 INFO L231 Difference]: Finished difference. Result has 74 places, 83 transitions, 373 flow [2025-02-08 14:09:40,931 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-02-08 14:09:40,932 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 21 predicate places. [2025-02-08 14:09:40,932 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 83 transitions, 373 flow [2025-02-08 14:09:40,932 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-02-08 14:09:40,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:40,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:40,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 14:09:40,932 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 667824922, now seen corresponding path program 1 times [2025-02-08 14:09:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092420658] [2025-02-08 14:09:40,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:40,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:09:40,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:09:40,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:40,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:40,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:40,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:40,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092420658] [2025-02-08 14:09:40,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092420658] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:40,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:40,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 14:09:40,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511615946] [2025-02-08 14:09:40,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:40,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:40,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:40,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:40,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:40,983 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 60 [2025-02-08 14:09:40,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 83 transitions, 373 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-02-08 14:09:40,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:40,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 60 [2025-02-08 14:09:40,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:41,229 INFO L124 PetriNetUnfolderBase]: 1521/2801 cut-off events. [2025-02-08 14:09:41,229 INFO L125 PetriNetUnfolderBase]: For 471/515 co-relation queries the response was YES. [2025-02-08 14:09:41,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5668 conditions, 2801 events. 1521/2801 cut-off events. For 471/515 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 16410 event pairs, 686 based on Foata normal form. 50/2501 useless extension candidates. Maximal degree in co-relation 5599. Up to 1646 conditions per place. [2025-02-08 14:09:41,244 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 86 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2025-02-08 14:09:41,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 114 transitions, 641 flow [2025-02-08 14:09:41,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:41,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 162 transitions. [2025-02-08 14:09:41,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.675 [2025-02-08 14:09:41,246 INFO L175 Difference]: Start difference. First operand has 74 places, 83 transitions, 373 flow. Second operand 4 states and 162 transitions. [2025-02-08 14:09:41,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 114 transitions, 641 flow [2025-02-08 14:09:41,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 114 transitions, 635 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:41,249 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 396 flow [2025-02-08 14:09:41,249 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=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=396, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2025-02-08 14:09:41,249 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 25 predicate places. [2025-02-08 14:09:41,249 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 396 flow [2025-02-08 14:09:41,250 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-02-08 14:09:41,250 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,250 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:41,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 14:09:41,250 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:41,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:41,250 INFO L85 PathProgramCache]: Analyzing trace with hash -897784837, now seen corresponding path program 1 times [2025-02-08 14:09:41,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:41,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971348403] [2025-02-08 14:09:41,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:41,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:41,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-08 14:09:41,259 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-08 14:09:41,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:41,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:41,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:41,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971348403] [2025-02-08 14:09:41,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971348403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:41,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:41,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 14:09:41,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201063368] [2025-02-08 14:09:41,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:41,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:41,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:41,336 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:41,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 396 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:41,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:41,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:41,745 INFO L124 PetriNetUnfolderBase]: 2916/5586 cut-off events. [2025-02-08 14:09:41,745 INFO L125 PetriNetUnfolderBase]: For 2286/2294 co-relation queries the response was YES. [2025-02-08 14:09:41,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12234 conditions, 5586 events. 2916/5586 cut-off events. For 2286/2294 co-relation queries the response was YES. Maximal size of possible extension queue 256. Compared 39330 event pairs, 1502 based on Foata normal form. 130/5303 useless extension candidates. Maximal degree in co-relation 12134. Up to 1930 conditions per place. [2025-02-08 14:09:41,775 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 103 selfloop transitions, 5 changer transitions 0/130 dead transitions. [2025-02-08 14:09:41,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 130 transitions, 803 flow [2025-02-08 14:09:41,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:41,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2025-02-08 14:09:41,776 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6791666666666667 [2025-02-08 14:09:41,776 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 396 flow. Second operand 4 states and 163 transitions. [2025-02-08 14:09:41,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 130 transitions, 803 flow [2025-02-08 14:09:41,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 130 transitions, 798 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:41,783 INFO L231 Difference]: Finished difference. Result has 82 places, 88 transitions, 430 flow [2025-02-08 14:09:41,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=393, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=430, PETRI_PLACES=82, PETRI_TRANSITIONS=88} [2025-02-08 14:09:41,783 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-02-08 14:09:41,783 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 88 transitions, 430 flow [2025-02-08 14:09:41,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:41,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:41,784 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:41,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 14:09:41,784 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:41,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:41,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1463901009, now seen corresponding path program 1 times [2025-02-08 14:09:41,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:41,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153757907] [2025-02-08 14:09:41,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:41,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:41,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:09:41,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:09:41,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:41,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:41,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:41,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:41,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153757907] [2025-02-08 14:09:41,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153757907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:41,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:41,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:09:41,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741172399] [2025-02-08 14:09:41,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:41,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:41,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:41,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:41,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:41,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 14:09:41,880 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 88 transitions, 430 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-02-08 14:09:41,880 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:41,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 14:09:41,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,189 INFO L124 PetriNetUnfolderBase]: 1902/3828 cut-off events. [2025-02-08 14:09:42,189 INFO L125 PetriNetUnfolderBase]: For 1213/1231 co-relation queries the response was YES. [2025-02-08 14:09:42,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8366 conditions, 3828 events. 1902/3828 cut-off events. For 1213/1231 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 25923 event pairs, 1026 based on Foata normal form. 52/3737 useless extension candidates. Maximal degree in co-relation 8265. Up to 1823 conditions per place. [2025-02-08 14:09:42,206 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 106 selfloop transitions, 5 changer transitions 0/139 dead transitions. [2025-02-08 14:09:42,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 139 transitions, 857 flow [2025-02-08 14:09:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2025-02-08 14:09:42,208 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6833333333333333 [2025-02-08 14:09:42,208 INFO L175 Difference]: Start difference. First operand has 82 places, 88 transitions, 430 flow. Second operand 5 states and 205 transitions. [2025-02-08 14:09:42,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 139 transitions, 857 flow [2025-02-08 14:09:42,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 139 transitions, 845 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-02-08 14:09:42,213 INFO L231 Difference]: Finished difference. Result has 87 places, 90 transitions, 449 flow [2025-02-08 14:09:42,213 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=449, PETRI_PLACES=87, PETRI_TRANSITIONS=90} [2025-02-08 14:09:42,214 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 34 predicate places. [2025-02-08 14:09:42,214 INFO L471 AbstractCegarLoop]: Abstraction has has 87 places, 90 transitions, 449 flow [2025-02-08 14:09:42,214 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-02-08 14:09:42,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,214 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 14:09:42,214 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:42,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1309215251, now seen corresponding path program 1 times [2025-02-08 14:09:42,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601496191] [2025-02-08 14:09:42,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:09:42,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:09:42,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:42,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601496191] [2025-02-08 14:09:42,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601496191] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:42,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542104943] [2025-02-08 14:09:42,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:42,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:42,337 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:42,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 14:09:42,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 14:09:42,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 14:09:42,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:42,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:42,396 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:42,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:09:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542104943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:42,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:09:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [5] total 6 [2025-02-08 14:09:42,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114000959] [2025-02-08 14:09:42,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:42,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 14:09:42,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:42,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 14:09:42,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-02-08 14:09:42,451 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-08 14:09:42,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 90 transitions, 449 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-02-08 14:09:42,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:42,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-08 14:09:42,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:42,685 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][69], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), 201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,685 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 14:09:42,685 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,685 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 14:09:42,685 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,688 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([509] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][65], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), 201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,688 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2025-02-08 14:09:42,688 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 14:09:42,688 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,688 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([525] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][69], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), 201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~n1~0 ~n2~0), 35#L99true, 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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,695 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 14:09:42,695 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 14:09:42,696 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,696 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,697 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([509] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][65], [Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), 201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~n1~0 ~n2~0), 35#L99true, 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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,697 INFO L294 olderBase$Statistics]: this new event has 29 ancestors and is cut-off event [2025-02-08 14:09:42,697 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,697 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,697 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 14:09:42,714 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([509] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][65], [201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,714 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-02-08 14:09:42,714 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 14:09:42,714 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,714 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 14:09:42,715 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,717 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([509] L57-->thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ 2147483647 v_~n2~0_3) v_~n1~0_3) InVars {~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} OutVars{~n2~0=v_~n2~0_3, ~n1~0=v_~n1~0_3} AuxVars[] AssignedVars[][65], [201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~n1~0 ~n2~0), 35#L99true, 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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,718 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-02-08 14:09:42,718 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,718 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 14:09:42,718 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,718 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 14:09:42,718 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][69], [201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 11#L98-1true, 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,718 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2025-02-08 14:09:42,718 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,719 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2025-02-08 14:09:42,719 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,719 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2025-02-08 14:09:42,721 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([525] L77-2-->thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW: Formula: (< (+ v_~n2~0_14 2147483648) v_~n1~0_14) InVars {~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} OutVars{~n2~0=v_~n2~0_14, ~n1~0=v_~n1~0_14} AuxVars[] AssignedVars[][69], [201#(and (<= 0 ~n1~0) (<= ~n2~0 2147483647)), Black: 157#(= thread1Thread1of1ForFork1_~i~0 0), Black: 160#(and (= |thread1Thread1of1ForFork1_#t~post5| 0) (= thread1Thread1of1ForFork1_~i~0 0)), Black: 65#(and (= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 0) (= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 0)), 14#thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, Black: 163#true, 56#true, 52#thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOWtrue, 167#(<= ~n2~0 ~n1~0), Black: 172#(= thread2Thread1of1ForFork0_~i~1 0), Black: 175#(and (= |thread2Thread1of1ForFork0_#t~post10| 0) (= thread2Thread1of1ForFork0_~i~1 0)), Black: 181#(<= ~n1~0 ~n2~0), 35#L99true, 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: 149#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483645) (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483645)), Black: 151#(and (<= |ULTIMATE.start_create_fresh_int_array_#t~post23#1| 2147483646) (<= |ULTIMATE.start_create_fresh_int_array_~i~2#1| 2147483646)), 184#true, Black: 187#(<= ~n1~0 0), Black: 188#(and (<= ~n1~0 0) (= thread1Thread1of1ForFork1_~i~0 0)), 178#true]) [2025-02-08 14:09:42,721 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2025-02-08 14:09:42,721 INFO L297 olderBase$Statistics]: existing Event has 25 ancestors and is cut-off event [2025-02-08 14:09:42,721 INFO L297 olderBase$Statistics]: existing Event has 23 ancestors and is cut-off event [2025-02-08 14:09:42,721 INFO L297 olderBase$Statistics]: existing Event has 24 ancestors and is cut-off event [2025-02-08 14:09:42,721 INFO L297 olderBase$Statistics]: existing Event has 29 ancestors and is cut-off event [2025-02-08 14:09:42,724 INFO L124 PetriNetUnfolderBase]: 1755/3596 cut-off events. [2025-02-08 14:09:42,724 INFO L125 PetriNetUnfolderBase]: For 1980/2040 co-relation queries the response was YES. [2025-02-08 14:09:42,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7849 conditions, 3596 events. 1755/3596 cut-off events. For 1980/2040 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 23912 event pairs, 946 based on Foata normal form. 117/3480 useless extension candidates. Maximal degree in co-relation 7746. Up to 2298 conditions per place. [2025-02-08 14:09:42,745 INFO L140 encePairwiseOnDemand]: 57/60 looper letters, 58 selfloop transitions, 1 changer transitions 0/86 dead transitions. [2025-02-08 14:09:42,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 86 transitions, 539 flow [2025-02-08 14:09:42,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 14:09:42,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 14:09:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2025-02-08 14:09:42,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6111111111111112 [2025-02-08 14:09:42,746 INFO L175 Difference]: Start difference. First operand has 87 places, 90 transitions, 449 flow. Second operand 3 states and 110 transitions. [2025-02-08 14:09:42,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 86 transitions, 539 flow [2025-02-08 14:09:42,751 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 86 transitions, 527 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:42,752 INFO L231 Difference]: Finished difference. Result has 82 places, 86 transitions, 411 flow [2025-02-08 14:09:42,752 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=411, PETRI_PLACES=82, PETRI_TRANSITIONS=86} [2025-02-08 14:09:42,752 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-02-08 14:09:42,752 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 86 transitions, 411 flow [2025-02-08 14:09:42,753 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-02-08 14:09:42,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:42,753 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:42,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:42,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:42,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:42,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1563343623, now seen corresponding path program 1 times [2025-02-08 14:09:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:42,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214655939] [2025-02-08 14:09:42,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:42,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:42,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:09:42,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:09:42,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:42,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:43,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214655939] [2025-02-08 14:09:43,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214655939] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:43,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768851582] [2025-02-08 14:09:43,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:43,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:43,101 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:43,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 14:09:43,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-02-08 14:09:43,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-02-08 14:09:43,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 14:09:43,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:43,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:43,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 14:09:43,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768851582] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 14:09:43,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 7 [2025-02-08 14:09:43,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871526547] [2025-02-08 14:09:43,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:43,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:43,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-02-08 14:09:43,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 60 [2025-02-08 14:09:43,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 86 transitions, 411 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-02-08 14:09:43,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 60 [2025-02-08 14:09:43,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,370 INFO L124 PetriNetUnfolderBase]: 1690/3482 cut-off events. [2025-02-08 14:09:43,370 INFO L125 PetriNetUnfolderBase]: For 1676/1724 co-relation queries the response was YES. [2025-02-08 14:09:43,378 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7455 conditions, 3482 events. 1690/3482 cut-off events. For 1676/1724 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 23073 event pairs, 944 based on Foata normal form. 158/3415 useless extension candidates. Maximal degree in co-relation 7433. Up to 2287 conditions per place. [2025-02-08 14:09:43,384 INFO L140 encePairwiseOnDemand]: 56/60 looper letters, 53 selfloop transitions, 6 changer transitions 0/82 dead transitions. [2025-02-08 14:09:43,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 82 transitions, 503 flow [2025-02-08 14:09:43,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:43,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:43,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2025-02-08 14:09:43,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2025-02-08 14:09:43,386 INFO L175 Difference]: Start difference. First operand has 82 places, 86 transitions, 411 flow. Second operand 4 states and 136 transitions. [2025-02-08 14:09:43,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 82 transitions, 503 flow [2025-02-08 14:09:43,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 82 transitions, 497 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:43,393 INFO L231 Difference]: Finished difference. Result has 79 places, 82 transitions, 391 flow [2025-02-08 14:09:43,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=391, PETRI_PLACES=79, PETRI_TRANSITIONS=82} [2025-02-08 14:09:43,393 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-02-08 14:09:43,393 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 82 transitions, 391 flow [2025-02-08 14:09:43,393 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-02-08 14:09:43,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,393 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:43,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:43,594 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-02-08 14:09:43,594 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:43,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1641307217, now seen corresponding path program 1 times [2025-02-08 14:09:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190256361] [2025-02-08 14:09:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-08 14:09:43,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-08 14:09:43,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:43,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:43,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190256361] [2025-02-08 14:09:43,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190256361] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:43,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:43,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 14:09:43,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463662650] [2025-02-08 14:09:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:43,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:43,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:43,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:43,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:43,680 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 14:09:43,681 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 82 transitions, 391 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-02-08 14:09:43,681 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:43,681 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 14:09:43,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:43,880 INFO L124 PetriNetUnfolderBase]: 1536/3030 cut-off events. [2025-02-08 14:09:43,881 INFO L125 PetriNetUnfolderBase]: For 1109/1163 co-relation queries the response was YES. [2025-02-08 14:09:43,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6738 conditions, 3030 events. 1536/3030 cut-off events. For 1109/1163 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 18711 event pairs, 886 based on Foata normal form. 34/2898 useless extension candidates. Maximal degree in co-relation 6718. Up to 1833 conditions per place. [2025-02-08 14:09:43,892 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 67 selfloop transitions, 3 changer transitions 29/119 dead transitions. [2025-02-08 14:09:43,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 119 transitions, 740 flow [2025-02-08 14:09:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 196 transitions. [2025-02-08 14:09:43,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2025-02-08 14:09:43,893 INFO L175 Difference]: Start difference. First operand has 79 places, 82 transitions, 391 flow. Second operand 5 states and 196 transitions. [2025-02-08 14:09:43,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 119 transitions, 740 flow [2025-02-08 14:09:43,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 119 transitions, 733 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:43,896 INFO L231 Difference]: Finished difference. Result has 83 places, 80 transitions, 381 flow [2025-02-08 14:09:43,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=381, PETRI_PLACES=83, PETRI_TRANSITIONS=80} [2025-02-08 14:09:43,897 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 30 predicate places. [2025-02-08 14:09:43,897 INFO L471 AbstractCegarLoop]: Abstraction has has 83 places, 80 transitions, 381 flow [2025-02-08 14:09:43,897 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-02-08 14:09:43,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:43,897 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-02-08 14:09:43,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 14:09:43,898 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:43,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:43,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1474512396, now seen corresponding path program 2 times [2025-02-08 14:09:43,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:43,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973795728] [2025-02-08 14:09:43,898 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:43,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:43,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:09:43,907 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:09:43,907 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:43,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:09:43,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973795728] [2025-02-08 14:09:43,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973795728] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:43,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1780725461] [2025-02-08 14:09:43,927 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:43,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:43,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:43,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:43,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 14:09:43,966 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-08 14:09:43,973 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-02-08 14:09:43,973 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:43,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:43,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:09:43,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:43,991 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:09:43,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:44,009 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-02-08 14:09:44,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1780725461] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:44,009 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:44,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 2 [2025-02-08 14:09:44,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117046969] [2025-02-08 14:09:44,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 14:09:44,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 14:09:44,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-08 14:09:44,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:44,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 80 transitions, 381 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-02-08 14:09:44,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:44,017 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,202 INFO L124 PetriNetUnfolderBase]: 1298/2671 cut-off events. [2025-02-08 14:09:44,202 INFO L125 PetriNetUnfolderBase]: For 881/917 co-relation queries the response was YES. [2025-02-08 14:09:44,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5925 conditions, 2671 events. 1298/2671 cut-off events. For 881/917 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 16692 event pairs, 750 based on Foata normal form. 1/2529 useless extension candidates. Maximal degree in co-relation 5903. Up to 1802 conditions per place. [2025-02-08 14:09:44,211 INFO L140 encePairwiseOnDemand]: 55/60 looper letters, 43 selfloop transitions, 16 changer transitions 0/79 dead transitions. [2025-02-08 14:09:44,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 79 transitions, 489 flow [2025-02-08 14:09:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:44,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:44,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 128 transitions. [2025-02-08 14:09:44,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-08 14:09:44,212 INFO L175 Difference]: Start difference. First operand has 83 places, 80 transitions, 381 flow. Second operand 4 states and 128 transitions. [2025-02-08 14:09:44,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 79 transitions, 489 flow [2025-02-08 14:09:44,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 79 transitions, 476 flow, removed 4 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:44,215 INFO L231 Difference]: Finished difference. Result has 79 places, 79 transitions, 390 flow [2025-02-08 14:09:44,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=76, 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=390, PETRI_PLACES=79, PETRI_TRANSITIONS=79} [2025-02-08 14:09:44,216 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 26 predicate places. [2025-02-08 14:09:44,216 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 79 transitions, 390 flow [2025-02-08 14:09:44,216 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-02-08 14:09:44,216 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,216 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:44,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:44,418 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-02-08 14:09:44,419 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:44,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1812034767, now seen corresponding path program 1 times [2025-02-08 14:09:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132199141] [2025-02-08 14:09:44,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 14:09:44,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 14:09:44,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:44,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132199141] [2025-02-08 14:09:44,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132199141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:44,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:44,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:09:44,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406534184] [2025-02-08 14:09:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:44,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:44,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:44,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:44,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:44,494 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 14:09:44,495 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 79 transitions, 390 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-02-08 14:09:44,495 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:44,495 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 14:09:44,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:44,657 INFO L124 PetriNetUnfolderBase]: 1025/2084 cut-off events. [2025-02-08 14:09:44,657 INFO L125 PetriNetUnfolderBase]: For 662/664 co-relation queries the response was YES. [2025-02-08 14:09:44,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4547 conditions, 2084 events. 1025/2084 cut-off events. For 662/664 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11936 event pairs, 585 based on Foata normal form. 26/2029 useless extension candidates. Maximal degree in co-relation 4527. Up to 1004 conditions per place. [2025-02-08 14:09:44,666 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 9 changer transitions 4/115 dead transitions. [2025-02-08 14:09:44,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 115 transitions, 694 flow [2025-02-08 14:09:44,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:44,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:44,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 202 transitions. [2025-02-08 14:09:44,667 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6733333333333333 [2025-02-08 14:09:44,667 INFO L175 Difference]: Start difference. First operand has 79 places, 79 transitions, 390 flow. Second operand 5 states and 202 transitions. [2025-02-08 14:09:44,667 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 115 transitions, 694 flow [2025-02-08 14:09:44,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 115 transitions, 662 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:44,670 INFO L231 Difference]: Finished difference. Result has 82 places, 81 transitions, 397 flow [2025-02-08 14:09:44,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=76, 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=397, PETRI_PLACES=82, PETRI_TRANSITIONS=81} [2025-02-08 14:09:44,670 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 29 predicate places. [2025-02-08 14:09:44,670 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 81 transitions, 397 flow [2025-02-08 14:09:44,670 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-02-08 14:09:44,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:44,671 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1, 1] [2025-02-08 14:09:44,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 14:09:44,671 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:44,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:44,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1482434919, now seen corresponding path program 1 times [2025-02-08 14:09:44,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:44,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391636406] [2025-02-08 14:09:44,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:44,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:09:44,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:09:44,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:44,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391636406] [2025-02-08 14:09:44,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391636406] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:44,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879911481] [2025-02-08 14:09:44,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:44,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:44,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:44,776 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:44,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 14:09:44,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-02-08 14:09:44,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-02-08 14:09:44,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:44,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:44,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 14:09:44,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:44,927 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:44,927 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:45,128 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 14:09:45,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879911481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:45,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:45,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2025-02-08 14:09:45,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490109692] [2025-02-08 14:09:45,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:45,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-02-08 14:09:45,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:45,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-02-08 14:09:45,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=397, Unknown=0, NotChecked=0, Total=552 [2025-02-08 14:09:45,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:45,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 81 transitions, 397 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-02-08 14:09:45,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:45,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:45,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:45,606 INFO L124 PetriNetUnfolderBase]: 950/2019 cut-off events. [2025-02-08 14:09:45,606 INFO L125 PetriNetUnfolderBase]: For 1047/1065 co-relation queries the response was YES. [2025-02-08 14:09:45,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4554 conditions, 2019 events. 950/2019 cut-off events. For 1047/1065 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11641 event pairs, 554 based on Foata normal form. 22/1935 useless extension candidates. Maximal degree in co-relation 4533. Up to 1322 conditions per place. [2025-02-08 14:09:45,617 INFO L140 encePairwiseOnDemand]: 52/60 looper letters, 35 selfloop transitions, 61 changer transitions 0/117 dead transitions. [2025-02-08 14:09:45,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 117 transitions, 841 flow [2025-02-08 14:09:45,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 14:09:45,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 14:09:45,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 625 transitions. [2025-02-08 14:09:45,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4734848484848485 [2025-02-08 14:09:45,620 INFO L175 Difference]: Start difference. First operand has 82 places, 81 transitions, 397 flow. Second operand 22 states and 625 transitions. [2025-02-08 14:09:45,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 117 transitions, 841 flow [2025-02-08 14:09:45,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 117 transitions, 816 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 14:09:45,626 INFO L231 Difference]: Finished difference. Result has 107 places, 117 transitions, 792 flow [2025-02-08 14:09:45,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=80, 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=792, PETRI_PLACES=107, PETRI_TRANSITIONS=117} [2025-02-08 14:09:45,627 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 54 predicate places. [2025-02-08 14:09:45,627 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 117 transitions, 792 flow [2025-02-08 14:09:45,628 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-02-08 14:09:45,628 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:45,628 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:45,637 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-02-08 14:09:45,832 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-02-08 14:09:45,832 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:45,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:45,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1190399567, now seen corresponding path program 1 times [2025-02-08 14:09:45,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:45,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015143508] [2025-02-08 14:09:45,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:45,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:45,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-02-08 14:09:45,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-02-08 14:09:45,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:45,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 14:09:45,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:45,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015143508] [2025-02-08 14:09:45,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015143508] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 14:09:45,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 14:09:45,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 14:09:45,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863719761] [2025-02-08 14:09:45,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 14:09:45,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:45,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:45,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:45,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:45,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 60 [2025-02-08 14:09:45,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 117 transitions, 792 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-02-08 14:09:45,976 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:45,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 60 [2025-02-08 14:09:45,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:46,200 INFO L124 PetriNetUnfolderBase]: 873/1810 cut-off events. [2025-02-08 14:09:46,200 INFO L125 PetriNetUnfolderBase]: For 1080/1096 co-relation queries the response was YES. [2025-02-08 14:09:46,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4319 conditions, 1810 events. 873/1810 cut-off events. For 1080/1096 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 9943 event pairs, 517 based on Foata normal form. 13/1742 useless extension candidates. Maximal degree in co-relation 4291. Up to 1056 conditions per place. [2025-02-08 14:09:46,209 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 83 selfloop transitions, 12 changer transitions 25/139 dead transitions. [2025-02-08 14:09:46,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 139 transitions, 1093 flow [2025-02-08 14:09:46,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:46,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 193 transitions. [2025-02-08 14:09:46,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6433333333333333 [2025-02-08 14:09:46,211 INFO L175 Difference]: Start difference. First operand has 107 places, 117 transitions, 792 flow. Second operand 5 states and 193 transitions. [2025-02-08 14:09:46,211 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 139 transitions, 1093 flow [2025-02-08 14:09:46,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 139 transitions, 937 flow, removed 47 selfloop flow, removed 9 redundant places. [2025-02-08 14:09:46,216 INFO L231 Difference]: Finished difference. Result has 104 places, 114 transitions, 640 flow [2025-02-08 14:09:46,216 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=636, PETRI_DIFFERENCE_MINUEND_PLACES=98, 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=640, PETRI_PLACES=104, PETRI_TRANSITIONS=114} [2025-02-08 14:09:46,216 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 51 predicate places. [2025-02-08 14:09:46,217 INFO L471 AbstractCegarLoop]: Abstraction has has 104 places, 114 transitions, 640 flow [2025-02-08 14:09:46,217 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-02-08 14:09:46,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:46,217 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:46,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 14:09:46,217 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:46,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash 87454531, now seen corresponding path program 1 times [2025-02-08 14:09:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013381234] [2025-02-08 14:09:46,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:46,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:46,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:09:46,229 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:09:46,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:46,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:46,300 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:46,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:46,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013381234] [2025-02-08 14:09:46,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013381234] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:46,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998886088] [2025-02-08 14:09:46,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:46,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:46,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:46,305 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:46,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 14:09:46,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-02-08 14:09:46,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-02-08 14:09:46,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:46,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:46,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:09:46,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:46,489 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:46,623 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:46,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998886088] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:46,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:46,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-08 14:09:46,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981849446] [2025-02-08 14:09:46,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:46,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:09:46,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:46,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:09:46,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:09:47,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 14:09:47,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 114 transitions, 640 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-02-08 14:09:47,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:47,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 14:09:47,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:47,744 INFO L124 PetriNetUnfolderBase]: 1222/2377 cut-off events. [2025-02-08 14:09:47,744 INFO L125 PetriNetUnfolderBase]: For 1390/1436 co-relation queries the response was YES. [2025-02-08 14:09:47,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 2377 events. 1222/2377 cut-off events. For 1390/1436 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 13780 event pairs, 368 based on Foata normal form. 52/2335 useless extension candidates. Maximal degree in co-relation 5719. Up to 496 conditions per place. [2025-02-08 14:09:47,754 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 147 selfloop transitions, 67 changer transitions 10/240 dead transitions. [2025-02-08 14:09:47,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 240 transitions, 1522 flow [2025-02-08 14:09:47,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:09:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 14:09:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 448 transitions. [2025-02-08 14:09:47,756 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-08 14:09:47,756 INFO L175 Difference]: Start difference. First operand has 104 places, 114 transitions, 640 flow. Second operand 14 states and 448 transitions. [2025-02-08 14:09:47,756 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 240 transitions, 1522 flow [2025-02-08 14:09:47,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 240 transitions, 1446 flow, removed 26 selfloop flow, removed 6 redundant places. [2025-02-08 14:09:47,764 INFO L231 Difference]: Finished difference. Result has 106 places, 118 transitions, 762 flow [2025-02-08 14:09:47,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=62, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=762, PETRI_PLACES=106, PETRI_TRANSITIONS=118} [2025-02-08 14:09:47,765 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 53 predicate places. [2025-02-08 14:09:47,765 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 118 transitions, 762 flow [2025-02-08 14:09:47,765 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-02-08 14:09:47,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:47,765 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-02-08 14:09:47,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:47,970 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-02-08 14:09:47,970 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:47,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1726169027, now seen corresponding path program 1 times [2025-02-08 14:09:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547564506] [2025-02-08 14:09:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:09:47,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:09:47,983 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:47,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:48,029 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 14:09:48,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:48,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547564506] [2025-02-08 14:09:48,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547564506] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:48,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312672316] [2025-02-08 14:09:48,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:48,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:48,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:48,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:48,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 14:09:48,075 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-02-08 14:09:48,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-02-08 14:09:48,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:48,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:48,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:09:48,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:48,173 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:48,173 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:48,266 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 14:09:48,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312672316] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:48,267 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:48,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-02-08 14:09:48,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445462906] [2025-02-08 14:09:48,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:48,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:09:48,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:48,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:09:48,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:09:48,640 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 14:09:48,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 118 transitions, 762 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-02-08 14:09:48,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:48,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 14:09:48,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:49,187 INFO L124 PetriNetUnfolderBase]: 1122/2193 cut-off events. [2025-02-08 14:09:49,187 INFO L125 PetriNetUnfolderBase]: For 1571/1583 co-relation queries the response was YES. [2025-02-08 14:09:49,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5335 conditions, 2193 events. 1122/2193 cut-off events. For 1571/1583 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12359 event pairs, 348 based on Foata normal form. 44/2133 useless extension candidates. Maximal degree in co-relation 5309. Up to 512 conditions per place. [2025-02-08 14:09:49,197 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 89 selfloop transitions, 61 changer transitions 61/226 dead transitions. [2025-02-08 14:09:49,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 226 transitions, 1582 flow [2025-02-08 14:09:49,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 14:09:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-02-08 14:09:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 441 transitions. [2025-02-08 14:09:49,199 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.525 [2025-02-08 14:09:49,199 INFO L175 Difference]: Start difference. First operand has 106 places, 118 transitions, 762 flow. Second operand 14 states and 441 transitions. [2025-02-08 14:09:49,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 226 transitions, 1582 flow [2025-02-08 14:09:49,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 226 transitions, 1498 flow, removed 7 selfloop flow, removed 4 redundant places. [2025-02-08 14:09:49,205 INFO L231 Difference]: Finished difference. Result has 115 places, 111 transitions, 815 flow [2025-02-08 14:09:49,205 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=724, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=815, PETRI_PLACES=115, PETRI_TRANSITIONS=111} [2025-02-08 14:09:49,206 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 62 predicate places. [2025-02-08 14:09:49,206 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 111 transitions, 815 flow [2025-02-08 14:09:49,206 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-02-08 14:09:49,206 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:49,206 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:49,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 14:09:49,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-02-08 14:09:49,410 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:49,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash -2105500819, now seen corresponding path program 1 times [2025-02-08 14:09:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:49,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799716695] [2025-02-08 14:09:49,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:49,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:49,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:09:49,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:09:49,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:49,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:49,470 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:09:49,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799716695] [2025-02-08 14:09:49,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799716695] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:49,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986843708] [2025-02-08 14:09:49,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:49,473 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:49,475 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 14:09:49,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-08 14:09:49,535 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-08 14:09:49,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:49,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:49,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:09:49,537 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:49,618 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:09:49,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:49,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:09:49,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986843708] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:49,712 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:49,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-02-08 14:09:49,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980990733] [2025-02-08 14:09:49,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:49,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:09:49,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:49,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:09:49,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:09:50,030 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 14:09:50,031 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 111 transitions, 815 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-02-08 14:09:50,031 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:50,031 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 14:09:50,031 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:50,560 INFO L124 PetriNetUnfolderBase]: 1398/2657 cut-off events. [2025-02-08 14:09:50,561 INFO L125 PetriNetUnfolderBase]: For 2330/2348 co-relation queries the response was YES. [2025-02-08 14:09:50,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6892 conditions, 2657 events. 1398/2657 cut-off events. For 2330/2348 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 14776 event pairs, 492 based on Foata normal form. 52/2633 useless extension candidates. Maximal degree in co-relation 6865. Up to 798 conditions per place. [2025-02-08 14:09:50,576 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 193 selfloop transitions, 61 changer transitions 10/279 dead transitions. [2025-02-08 14:09:50,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 279 transitions, 2200 flow [2025-02-08 14:09:50,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 14:09:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 14:09:50,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 525 transitions. [2025-02-08 14:09:50,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2025-02-08 14:09:50,582 INFO L175 Difference]: Start difference. First operand has 115 places, 111 transitions, 815 flow. Second operand 17 states and 525 transitions. [2025-02-08 14:09:50,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 279 transitions, 2200 flow [2025-02-08 14:09:50,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 279 transitions, 2014 flow, removed 23 selfloop flow, removed 9 redundant places. [2025-02-08 14:09:50,592 INFO L231 Difference]: Finished difference. Result has 119 places, 144 transitions, 1287 flow [2025-02-08 14:09:50,593 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=743, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1287, PETRI_PLACES=119, PETRI_TRANSITIONS=144} [2025-02-08 14:09:50,593 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 66 predicate places. [2025-02-08 14:09:50,593 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 144 transitions, 1287 flow [2025-02-08 14:09:50,594 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-02-08 14:09:50,594 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:50,594 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-02-08 14:09:50,603 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 14:09:50,794 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-02-08 14:09:50,795 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:50,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash -1093266944, now seen corresponding path program 1 times [2025-02-08 14:09:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:50,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535072700] [2025-02-08 14:09:50,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:50,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 14:09:50,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:09:50,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:50,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-02-08 14:09:50,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:50,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535072700] [2025-02-08 14:09:50,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535072700] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:50,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1633298930] [2025-02-08 14:09:50,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 14:09:50,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:50,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:50,872 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:50,876 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 14:09:50,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-02-08 14:09:50,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-02-08 14:09:50,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 14:09:50,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:50,934 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 14:09:50,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:51,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:09:51,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:51,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-02-08 14:09:51,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1633298930] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:51,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:51,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 8, 8] total 19 [2025-02-08 14:09:51,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019127823] [2025-02-08 14:09:51,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 14:09:51,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:51,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 14:09:51,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2025-02-08 14:09:51,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 14:09:51,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 144 transitions, 1287 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-02-08 14:09:51,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:51,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 14:09:51,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:51,944 INFO L124 PetriNetUnfolderBase]: 1566/2953 cut-off events. [2025-02-08 14:09:51,945 INFO L125 PetriNetUnfolderBase]: For 3329/3361 co-relation queries the response was YES. [2025-02-08 14:09:51,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7745 conditions, 2953 events. 1566/2953 cut-off events. For 3329/3361 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 16096 event pairs, 567 based on Foata normal form. 52/2903 useless extension candidates. Maximal degree in co-relation 7714. Up to 1034 conditions per place. [2025-02-08 14:09:51,954 INFO L140 encePairwiseOnDemand]: 48/60 looper letters, 136 selfloop transitions, 56 changer transitions 69/277 dead transitions. [2025-02-08 14:09:51,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 277 transitions, 2393 flow [2025-02-08 14:09:51,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 14:09:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 14:09:51,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 518 transitions. [2025-02-08 14:09:51,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5078431372549019 [2025-02-08 14:09:51,956 INFO L175 Difference]: Start difference. First operand has 119 places, 144 transitions, 1287 flow. Second operand 17 states and 518 transitions. [2025-02-08 14:09:51,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 277 transitions, 2393 flow [2025-02-08 14:09:51,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 277 transitions, 2309 flow, removed 10 selfloop flow, removed 5 redundant places. [2025-02-08 14:09:51,964 INFO L231 Difference]: Finished difference. Result has 133 places, 142 transitions, 1359 flow [2025-02-08 14:09:51,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1247, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1359, PETRI_PLACES=133, PETRI_TRANSITIONS=142} [2025-02-08 14:09:51,965 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 80 predicate places. [2025-02-08 14:09:51,965 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 142 transitions, 1359 flow [2025-02-08 14:09:51,965 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-02-08 14:09:51,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:51,965 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 14:09:51,971 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-02-08 14:09:52,166 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-02-08 14:09:52,166 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:52,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:52,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1037130163, now seen corresponding path program 2 times [2025-02-08 14:09:52,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:52,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063586837] [2025-02-08 14:09:52,167 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:52,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:52,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 14:09:52,177 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-02-08 14:09:52,178 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:52,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:09:52,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063586837] [2025-02-08 14:09:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063586837] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299387404] [2025-02-08 14:09:52,202 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:52,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:52,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:52,210 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:52,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 14:09:52,268 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-02-08 14:09:52,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 10 of 30 statements. [2025-02-08 14:09:52,278 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:52,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:52,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:09:52,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:52,314 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:09:52,314 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:09:52,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299387404] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:52,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:52,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-08 14:09:52,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170417933] [2025-02-08 14:09:52,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:52,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:52,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:52,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:52,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:09:52,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 14:09:52,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 142 transitions, 1359 flow. Second operand has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:52,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:52,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 14:09:52,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:52,594 INFO L124 PetriNetUnfolderBase]: 1261/2372 cut-off events. [2025-02-08 14:09:52,594 INFO L125 PetriNetUnfolderBase]: For 3690/3702 co-relation queries the response was YES. [2025-02-08 14:09:52,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6977 conditions, 2372 events. 1261/2372 cut-off events. For 3690/3702 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12128 event pairs, 358 based on Foata normal form. 34/2357 useless extension candidates. Maximal degree in co-relation 6943. Up to 1059 conditions per place. [2025-02-08 14:09:52,606 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 140 selfloop transitions, 12 changer transitions 7/176 dead transitions. [2025-02-08 14:09:52,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 176 transitions, 1841 flow [2025-02-08 14:09:52,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:52,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:52,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2025-02-08 14:09:52,608 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5433333333333333 [2025-02-08 14:09:52,608 INFO L175 Difference]: Start difference. First operand has 133 places, 142 transitions, 1359 flow. Second operand 5 states and 163 transitions. [2025-02-08 14:09:52,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 176 transitions, 1841 flow [2025-02-08 14:09:52,616 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 176 transitions, 1744 flow, removed 13 selfloop flow, removed 14 redundant places. [2025-02-08 14:09:52,619 INFO L231 Difference]: Finished difference. Result has 118 places, 143 transitions, 1339 flow [2025-02-08 14:09:52,619 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1278, PETRI_DIFFERENCE_MINUEND_PLACES=112, 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=1339, PETRI_PLACES=118, PETRI_TRANSITIONS=143} [2025-02-08 14:09:52,620 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 65 predicate places. [2025-02-08 14:09:52,620 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 143 transitions, 1339 flow [2025-02-08 14:09:52,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.0) internal successors, (156), 6 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:52,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:52,620 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-02-08 14:09:52,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-08 14:09:52,823 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-02-08 14:09:52,824 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:52,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:52,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1099333543, now seen corresponding path program 2 times [2025-02-08 14:09:52,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:52,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530034442] [2025-02-08 14:09:52,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:52,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:52,831 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-08 14:09:52,834 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-02-08 14:09:52,834 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:52,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:52,861 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:09:52,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530034442] [2025-02-08 14:09:52,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530034442] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:52,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033541159] [2025-02-08 14:09:52,861 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:52,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:52,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:52,864 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:52,866 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 14:09:52,908 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-02-08 14:09:52,919 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 32 statements. [2025-02-08 14:09:52,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:52,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:52,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 14:09:52,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:52,953 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:09:52,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:52,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-08 14:09:52,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033541159] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:52,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:52,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 4 [2025-02-08 14:09:52,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502175063] [2025-02-08 14:09:52,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:52,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 14:09:52,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:52,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 14:09:52,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 14:09:53,023 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 60 [2025-02-08 14:09:53,023 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 143 transitions, 1339 flow. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:53,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:53,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 60 [2025-02-08 14:09:53,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:53,203 INFO L124 PetriNetUnfolderBase]: 1197/2244 cut-off events. [2025-02-08 14:09:53,204 INFO L125 PetriNetUnfolderBase]: For 4184/4206 co-relation queries the response was YES. [2025-02-08 14:09:53,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6871 conditions, 2244 events. 1197/2244 cut-off events. For 4184/4206 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 11315 event pairs, 331 based on Foata normal form. 55/2254 useless extension candidates. Maximal degree in co-relation 6839. Up to 994 conditions per place. [2025-02-08 14:09:53,213 INFO L140 encePairwiseOnDemand]: 53/60 looper letters, 80 selfloop transitions, 1 changer transitions 93/177 dead transitions. [2025-02-08 14:09:53,213 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 177 transitions, 1848 flow [2025-02-08 14:09:53,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 14:09:53,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 14:09:53,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 160 transitions. [2025-02-08 14:09:53,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5333333333333333 [2025-02-08 14:09:53,213 INFO L175 Difference]: Start difference. First operand has 118 places, 143 transitions, 1339 flow. Second operand 5 states and 160 transitions. [2025-02-08 14:09:53,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 177 transitions, 1848 flow [2025-02-08 14:09:53,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 177 transitions, 1825 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-02-08 14:09:53,221 INFO L231 Difference]: Finished difference. Result has 117 places, 84 transitions, 1045 flow [2025-02-08 14:09:53,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=60, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=113, 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=1045, PETRI_PLACES=117, PETRI_TRANSITIONS=84} [2025-02-08 14:09:53,222 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 64 predicate places. [2025-02-08 14:09:53,222 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 84 transitions, 1045 flow [2025-02-08 14:09:53,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 14:09:53,222 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 14:09:53,222 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 11, 10, 1, 1, 1] [2025-02-08 14:09:53,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 14:09:53,427 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-02-08 14:09:53,427 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 19 more)] === [2025-02-08 14:09:53,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 14:09:53,428 INFO L85 PathProgramCache]: Analyzing trace with hash 839715993, now seen corresponding path program 2 times [2025-02-08 14:09:53,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 14:09:53,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648073371] [2025-02-08 14:09:53,428 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:53,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 14:09:53,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 14:09:53,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 14:09:53,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:53,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 14:09:53,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 14:09:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648073371] [2025-02-08 14:09:53,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648073371] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 14:09:53,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [680219545] [2025-02-08 14:09:53,462 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 14:09:53,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 14:09:53,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 14:09:53,463 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 14:09:53,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 14:09:53,515 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 35 statements into 2 equivalence classes. [2025-02-08 14:09:53,523 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 5 of 35 statements. [2025-02-08 14:09:53,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 14:09:53,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 14:09:53,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 14:09:53,525 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 14:09:53,560 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 14:09:53,560 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 14:09:53,595 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2025-02-08 14:09:53,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [680219545] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 14:09:53,595 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 14:09:53,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2025-02-08 14:09:53,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051989779] [2025-02-08 14:09:53,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 14:09:53,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 14:09:53,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 14:09:53,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 14:09:53,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 14:09:53,628 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 60 [2025-02-08 14:09:53,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 84 transitions, 1045 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-02-08 14:09:53,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 14:09:53,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 60 [2025-02-08 14:09:53,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 14:09:53,652 INFO L124 PetriNetUnfolderBase]: 12/144 cut-off events. [2025-02-08 14:09:53,653 INFO L125 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2025-02-08 14:09:53,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 144 events. 12/144 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 357 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-02-08 14:09:53,653 INFO L140 encePairwiseOnDemand]: 54/60 looper letters, 0 selfloop transitions, 0 changer transitions 83/83 dead transitions. [2025-02-08 14:09:53,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 83 transitions, 1185 flow [2025-02-08 14:09:53,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 14:09:53,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 14:09:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2025-02-08 14:09:53,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.42916666666666664 [2025-02-08 14:09:53,654 INFO L175 Difference]: Start difference. First operand has 117 places, 84 transitions, 1045 flow. Second operand 4 states and 103 transitions. [2025-02-08 14:09:53,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 83 transitions, 1185 flow [2025-02-08 14:09:53,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 83 transitions, 1000 flow, removed 3 selfloop flow, removed 14 redundant places. [2025-02-08 14:09:53,657 INFO L231 Difference]: Finished difference. Result has 60 places, 0 transitions, 0 flow [2025-02-08 14:09:53,657 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-02-08 14:09:53,662 INFO L279 CegarLoopForPetriNet]: 53 programPoint places, 7 predicate places. [2025-02-08 14:09:53,662 INFO L471 AbstractCegarLoop]: Abstraction has has 60 places, 0 transitions, 0 flow [2025-02-08 14:09:53,662 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-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 22 remaining) [2025-02-08 14:09:53,664 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 22 remaining) [2025-02-08 14:09:53,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 22 remaining) [2025-02-08 14:09:53,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 22 remaining) [2025-02-08 14:09:53,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 22 remaining) [2025-02-08 14:09:53,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 22 remaining) [2025-02-08 14:09:53,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 22 remaining) [2025-02-08 14:09:53,666 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 22 remaining) [2025-02-08 14:09:53,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 14:09:53,866 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-02-08 14:09:53,867 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-02-08 14:09:53,877 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 14:09:53,877 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 14:09:53,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 02:09:53 BasicIcfg [2025-02-08 14:09:53,887 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 14:09:53,887 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 14:09:53,891 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 14:09:53,892 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 14:09:53,892 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 02:09:38" (3/4) ... [2025-02-08 14:09:53,893 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 14:09:53,895 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 14:09:53,895 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 14:09:53,906 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 103 nodes and edges [2025-02-08 14:09:53,911 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 41 nodes and edges [2025-02-08 14:09:53,911 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 14:09:53,911 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-08 14:09:53,979 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 14:09:53,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 14:09:53,980 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 14:09:53,980 INFO L158 Benchmark]: Toolchain (without parser) took 16469.03ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 113.1MB in the beginning and 486.2MB in the end (delta: -373.1MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2025-02-08 14:09:53,981 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory was 124.8MB in the beginning and 124.5MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:53,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.61ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 14:09:53,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.00ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:53,982 INFO L158 Benchmark]: Boogie Preprocessor took 78.95ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:53,983 INFO L158 Benchmark]: IcfgBuilder took 611.19ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 48.3MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-02-08 14:09:53,983 INFO L158 Benchmark]: TraceAbstraction took 15247.81ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 47.8MB in the beginning and 493.8MB in the end (delta: -446.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2025-02-08 14:09:53,983 INFO L158 Benchmark]: Witness Printer took 92.42ms. Allocated memory is still 595.6MB. Free memory was 493.8MB in the beginning and 486.2MB in the end (delta: 7.6MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 14:09:53,984 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.18ms. Allocated memory is still 201.3MB. Free memory was 124.8MB in the beginning and 124.5MB in the end (delta: 293.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.61ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 100.5MB in the end (delta: 12.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.00ms. Allocated memory is still 142.6MB. Free memory was 100.5MB in the beginning and 99.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.95ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 97.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 611.19ms. Allocated memory is still 142.6MB. Free memory was 97.2MB in the beginning and 48.3MB in the end (delta: 48.9MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15247.81ms. Allocated memory was 142.6MB in the beginning and 595.6MB in the end (delta: 453.0MB). Free memory was 47.8MB in the beginning and 493.8MB in the end (delta: -446.0MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. * Witness Printer took 92.42ms. Allocated memory is still 595.6MB. Free memory was 493.8MB in the beginning and 486.2MB in the end (delta: 7.6MB). There was no memory consumed. 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.1s, OverallIterations: 22, TraceHistogramMax: 11, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2890 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2572 mSDsluCounter, 2001 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1931 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9868 IncrementalHoareTripleChecker+Invalid, 10031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 70 mSDtfsCounter, 9868 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 389 SyntacticMatches, 11 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 673 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1359occurred in iteration=19, InterpolantAutomatonStates: 166, 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.3s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 622 NumberOfCodeBlocks, 458 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 802 ConstructedInterpolants, 0 QuantifiedInterpolants, 2609 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-02-08 14:09:53,997 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