./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 15:25:30,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 15:25:30,741 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 15:25:30,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 15:25:30,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 15:25:30,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 15:25:30,765 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 15:25:30,766 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 15:25:30,766 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 15:25:30,766 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 15:25:30,767 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 15:25:30,767 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 15:25:30,767 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 15:25:30,767 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 15:25:30,768 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 15:25:30,768 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 15:25:30,769 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 15:25:30,769 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:30,770 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 15:25:30,770 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 15:25:30,771 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 15:25:30,771 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/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 -> 48ddce9ee02b3ea4431cf137593b71facb450c3e223dbff4f116c3c0ac1377b5 [2025-03-04 15:25:31,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 15:25:31,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 15:25:31,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 15:25:31,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 15:25:31,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 15:25:31,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-04 15:25:32,177 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85740ab8a/df67327454dd42cd9d7bb50df28b9ef1/FLAG649a2b2a0 [2025-03-04 15:25:32,439 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 15:25:32,440 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-symm.wvr.c [2025-03-04 15:25:32,448 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85740ab8a/df67327454dd42cd9d7bb50df28b9ef1/FLAG649a2b2a0 [2025-03-04 15:25:32,746 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85740ab8a/df67327454dd42cd9d7bb50df28b9ef1 [2025-03-04 15:25:32,748 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 15:25:32,749 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 15:25:32,750 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:32,750 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 15:25:32,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 15:25:32,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:32,753 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fa75043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32, skipping insertion in model container [2025-03-04 15:25:32,754 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:32,766 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 15:25:32,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:32,899 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 15:25:32,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 15:25:32,950 INFO L204 MainTranslator]: Completed translation [2025-03-04 15:25:32,951 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32 WrapperNode [2025-03-04 15:25:32,951 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 15:25:32,952 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:32,952 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 15:25:32,952 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 15:25:32,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:32,962 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:32,990 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 22, calls inlined = 30, statements flattened = 491 [2025-03-04 15:25:32,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 15:25:32,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 15:25:32,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 15:25:32,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 15:25:32,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:32,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,015 INFO L175 MemorySlicer]: Split 20 memory accesses to 2 slices as follows [2, 18]. 90 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-03-04 15:25:33,015 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,015 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,026 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,031 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,032 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,033 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 15:25:33,039 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 15:25:33,039 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 15:25:33,039 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 15:25:33,040 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (1/1) ... [2025-03-04 15:25:33,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 15:25:33,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:33,065 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 15:25:33,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 15:25:33,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-04 15:25:33,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-04 15:25:33,085 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 15:25:33,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 15:25:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 15:25:33,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 15:25:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 15:25:33,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 15:25:33,087 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 15:25:33,182 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 15:25:33,184 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 15:25:33,785 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 15:25:33,785 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 15:25:34,069 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 15:25:34,069 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 15:25:34,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:34 BoogieIcfgContainer [2025-03-04 15:25:34,070 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 15:25:34,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 15:25:34,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 15:25:34,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 15:25:34,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 03:25:32" (1/3) ... [2025-03-04 15:25:34,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2b249e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:34, skipping insertion in model container [2025-03-04 15:25:34,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 03:25:32" (2/3) ... [2025-03-04 15:25:34,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2b249e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 03:25:34, skipping insertion in model container [2025-03-04 15:25:34,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:34" (3/3) ... [2025-03-04 15:25:34,077 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-symm.wvr.c [2025-03-04 15:25:34,089 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 15:25:34,091 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-symm.wvr.c that has 3 procedures, 144 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-03-04 15:25:34,091 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 15:25:34,184 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-04 15:25:34,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 169 transitions, 352 flow [2025-03-04 15:25:34,265 INFO L124 PetriNetUnfolderBase]: 26/167 cut-off events. [2025-03-04 15:25:34,268 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 15:25:34,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 167 events. 26/167 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 858 event pairs, 0 based on Foata normal form. 0/99 useless extension candidates. Maximal degree in co-relation 149. Up to 2 conditions per place. [2025-03-04 15:25:34,276 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 169 transitions, 352 flow [2025-03-04 15:25:34,281 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 166 transitions, 344 flow [2025-03-04 15:25:34,287 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 15:25:34,297 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@74e03207, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 15:25:34,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2025-03-04 15:25:34,302 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 15:25:34,303 INFO L124 PetriNetUnfolderBase]: 1/5 cut-off events. [2025-03-04 15:25:34,303 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 15:25:34,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:34,304 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2025-03-04 15:25:34,304 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:34,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:34,309 INFO L85 PathProgramCache]: Analyzing trace with hash 1361813, now seen corresponding path program 1 times [2025-03-04 15:25:34,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:34,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214085414] [2025-03-04 15:25:34,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:34,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:34,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-04 15:25:34,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-04 15:25:34,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:34,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:34,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:34,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:34,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214085414] [2025-03-04 15:25:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214085414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:34,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251273524] [2025-03-04 15:25:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:34,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:34,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:34,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:34,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:34,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:34,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 166 transitions, 344 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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-03-04 15:25:34,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:34,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:34,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:35,258 INFO L124 PetriNetUnfolderBase]: 2887/6554 cut-off events. [2025-03-04 15:25:35,259 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2025-03-04 15:25:35,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10823 conditions, 6554 events. 2887/6554 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59595 event pairs, 1810 based on Foata normal form. 4/5193 useless extension candidates. Maximal degree in co-relation 10623. Up to 4187 conditions per place. [2025-03-04 15:25:35,293 INFO L140 encePairwiseOnDemand]: 154/169 looper letters, 79 selfloop transitions, 7 changer transitions 2/168 dead transitions. [2025-03-04 15:25:35,294 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 168 transitions, 522 flow [2025-03-04 15:25:35,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:35,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2025-03-04 15:25:35,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6316568047337278 [2025-03-04 15:25:35,307 INFO L175 Difference]: Start difference. First operand has 147 places, 166 transitions, 344 flow. Second operand 4 states and 427 transitions. [2025-03-04 15:25:35,308 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 168 transitions, 522 flow [2025-03-04 15:25:35,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 168 transitions, 514 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:35,320 INFO L231 Difference]: Finished difference. Result has 147 places, 166 transitions, 383 flow [2025-03-04 15:25:35,321 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=328, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=155, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=383, PETRI_PLACES=147, PETRI_TRANSITIONS=166} [2025-03-04 15:25:35,324 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 0 predicate places. [2025-03-04 15:25:35,326 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 166 transitions, 383 flow [2025-03-04 15:25:35,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 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-03-04 15:25:35,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:35,326 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-03-04 15:25:35,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 15:25:35,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:35,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1916316717, now seen corresponding path program 1 times [2025-03-04 15:25:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:35,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450905726] [2025-03-04 15:25:35,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:35,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:35,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:35,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:35,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:35,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:35,493 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:35,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450905726] [2025-03-04 15:25:35,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450905726] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:35,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143210463] [2025-03-04 15:25:35,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:35,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:35,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:35,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:35,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 15:25:35,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-03-04 15:25:35,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-03-04 15:25:35,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:35,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:35,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:35,587 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:35,626 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:25:35,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143210463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:35,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:25:35,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:25:35,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778887395] [2025-03-04 15:25:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:35,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:35,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:35,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:25:35,644 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:35,645 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 166 transitions, 383 flow. Second operand has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-03-04 15:25:35,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:35,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:35,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:36,194 INFO L124 PetriNetUnfolderBase]: 2887/6550 cut-off events. [2025-03-04 15:25:36,194 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-03-04 15:25:36,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10789 conditions, 6550 events. 2887/6550 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 467. Compared 59556 event pairs, 1810 based on Foata normal form. 2/5190 useless extension candidates. Maximal degree in co-relation 10739. Up to 4176 conditions per place. [2025-03-04 15:25:36,224 INFO L140 encePairwiseOnDemand]: 160/169 looper letters, 72 selfloop transitions, 12 changer transitions 0/164 dead transitions. [2025-03-04 15:25:36,224 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 164 transitions, 543 flow [2025-03-04 15:25:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:25:36,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:25:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 584 transitions. [2025-03-04 15:25:36,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5759368836291914 [2025-03-04 15:25:36,230 INFO L175 Difference]: Start difference. First operand has 147 places, 166 transitions, 383 flow. Second operand 6 states and 584 transitions. [2025-03-04 15:25:36,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 164 transitions, 543 flow [2025-03-04 15:25:36,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 164 transitions, 543 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:36,233 INFO L231 Difference]: Finished difference. Result has 148 places, 164 transitions, 399 flow [2025-03-04 15:25:36,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=399, PETRI_PLACES=148, PETRI_TRANSITIONS=164} [2025-03-04 15:25:36,234 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 1 predicate places. [2025-03-04 15:25:36,234 INFO L471 AbstractCegarLoop]: Abstraction has has 148 places, 164 transitions, 399 flow [2025-03-04 15:25:36,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 83.83333333333333) internal successors, (503), 6 states have internal predecessors, (503), 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-03-04 15:25:36,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:36,234 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1] [2025-03-04 15:25:36,240 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 15:25:36,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:36,439 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:36,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:36,440 INFO L85 PathProgramCache]: Analyzing trace with hash -723722660, now seen corresponding path program 1 times [2025-03-04 15:25:36,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:36,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430271363] [2025-03-04 15:25:36,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:36,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:36,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:36,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:36,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:36,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:36,540 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:36,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430271363] [2025-03-04 15:25:36,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430271363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:36,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571273787] [2025-03-04 15:25:36,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:36,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:36,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:36,543 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:36,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 15:25:36,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-03-04 15:25:36,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-03-04 15:25:36,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:36,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:36,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:36,617 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:36,638 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:36,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:36,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571273787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:36,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:36,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:25:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234395232] [2025-03-04 15:25:36,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:36,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 15:25:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:36,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 15:25:36,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 15:25:36,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:36,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 164 transitions, 399 flow. Second operand has 12 states, 12 states have (on average 84.08333333333333) internal successors, (1009), 12 states have internal predecessors, (1009), 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-03-04 15:25:36,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:36,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:36,706 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:37,244 INFO L124 PetriNetUnfolderBase]: 2893/6574 cut-off events. [2025-03-04 15:25:37,244 INFO L125 PetriNetUnfolderBase]: For 64/64 co-relation queries the response was YES. [2025-03-04 15:25:37,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10883 conditions, 6574 events. 2893/6574 cut-off events. For 64/64 co-relation queries the response was YES. Maximal size of possible extension queue 462. Compared 59751 event pairs, 1810 based on Foata normal form. 6/5217 useless extension candidates. Maximal degree in co-relation 10741. Up to 4187 conditions per place. [2025-03-04 15:25:37,270 INFO L140 encePairwiseOnDemand]: 160/169 looper letters, 77 selfloop transitions, 25 changer transitions 0/182 dead transitions. [2025-03-04 15:25:37,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 182 transitions, 717 flow [2025-03-04 15:25:37,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 15:25:37,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-04 15:25:37,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 938 transitions. [2025-03-04 15:25:37,275 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5550295857988166 [2025-03-04 15:25:37,275 INFO L175 Difference]: Start difference. First operand has 148 places, 164 transitions, 399 flow. Second operand 10 states and 938 transitions. [2025-03-04 15:25:37,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 182 transitions, 717 flow [2025-03-04 15:25:37,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 182 transitions, 659 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-03-04 15:25:37,280 INFO L231 Difference]: Finished difference. Result has 155 places, 182 transitions, 539 flow [2025-03-04 15:25:37,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=371, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=164, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=539, PETRI_PLACES=155, PETRI_TRANSITIONS=182} [2025-03-04 15:25:37,283 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2025-03-04 15:25:37,283 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 182 transitions, 539 flow [2025-03-04 15:25:37,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 84.08333333333333) internal successors, (1009), 12 states have internal predecessors, (1009), 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-03-04 15:25:37,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:37,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:37,290 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 15:25:37,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 15:25:37,489 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:37,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:37,490 INFO L85 PathProgramCache]: Analyzing trace with hash -942596052, now seen corresponding path program 1 times [2025-03-04 15:25:37,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:37,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184698682] [2025-03-04 15:25:37,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:37,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:37,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:25:37,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:25:37,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:37,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:37,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:37,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:37,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184698682] [2025-03-04 15:25:37,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184698682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:37,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:37,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:37,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647773583] [2025-03-04 15:25:37,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:37,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:37,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:37,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:37,627 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:25:37,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 182 transitions, 539 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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-03-04 15:25:37,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:37,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:25:37,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:38,491 INFO L124 PetriNetUnfolderBase]: 4498/9433 cut-off events. [2025-03-04 15:25:38,492 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2025-03-04 15:25:38,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16207 conditions, 9433 events. 4498/9433 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 591. Compared 84654 event pairs, 1733 based on Foata normal form. 224/7786 useless extension candidates. Maximal degree in co-relation 16140. Up to 4043 conditions per place. [2025-03-04 15:25:38,525 INFO L140 encePairwiseOnDemand]: 153/169 looper letters, 178 selfloop transitions, 10 changer transitions 0/258 dead transitions. [2025-03-04 15:25:38,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 258 transitions, 1069 flow [2025-03-04 15:25:38,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 470 transitions. [2025-03-04 15:25:38,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6952662721893491 [2025-03-04 15:25:38,527 INFO L175 Difference]: Start difference. First operand has 155 places, 182 transitions, 539 flow. Second operand 4 states and 470 transitions. [2025-03-04 15:25:38,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 258 transitions, 1069 flow [2025-03-04 15:25:38,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 258 transitions, 1045 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:38,534 INFO L231 Difference]: Finished difference. Result has 157 places, 186 transitions, 583 flow [2025-03-04 15:25:38,538 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=583, PETRI_PLACES=157, PETRI_TRANSITIONS=186} [2025-03-04 15:25:38,538 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2025-03-04 15:25:38,538 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 186 transitions, 583 flow [2025-03-04 15:25:38,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 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-03-04 15:25:38,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:38,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:38,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 15:25:38,539 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:38,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:38,539 INFO L85 PathProgramCache]: Analyzing trace with hash -943551414, now seen corresponding path program 1 times [2025-03-04 15:25:38,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:38,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851110058] [2025-03-04 15:25:38,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:38,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:38,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-04 15:25:38,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-04 15:25:38,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:38,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:38,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:38,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851110058] [2025-03-04 15:25:38,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851110058] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:38,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:38,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:38,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822273411] [2025-03-04 15:25:38,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:38,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:38,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:38,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:38,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:38,607 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:38,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 186 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-03-04 15:25:38,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:38,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:38,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:39,284 INFO L124 PetriNetUnfolderBase]: 6081/13072 cut-off events. [2025-03-04 15:25:39,285 INFO L125 PetriNetUnfolderBase]: For 1782/1865 co-relation queries the response was YES. [2025-03-04 15:25:39,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24222 conditions, 13072 events. 6081/13072 cut-off events. For 1782/1865 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 120368 event pairs, 2703 based on Foata normal form. 155/11459 useless extension candidates. Maximal degree in co-relation 24155. Up to 5669 conditions per place. [2025-03-04 15:25:39,327 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 164 selfloop transitions, 2 changer transitions 0/244 dead transitions. [2025-03-04 15:25:39,328 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 244 transitions, 1051 flow [2025-03-04 15:25:39,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:39,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:39,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2025-03-04 15:25:39,329 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7672583826429981 [2025-03-04 15:25:39,329 INFO L175 Difference]: Start difference. First operand has 157 places, 186 transitions, 583 flow. Second operand 3 states and 389 transitions. [2025-03-04 15:25:39,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 244 transitions, 1051 flow [2025-03-04 15:25:39,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 244 transitions, 1051 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 15:25:39,355 INFO L231 Difference]: Finished difference. Result has 160 places, 187 transitions, 601 flow [2025-03-04 15:25:39,355 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=601, PETRI_PLACES=160, PETRI_TRANSITIONS=187} [2025-03-04 15:25:39,356 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2025-03-04 15:25:39,356 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 187 transitions, 601 flow [2025-03-04 15:25:39,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-03-04 15:25:39,356 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:39,356 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:39,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 15:25:39,356 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:39,357 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:39,357 INFO L85 PathProgramCache]: Analyzing trace with hash 844294831, now seen corresponding path program 1 times [2025-03-04 15:25:39,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:39,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252955903] [2025-03-04 15:25:39,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:39,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:39,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-04 15:25:39,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-04 15:25:39,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:39,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 15:25:39,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:39,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252955903] [2025-03-04 15:25:39,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252955903] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:39,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:39,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:39,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120861982] [2025-03-04 15:25:39,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:39,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:39,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:39,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:39,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:39,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 169 [2025-03-04 15:25:39,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 187 transitions, 601 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-04 15:25:39,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:39,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 169 [2025-03-04 15:25:39,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:40,073 INFO L124 PetriNetUnfolderBase]: 5577/12659 cut-off events. [2025-03-04 15:25:40,073 INFO L125 PetriNetUnfolderBase]: For 2080/2197 co-relation queries the response was YES. [2025-03-04 15:25:40,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23287 conditions, 12659 events. 5577/12659 cut-off events. For 2080/2197 co-relation queries the response was YES. Maximal size of possible extension queue 584. Compared 120953 event pairs, 3653 based on Foata normal form. 67/10859 useless extension candidates. Maximal degree in co-relation 23218. Up to 8093 conditions per place. [2025-03-04 15:25:40,123 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 96 selfloop transitions, 7 changer transitions 0/185 dead transitions. [2025-03-04 15:25:40,124 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 185 transitions, 798 flow [2025-03-04 15:25:40,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:40,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 343 transitions. [2025-03-04 15:25:40,125 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6765285996055227 [2025-03-04 15:25:40,125 INFO L175 Difference]: Start difference. First operand has 160 places, 187 transitions, 601 flow. Second operand 3 states and 343 transitions. [2025-03-04 15:25:40,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 185 transitions, 798 flow [2025-03-04 15:25:40,138 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 185 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:40,140 INFO L231 Difference]: Finished difference. Result has 160 places, 185 transitions, 597 flow [2025-03-04 15:25:40,140 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=178, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=597, PETRI_PLACES=160, PETRI_TRANSITIONS=185} [2025-03-04 15:25:40,141 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 13 predicate places. [2025-03-04 15:25:40,141 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 185 transitions, 597 flow [2025-03-04 15:25:40,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-04 15:25:40,141 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:40,141 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 1, 1] [2025-03-04 15:25:40,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 15:25:40,142 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:40,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:40,142 INFO L85 PathProgramCache]: Analyzing trace with hash 911474164, now seen corresponding path program 2 times [2025-03-04 15:25:40,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:40,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525678888] [2025-03-04 15:25:40,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:40,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:40,151 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:25:40,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:25:40,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:40,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:40,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:25:40,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525678888] [2025-03-04 15:25:40,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525678888] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:40,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564153961] [2025-03-04 15:25:40,183 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:40,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:40,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:40,185 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:40,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 15:25:40,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-03-04 15:25:40,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 4 of 16 statements. [2025-03-04 15:25:40,265 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:40,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:40,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 15:25:40,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:40,292 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:25:40,292 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:40,316 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-04 15:25:40,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564153961] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:40,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:40,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 4 [2025-03-04 15:25:40,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021305865] [2025-03-04 15:25:40,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:40,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:25:40,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:40,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:25:40,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:25:40,331 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:40,332 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 185 transitions, 597 flow. Second operand has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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-03-04 15:25:40,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:40,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:40,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:41,268 INFO L124 PetriNetUnfolderBase]: 5577/12657 cut-off events. [2025-03-04 15:25:41,269 INFO L125 PetriNetUnfolderBase]: For 1994/2111 co-relation queries the response was YES. [2025-03-04 15:25:41,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23223 conditions, 12657 events. 5577/12657 cut-off events. For 1994/2111 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 121417 event pairs, 3653 based on Foata normal form. 67/10858 useless extension candidates. Maximal degree in co-relation 23164. Up to 8075 conditions per place. [2025-03-04 15:25:41,307 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 78 selfloop transitions, 25 changer transitions 0/183 dead transitions. [2025-03-04 15:25:41,307 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 183 transitions, 783 flow [2025-03-04 15:25:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 410 transitions. [2025-03-04 15:25:41,309 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.606508875739645 [2025-03-04 15:25:41,310 INFO L175 Difference]: Start difference. First operand has 160 places, 185 transitions, 597 flow. Second operand 4 states and 410 transitions. [2025-03-04 15:25:41,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 183 transitions, 783 flow [2025-03-04 15:25:41,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 183 transitions, 749 flow, removed 2 selfloop flow, removed 6 redundant places. [2025-03-04 15:25:41,323 INFO L231 Difference]: Finished difference. Result has 155 places, 183 transitions, 593 flow [2025-03-04 15:25:41,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=593, PETRI_PLACES=155, PETRI_TRANSITIONS=183} [2025-03-04 15:25:41,325 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 8 predicate places. [2025-03-04 15:25:41,325 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 183 transitions, 593 flow [2025-03-04 15:25:41,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 84.66666666666667) internal successors, (508), 6 states have internal predecessors, (508), 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-03-04 15:25:41,325 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:41,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:41,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 15:25:41,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:41,530 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:41,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:41,530 INFO L85 PathProgramCache]: Analyzing trace with hash 286635329, now seen corresponding path program 1 times [2025-03-04 15:25:41,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:41,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394316922] [2025-03-04 15:25:41,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:41,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:41,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:25:41,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:25:41,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:41,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:41,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394316922] [2025-03-04 15:25:41,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394316922] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:41,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1347842798] [2025-03-04 15:25:41,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:41,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:41,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:41,615 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:41,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 15:25:41,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-04 15:25:41,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-04 15:25:41,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:41,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:41,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:25:41,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:41,724 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:41,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:41,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 15:25:41,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1347842798] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:41,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:41,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-03-04 15:25:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632420893] [2025-03-04 15:25:41,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:41,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 15:25:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:41,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 15:25:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-04 15:25:41,770 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:41,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 183 transitions, 593 flow. Second operand has 11 states, 11 states have (on average 84.72727272727273) internal successors, (932), 11 states have internal predecessors, (932), 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-03-04 15:25:41,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:41,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:41,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:42,510 INFO L124 PetriNetUnfolderBase]: 5573/12653 cut-off events. [2025-03-04 15:25:42,510 INFO L125 PetriNetUnfolderBase]: For 1992/2109 co-relation queries the response was YES. [2025-03-04 15:25:42,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23213 conditions, 12653 events. 5573/12653 cut-off events. For 1992/2109 co-relation queries the response was YES. Maximal size of possible extension queue 608. Compared 121249 event pairs, 3653 based on Foata normal form. 67/10853 useless extension candidates. Maximal degree in co-relation 23079. Up to 8079 conditions per place. [2025-03-04 15:25:42,545 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 78 selfloop transitions, 21 changer transitions 0/179 dead transitions. [2025-03-04 15:25:42,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 179 transitions, 767 flow [2025-03-04 15:25:42,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:25:42,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:25:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 671 transitions. [2025-03-04 15:25:42,547 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5672020287404903 [2025-03-04 15:25:42,547 INFO L175 Difference]: Start difference. First operand has 155 places, 183 transitions, 593 flow. Second operand 7 states and 671 transitions. [2025-03-04 15:25:42,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 179 transitions, 767 flow [2025-03-04 15:25:42,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 179 transitions, 721 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:42,561 INFO L231 Difference]: Finished difference. Result has 158 places, 179 transitions, 565 flow [2025-03-04 15:25:42,561 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=523, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=565, PETRI_PLACES=158, PETRI_TRANSITIONS=179} [2025-03-04 15:25:42,561 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 11 predicate places. [2025-03-04 15:25:42,561 INFO L471 AbstractCegarLoop]: Abstraction has has 158 places, 179 transitions, 565 flow [2025-03-04 15:25:42,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 84.72727272727273) internal successors, (932), 11 states have internal predecessors, (932), 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-03-04 15:25:42,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:42,562 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:42,570 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 15:25:42,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:42,762 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:42,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:42,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1129156479, now seen corresponding path program 2 times [2025-03-04 15:25:42,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:42,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044986561] [2025-03-04 15:25:42,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:42,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:42,774 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-04 15:25:42,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 11 of 29 statements. [2025-03-04 15:25:42,780 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:42,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:25:42,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:42,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044986561] [2025-03-04 15:25:42,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044986561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:42,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:42,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:42,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305041053] [2025-03-04 15:25:42,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:42,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:42,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:42,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:42,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:42,848 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:25:42,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 179 transitions, 565 flow. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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-03-04 15:25:42,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:42,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:25:42,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:43,529 INFO L124 PetriNetUnfolderBase]: 6450/14208 cut-off events. [2025-03-04 15:25:43,529 INFO L125 PetriNetUnfolderBase]: For 2316/2346 co-relation queries the response was YES. [2025-03-04 15:25:43,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26501 conditions, 14208 events. 6450/14208 cut-off events. For 2316/2346 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 134533 event pairs, 3336 based on Foata normal form. 30/12157 useless extension candidates. Maximal degree in co-relation 26372. Up to 7303 conditions per place. [2025-03-04 15:25:43,573 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 132 selfloop transitions, 7 changer transitions 0/215 dead transitions. [2025-03-04 15:25:43,573 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 215 transitions, 918 flow [2025-03-04 15:25:43,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:43,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 441 transitions. [2025-03-04 15:25:43,575 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6523668639053254 [2025-03-04 15:25:43,575 INFO L175 Difference]: Start difference. First operand has 158 places, 179 transitions, 565 flow. Second operand 4 states and 441 transitions. [2025-03-04 15:25:43,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 215 transitions, 918 flow [2025-03-04 15:25:43,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 215 transitions, 901 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:25:43,594 INFO L231 Difference]: Finished difference. Result has 157 places, 179 transitions, 572 flow [2025-03-04 15:25:43,594 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=546, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=572, PETRI_PLACES=157, PETRI_TRANSITIONS=179} [2025-03-04 15:25:43,594 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 10 predicate places. [2025-03-04 15:25:43,594 INFO L471 AbstractCegarLoop]: Abstraction has has 157 places, 179 transitions, 572 flow [2025-03-04 15:25:43,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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-03-04 15:25:43,595 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:43,595 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:43,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 15:25:43,595 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:43,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1646648668, now seen corresponding path program 1 times [2025-03-04 15:25:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:43,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681627740] [2025-03-04 15:25:43,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:43,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:43,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:25:43,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:25:43,610 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:43,610 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:43,675 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:25:43,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:43,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681627740] [2025-03-04 15:25:43,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681627740] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:43,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:43,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:43,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026760076] [2025-03-04 15:25:43,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:43,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:43,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:43,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:43,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:43,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 169 [2025-03-04 15:25:43,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 179 transitions, 572 flow. Second operand has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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-03-04 15:25:43,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:43,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 169 [2025-03-04 15:25:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:44,629 INFO L124 PetriNetUnfolderBase]: 6743/14788 cut-off events. [2025-03-04 15:25:44,630 INFO L125 PetriNetUnfolderBase]: For 4560/4761 co-relation queries the response was YES. [2025-03-04 15:25:44,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28352 conditions, 14788 events. 6743/14788 cut-off events. For 4560/4761 co-relation queries the response was YES. Maximal size of possible extension queue 656. Compared 140279 event pairs, 3553 based on Foata normal form. 321/12682 useless extension candidates. Maximal degree in co-relation 28229. Up to 7689 conditions per place. [2025-03-04 15:25:44,690 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 141 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-03-04 15:25:44,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 217 transitions, 1002 flow [2025-03-04 15:25:44,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:44,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2025-03-04 15:25:44,692 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6420118343195266 [2025-03-04 15:25:44,692 INFO L175 Difference]: Start difference. First operand has 157 places, 179 transitions, 572 flow. Second operand 4 states and 434 transitions. [2025-03-04 15:25:44,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 217 transitions, 1002 flow [2025-03-04 15:25:44,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 217 transitions, 989 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:44,731 INFO L231 Difference]: Finished difference. Result has 156 places, 177 transitions, 570 flow [2025-03-04 15:25:44,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=570, PETRI_PLACES=156, PETRI_TRANSITIONS=177} [2025-03-04 15:25:44,732 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2025-03-04 15:25:44,732 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 177 transitions, 570 flow [2025-03-04 15:25:44,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.5) internal successors, (330), 4 states have internal predecessors, (330), 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-03-04 15:25:44,732 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:44,732 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:44,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 15:25:44,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:44,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1647665535, now seen corresponding path program 1 times [2025-03-04 15:25:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892050386] [2025-03-04 15:25:44,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:44,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:44,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:25:44,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:25:44,756 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:44,756 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:44,808 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-04 15:25:44,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:44,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892050386] [2025-03-04 15:25:44,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892050386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:44,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:44,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:44,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466111380] [2025-03-04 15:25:44,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:44,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:25:44,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:44,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:25:44,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 15:25:44,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:44,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 177 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03-04 15:25:44,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:44,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:44,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:46,202 INFO L124 PetriNetUnfolderBase]: 9793/20904 cut-off events. [2025-03-04 15:25:46,202 INFO L125 PetriNetUnfolderBase]: For 5698/6089 co-relation queries the response was YES. [2025-03-04 15:25:46,226 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40286 conditions, 20904 events. 9793/20904 cut-off events. For 5698/6089 co-relation queries the response was YES. Maximal size of possible extension queue 726. Compared 200549 event pairs, 4433 based on Foata normal form. 413/18539 useless extension candidates. Maximal degree in co-relation 40163. Up to 9538 conditions per place. [2025-03-04 15:25:46,269 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 162 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-03-04 15:25:46,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 237 transitions, 1075 flow [2025-03-04 15:25:46,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:25:46,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:25:46,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2025-03-04 15:25:46,271 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7633136094674556 [2025-03-04 15:25:46,271 INFO L175 Difference]: Start difference. First operand has 156 places, 177 transitions, 570 flow. Second operand 3 states and 387 transitions. [2025-03-04 15:25:46,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 237 transitions, 1075 flow [2025-03-04 15:25:46,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 237 transitions, 1065 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:46,322 INFO L231 Difference]: Finished difference. Result has 156 places, 178 transitions, 578 flow [2025-03-04 15:25:46,323 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=578, PETRI_PLACES=156, PETRI_TRANSITIONS=178} [2025-03-04 15:25:46,323 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 9 predicate places. [2025-03-04 15:25:46,323 INFO L471 AbstractCegarLoop]: Abstraction has has 156 places, 178 transitions, 578 flow [2025-03-04 15:25:46,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 88.0) internal successors, (264), 3 states have internal predecessors, (264), 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-03-04 15:25:46,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:46,324 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:46,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 15:25:46,324 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:46,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:46,324 INFO L85 PathProgramCache]: Analyzing trace with hash -644141851, now seen corresponding path program 1 times [2025-03-04 15:25:46,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:46,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723973698] [2025-03-04 15:25:46,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:46,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:46,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:25:46,339 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:25:46,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:46,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:25:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723973698] [2025-03-04 15:25:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723973698] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:25:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551650486] [2025-03-04 15:25:46,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:46,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:25:46,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:25:46,452 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:25:46,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 15:25:46,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-04 15:25:46,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-04 15:25:46,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:46,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:46,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-04 15:25:46,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:25:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:25:46,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 15:25:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-04 15:25:46,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551650486] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 15:25:46,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 15:25:46,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-03-04 15:25:46,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900471743] [2025-03-04 15:25:46,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 15:25:46,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 15:25:46,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:46,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 15:25:46,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2025-03-04 15:25:46,722 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:25:46,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 178 transitions, 578 flow. Second operand has 18 states, 18 states have (on average 84.55555555555556) internal successors, (1522), 18 states have internal predecessors, (1522), 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-03-04 15:25:46,723 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:46,723 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:25:46,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:48,020 INFO L124 PetriNetUnfolderBase]: 9277/21098 cut-off events. [2025-03-04 15:25:48,020 INFO L125 PetriNetUnfolderBase]: For 5638/5931 co-relation queries the response was YES. [2025-03-04 15:25:48,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39964 conditions, 21098 events. 9277/21098 cut-off events. For 5638/5931 co-relation queries the response was YES. Maximal size of possible extension queue 763. Compared 212478 event pairs, 6297 based on Foata normal form. 157/18391 useless extension candidates. Maximal degree in co-relation 39837. Up to 13586 conditions per place. [2025-03-04 15:25:48,095 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 79 selfloop transitions, 22 changer transitions 0/178 dead transitions. [2025-03-04 15:25:48,095 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 178 transitions, 785 flow [2025-03-04 15:25:48,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 15:25:48,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-04 15:25:48,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1011 transitions. [2025-03-04 15:25:48,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5438407746100054 [2025-03-04 15:25:48,097 INFO L175 Difference]: Start difference. First operand has 156 places, 178 transitions, 578 flow. Second operand 11 states and 1011 transitions. [2025-03-04 15:25:48,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 178 transitions, 785 flow [2025-03-04 15:25:48,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 178 transitions, 783 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:25:48,139 INFO L231 Difference]: Finished difference. Result has 167 places, 178 transitions, 643 flow [2025-03-04 15:25:48,139 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=565, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=643, PETRI_PLACES=167, PETRI_TRANSITIONS=178} [2025-03-04 15:25:48,140 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 20 predicate places. [2025-03-04 15:25:48,140 INFO L471 AbstractCegarLoop]: Abstraction has has 167 places, 178 transitions, 643 flow [2025-03-04 15:25:48,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 84.55555555555556) internal successors, (1522), 18 states have internal predecessors, (1522), 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-03-04 15:25:48,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:48,141 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:48,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-04 15:25:48,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-04 15:25:48,341 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:48,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:48,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1992373851, now seen corresponding path program 2 times [2025-03-04 15:25:48,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:48,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062655010] [2025-03-04 15:25:48,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 15:25:48,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:48,350 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 42 statements into 2 equivalence classes. [2025-03-04 15:25:48,356 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 12 of 42 statements. [2025-03-04 15:25:48,357 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 15:25:48,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:48,384 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:25:48,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:48,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062655010] [2025-03-04 15:25:48,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062655010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:48,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:48,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:48,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13241006] [2025-03-04 15:25:48,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:48,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:48,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:48,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:48,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:48,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 169 [2025-03-04 15:25:48,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 178 transitions, 643 flow. Second operand has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:48,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:48,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 169 [2025-03-04 15:25:48,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:49,705 INFO L124 PetriNetUnfolderBase]: 10532/22942 cut-off events. [2025-03-04 15:25:49,705 INFO L125 PetriNetUnfolderBase]: For 7064/7158 co-relation queries the response was YES. [2025-03-04 15:25:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44515 conditions, 22942 events. 10532/22942 cut-off events. For 7064/7158 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 225841 event pairs, 5805 based on Foata normal form. 184/19969 useless extension candidates. Maximal degree in co-relation 44357. Up to 12440 conditions per place. [2025-03-04 15:25:49,799 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 136 selfloop transitions, 7 changer transitions 0/213 dead transitions. [2025-03-04 15:25:49,799 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 213 transitions, 1004 flow [2025-03-04 15:25:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:49,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:49,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 432 transitions. [2025-03-04 15:25:49,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6390532544378699 [2025-03-04 15:25:49,800 INFO L175 Difference]: Start difference. First operand has 167 places, 178 transitions, 643 flow. Second operand 4 states and 432 transitions. [2025-03-04 15:25:49,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 213 transitions, 1004 flow [2025-03-04 15:25:49,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 213 transitions, 972 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-03-04 15:25:49,859 INFO L231 Difference]: Finished difference. Result has 161 places, 177 transitions, 621 flow [2025-03-04 15:25:49,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=621, PETRI_PLACES=161, PETRI_TRANSITIONS=177} [2025-03-04 15:25:49,860 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2025-03-04 15:25:49,860 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 177 transitions, 621 flow [2025-03-04 15:25:49,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.25) internal successors, (329), 4 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:25:49,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:49,860 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:49,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 15:25:49,861 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:49,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash 660983552, now seen corresponding path program 1 times [2025-03-04 15:25:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:49,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997802703] [2025-03-04 15:25:49,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:49,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:49,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:49,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:49,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:49,953 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:25:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:49,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997802703] [2025-03-04 15:25:49,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997802703] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:49,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:49,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684488861] [2025-03-04 15:25:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:49,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:49,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:49,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:49,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:25:49,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 177 transitions, 621 flow. Second operand has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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-03-04 15:25:49,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:49,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:25:49,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:51,444 INFO L124 PetriNetUnfolderBase]: 10737/23881 cut-off events. [2025-03-04 15:25:51,444 INFO L125 PetriNetUnfolderBase]: For 7823/8156 co-relation queries the response was YES. [2025-03-04 15:25:51,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46020 conditions, 23881 events. 10737/23881 cut-off events. For 7823/8156 co-relation queries the response was YES. Maximal size of possible extension queue 847. Compared 239601 event pairs, 5839 based on Foata normal form. 223/20959 useless extension candidates. Maximal degree in co-relation 45876. Up to 12495 conditions per place. [2025-03-04 15:25:51,570 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 139 selfloop transitions, 7 changer transitions 0/218 dead transitions. [2025-03-04 15:25:51,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 218 transitions, 1058 flow [2025-03-04 15:25:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 440 transitions. [2025-03-04 15:25:51,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.650887573964497 [2025-03-04 15:25:51,572 INFO L175 Difference]: Start difference. First operand has 161 places, 177 transitions, 621 flow. Second operand 4 states and 440 transitions. [2025-03-04 15:25:51,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 218 transitions, 1058 flow [2025-03-04 15:25:51,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 218 transitions, 1038 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:51,638 INFO L231 Difference]: Finished difference. Result has 161 places, 177 transitions, 629 flow [2025-03-04 15:25:51,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=605, PETRI_DIFFERENCE_MINUEND_PLACES=157, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=629, PETRI_PLACES=161, PETRI_TRANSITIONS=177} [2025-03-04 15:25:51,638 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 14 predicate places. [2025-03-04 15:25:51,638 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 177 transitions, 629 flow [2025-03-04 15:25:51,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.5) internal successors, (338), 4 states have internal predecessors, (338), 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-03-04 15:25:51,638 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:51,638 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:51,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 15:25:51,639 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:51,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:51,639 INFO L85 PathProgramCache]: Analyzing trace with hash -28529687, now seen corresponding path program 1 times [2025-03-04 15:25:51,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:51,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109458336] [2025-03-04 15:25:51,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:51,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:51,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:51,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:51,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:51,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:51,754 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:25:51,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:51,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109458336] [2025-03-04 15:25:51,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109458336] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:51,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:51,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:51,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377195061] [2025-03-04 15:25:51,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:51,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:51,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:51,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:51,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:51,765 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:25:51,765 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 177 transitions, 629 flow. Second operand has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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-03-04 15:25:51,765 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:51,765 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:25:51,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:53,486 INFO L124 PetriNetUnfolderBase]: 11215/23647 cut-off events. [2025-03-04 15:25:53,487 INFO L125 PetriNetUnfolderBase]: For 7991/8072 co-relation queries the response was YES. [2025-03-04 15:25:53,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47664 conditions, 23647 events. 11215/23647 cut-off events. For 7991/8072 co-relation queries the response was YES. Maximal size of possible extension queue 798. Compared 228165 event pairs, 5178 based on Foata normal form. 269/21730 useless extension candidates. Maximal degree in co-relation 47519. Up to 10655 conditions per place. [2025-03-04 15:25:53,662 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 202 selfloop transitions, 3 changer transitions 0/274 dead transitions. [2025-03-04 15:25:53,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 274 transitions, 1302 flow [2025-03-04 15:25:53,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:53,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:53,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 499 transitions. [2025-03-04 15:25:53,664 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7381656804733728 [2025-03-04 15:25:53,664 INFO L175 Difference]: Start difference. First operand has 161 places, 177 transitions, 629 flow. Second operand 4 states and 499 transitions. [2025-03-04 15:25:53,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 274 transitions, 1302 flow [2025-03-04 15:25:53,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 274 transitions, 1286 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:53,834 INFO L231 Difference]: Finished difference. Result has 164 places, 178 transitions, 639 flow [2025-03-04 15:25:53,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=621, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=639, PETRI_PLACES=164, PETRI_TRANSITIONS=178} [2025-03-04 15:25:53,835 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 17 predicate places. [2025-03-04 15:25:53,835 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 178 transitions, 639 flow [2025-03-04 15:25:53,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.25) internal successors, (341), 4 states have internal predecessors, (341), 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-03-04 15:25:53,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:53,835 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:53,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 15:25:53,835 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:53,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:53,836 INFO L85 PathProgramCache]: Analyzing trace with hash -65871774, now seen corresponding path program 1 times [2025-03-04 15:25:53,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:53,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721774172] [2025-03-04 15:25:53,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:53,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:53,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:53,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:53,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:53,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:25:53,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:53,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721774172] [2025-03-04 15:25:53,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721774172] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:53,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:53,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:25:53,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784662974] [2025-03-04 15:25:53,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:53,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:53,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:53,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:53,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:53,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:25:53,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 178 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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-03-04 15:25:53,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:53,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:25:53,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:55,256 INFO L124 PetriNetUnfolderBase]: 10599/23934 cut-off events. [2025-03-04 15:25:55,256 INFO L125 PetriNetUnfolderBase]: For 8462/8549 co-relation queries the response was YES. [2025-03-04 15:25:55,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47548 conditions, 23934 events. 10599/23934 cut-off events. For 8462/8549 co-relation queries the response was YES. Maximal size of possible extension queue 829. Compared 242761 event pairs, 4631 based on Foata normal form. 87/21424 useless extension candidates. Maximal degree in co-relation 47402. Up to 10290 conditions per place. [2025-03-04 15:25:55,431 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 136 selfloop transitions, 7 changer transitions 0/216 dead transitions. [2025-03-04 15:25:55,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 216 transitions, 1022 flow [2025-03-04 15:25:55,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:55,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 439 transitions. [2025-03-04 15:25:55,432 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6494082840236687 [2025-03-04 15:25:55,433 INFO L175 Difference]: Start difference. First operand has 164 places, 178 transitions, 639 flow. Second operand 4 states and 439 transitions. [2025-03-04 15:25:55,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 216 transitions, 1022 flow [2025-03-04 15:25:55,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 216 transitions, 1018 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:55,603 INFO L231 Difference]: Finished difference. Result has 165 places, 178 transitions, 661 flow [2025-03-04 15:25:55,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=633, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=661, PETRI_PLACES=165, PETRI_TRANSITIONS=178} [2025-03-04 15:25:55,603 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 18 predicate places. [2025-03-04 15:25:55,603 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 178 transitions, 661 flow [2025-03-04 15:25:55,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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-03-04 15:25:55,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:55,604 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:55,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 15:25:55,604 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:55,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:55,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1634046838, now seen corresponding path program 1 times [2025-03-04 15:25:55,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:55,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611452812] [2025-03-04 15:25:55,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:55,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:55,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:55,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:55,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:55,724 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:25:55,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:55,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611452812] [2025-03-04 15:25:55,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611452812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:55,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:55,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:55,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755775753] [2025-03-04 15:25:55,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:55,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:25:55,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:55,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:25:55,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:25:55,774 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 169 [2025-03-04 15:25:55,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 178 transitions, 661 flow. Second operand has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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-03-04 15:25:55,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:55,775 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 169 [2025-03-04 15:25:55,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:57,391 INFO L124 PetriNetUnfolderBase]: 14888/28948 cut-off events. [2025-03-04 15:25:57,391 INFO L125 PetriNetUnfolderBase]: For 9384/9448 co-relation queries the response was YES. [2025-03-04 15:25:57,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61666 conditions, 28948 events. 14888/28948 cut-off events. For 9384/9448 co-relation queries the response was YES. Maximal size of possible extension queue 901. Compared 264610 event pairs, 5995 based on Foata normal form. 0/26295 useless extension candidates. Maximal degree in co-relation 61518. Up to 12946 conditions per place. [2025-03-04 15:25:57,590 INFO L140 encePairwiseOnDemand]: 158/169 looper letters, 176 selfloop transitions, 13 changer transitions 0/253 dead transitions. [2025-03-04 15:25:57,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 253 transitions, 1223 flow [2025-03-04 15:25:57,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:25:57,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:25:57,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 546 transitions. [2025-03-04 15:25:57,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6461538461538462 [2025-03-04 15:25:57,592 INFO L175 Difference]: Start difference. First operand has 165 places, 178 transitions, 661 flow. Second operand 5 states and 546 transitions. [2025-03-04 15:25:57,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 253 transitions, 1223 flow [2025-03-04 15:25:57,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 253 transitions, 1215 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:25:57,761 INFO L231 Difference]: Finished difference. Result has 168 places, 178 transitions, 703 flow [2025-03-04 15:25:57,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=703, PETRI_PLACES=168, PETRI_TRANSITIONS=178} [2025-03-04 15:25:57,761 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places. [2025-03-04 15:25:57,761 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 178 transitions, 703 flow [2025-03-04 15:25:57,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.0) internal successors, (400), 5 states have internal predecessors, (400), 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-03-04 15:25:57,761 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:57,761 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:57,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 15:25:57,762 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:57,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:57,762 INFO L85 PathProgramCache]: Analyzing trace with hash -1634045845, now seen corresponding path program 1 times [2025-03-04 15:25:57,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:57,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98342837] [2025-03-04 15:25:57,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:57,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:57,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 15:25:57,779 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 15:25:57,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:57,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:25:57,821 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:25:57,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:25:57,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98342837] [2025-03-04 15:25:57,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98342837] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:25:57,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:25:57,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:25:57,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222195051] [2025-03-04 15:25:57,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:25:57,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:25:57,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:25:57,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:25:57,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:25:57,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:25:57,855 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 178 transitions, 703 flow. Second operand has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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-03-04 15:25:57,855 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:25:57,855 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:25:57,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:25:59,518 INFO L124 PetriNetUnfolderBase]: 11960/25740 cut-off events. [2025-03-04 15:25:59,518 INFO L125 PetriNetUnfolderBase]: For 17111/17113 co-relation queries the response was YES. [2025-03-04 15:25:59,573 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56635 conditions, 25740 events. 11960/25740 cut-off events. For 17111/17113 co-relation queries the response was YES. Maximal size of possible extension queue 834. Compared 253520 event pairs, 5435 based on Foata normal form. 282/23887 useless extension candidates. Maximal degree in co-relation 56485. Up to 11919 conditions per place. [2025-03-04 15:25:59,647 INFO L140 encePairwiseOnDemand]: 159/169 looper letters, 177 selfloop transitions, 10 changer transitions 0/252 dead transitions. [2025-03-04 15:25:59,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 171 places, 252 transitions, 1251 flow [2025-03-04 15:25:59,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:25:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:25:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-03-04 15:25:59,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6819526627218935 [2025-03-04 15:25:59,649 INFO L175 Difference]: Start difference. First operand has 168 places, 178 transitions, 703 flow. Second operand 4 states and 461 transitions. [2025-03-04 15:25:59,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 171 places, 252 transitions, 1251 flow [2025-03-04 15:25:59,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 252 transitions, 1234 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:25:59,937 INFO L231 Difference]: Finished difference. Result has 168 places, 176 transitions, 694 flow [2025-03-04 15:25:59,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=694, PETRI_PLACES=168, PETRI_TRANSITIONS=176} [2025-03-04 15:25:59,937 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 21 predicate places. [2025-03-04 15:25:59,937 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 176 transitions, 694 flow [2025-03-04 15:25:59,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.5) internal successors, (314), 4 states have internal predecessors, (314), 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-03-04 15:25:59,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:25:59,938 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:25:59,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 15:25:59,938 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:25:59,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:25:59,938 INFO L85 PathProgramCache]: Analyzing trace with hash -8336185, now seen corresponding path program 1 times [2025-03-04 15:25:59,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:25:59,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804125397] [2025-03-04 15:25:59,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:25:59,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:25:59,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:25:59,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:25:59,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:25:59,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:00,037 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:00,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:00,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804125397] [2025-03-04 15:26:00,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804125397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:00,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:00,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078700023] [2025-03-04 15:26:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:00,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:00,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:00,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:00,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:00,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:26:00,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 176 transitions, 694 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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-03-04 15:26:00,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:00,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:26:00,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:01,286 INFO L124 PetriNetUnfolderBase]: 9849/20157 cut-off events. [2025-03-04 15:26:01,286 INFO L125 PetriNetUnfolderBase]: For 18946/19403 co-relation queries the response was YES. [2025-03-04 15:26:01,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45482 conditions, 20157 events. 9849/20157 cut-off events. For 18946/19403 co-relation queries the response was YES. Maximal size of possible extension queue 655. Compared 183070 event pairs, 4839 based on Foata normal form. 213/18853 useless extension candidates. Maximal degree in co-relation 45333. Up to 10203 conditions per place. [2025-03-04 15:26:01,409 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 227 selfloop transitions, 4 changer transitions 18/317 dead transitions. [2025-03-04 15:26:01,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 317 transitions, 1828 flow [2025-03-04 15:26:01,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:01,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:01,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 614 transitions. [2025-03-04 15:26:01,411 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7266272189349112 [2025-03-04 15:26:01,411 INFO L175 Difference]: Start difference. First operand has 168 places, 176 transitions, 694 flow. Second operand 5 states and 614 transitions. [2025-03-04 15:26:01,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 317 transitions, 1828 flow [2025-03-04 15:26:01,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 317 transitions, 1778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:01,621 INFO L231 Difference]: Finished difference. Result has 173 places, 178 transitions, 705 flow [2025-03-04 15:26:01,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=680, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=705, PETRI_PLACES=173, PETRI_TRANSITIONS=178} [2025-03-04 15:26:01,621 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 26 predicate places. [2025-03-04 15:26:01,621 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 178 transitions, 705 flow [2025-03-04 15:26:01,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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-03-04 15:26:01,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:01,621 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:01,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 15:26:01,621 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:01,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:01,622 INFO L85 PathProgramCache]: Analyzing trace with hash -2042054361, now seen corresponding path program 1 times [2025-03-04 15:26:01,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:01,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622092092] [2025-03-04 15:26:01,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:01,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:01,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:26:01,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:26:01,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:01,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:01,693 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:01,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:01,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622092092] [2025-03-04 15:26:01,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622092092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:01,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:01,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 15:26:01,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513780092] [2025-03-04 15:26:01,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:01,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:01,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:01,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:01,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:01,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 169 [2025-03-04 15:26:01,713 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 178 transitions, 705 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-03-04 15:26:01,713 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:01,713 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 169 [2025-03-04 15:26:01,714 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:02,902 INFO L124 PetriNetUnfolderBase]: 9600/21126 cut-off events. [2025-03-04 15:26:02,902 INFO L125 PetriNetUnfolderBase]: For 16234/16319 co-relation queries the response was YES. [2025-03-04 15:26:02,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46909 conditions, 21126 events. 9600/21126 cut-off events. For 16234/16319 co-relation queries the response was YES. Maximal size of possible extension queue 672. Compared 203666 event pairs, 4604 based on Foata normal form. 257/19911 useless extension candidates. Maximal degree in co-relation 46758. Up to 9953 conditions per place. [2025-03-04 15:26:03,055 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 141 selfloop transitions, 6 changer transitions 0/216 dead transitions. [2025-03-04 15:26:03,055 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 216 transitions, 1109 flow [2025-03-04 15:26:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:03,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2025-03-04 15:26:03,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.636094674556213 [2025-03-04 15:26:03,057 INFO L175 Difference]: Start difference. First operand has 173 places, 178 transitions, 705 flow. Second operand 4 states and 430 transitions. [2025-03-04 15:26:03,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 216 transitions, 1109 flow [2025-03-04 15:26:03,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 216 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:03,243 INFO L231 Difference]: Finished difference. Result has 174 places, 177 transitions, 709 flow [2025-03-04 15:26:03,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=697, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=709, PETRI_PLACES=174, PETRI_TRANSITIONS=177} [2025-03-04 15:26:03,243 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 27 predicate places. [2025-03-04 15:26:03,244 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 177 transitions, 709 flow [2025-03-04 15:26:03,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-03-04 15:26:03,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:03,244 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:03,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 15:26:03,244 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:03,244 INFO L85 PathProgramCache]: Analyzing trace with hash 884156974, now seen corresponding path program 1 times [2025-03-04 15:26:03,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:03,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97248743] [2025-03-04 15:26:03,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:03,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:03,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-04 15:26:03,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-04 15:26:03,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:03,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:03,344 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:03,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:03,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97248743] [2025-03-04 15:26:03,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97248743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:03,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:03,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118583963] [2025-03-04 15:26:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:03,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:03,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:03,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:03,413 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 169 [2025-03-04 15:26:03,414 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 177 transitions, 709 flow. Second operand has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 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-03-04 15:26:03,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:03,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 169 [2025-03-04 15:26:03,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:05,487 INFO L124 PetriNetUnfolderBase]: 12602/24608 cut-off events. [2025-03-04 15:26:05,488 INFO L125 PetriNetUnfolderBase]: For 19926/20064 co-relation queries the response was YES. [2025-03-04 15:26:05,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56320 conditions, 24608 events. 12602/24608 cut-off events. For 19926/20064 co-relation queries the response was YES. Maximal size of possible extension queue 677. Compared 216628 event pairs, 6136 based on Foata normal form. 538/23387 useless extension candidates. Maximal degree in co-relation 56167. Up to 12821 conditions per place. [2025-03-04 15:26:05,638 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 298 selfloop transitions, 14 changer transitions 0/374 dead transitions. [2025-03-04 15:26:05,638 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 374 transitions, 1909 flow [2025-03-04 15:26:05,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:26:05,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:26:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 833 transitions. [2025-03-04 15:26:05,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6161242603550295 [2025-03-04 15:26:05,640 INFO L175 Difference]: Start difference. First operand has 174 places, 177 transitions, 709 flow. Second operand 8 states and 833 transitions. [2025-03-04 15:26:05,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 374 transitions, 1909 flow [2025-03-04 15:26:05,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 374 transitions, 1897 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:05,809 INFO L231 Difference]: Finished difference. Result has 181 places, 179 transitions, 757 flow [2025-03-04 15:26:05,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=695, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=757, PETRI_PLACES=181, PETRI_TRANSITIONS=179} [2025-03-04 15:26:05,809 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 34 predicate places. [2025-03-04 15:26:05,809 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 179 transitions, 757 flow [2025-03-04 15:26:05,809 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.5) internal successors, (441), 6 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-03-04 15:26:05,809 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:05,810 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:05,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 15:26:05,810 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:05,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:05,810 INFO L85 PathProgramCache]: Analyzing trace with hash -450873334, now seen corresponding path program 1 times [2025-03-04 15:26:05,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:05,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586153868] [2025-03-04 15:26:05,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:05,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:05,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:26:05,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:05,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:05,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:05,862 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:05,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:05,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586153868] [2025-03-04 15:26:05,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586153868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:05,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:05,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:05,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881112801] [2025-03-04 15:26:05,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:05,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:05,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:05,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:05,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:05,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:05,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 181 places, 179 transitions, 757 flow. Second operand has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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-03-04 15:26:05,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:05,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:05,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:07,679 INFO L124 PetriNetUnfolderBase]: 11963/24988 cut-off events. [2025-03-04 15:26:07,680 INFO L125 PetriNetUnfolderBase]: For 35022/35980 co-relation queries the response was YES. [2025-03-04 15:26:07,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58941 conditions, 24988 events. 11963/24988 cut-off events. For 35022/35980 co-relation queries the response was YES. Maximal size of possible extension queue 774. Compared 237037 event pairs, 6357 based on Foata normal form. 812/23573 useless extension candidates. Maximal degree in co-relation 58784. Up to 13119 conditions per place. [2025-03-04 15:26:07,806 INFO L140 encePairwiseOnDemand]: 155/169 looper letters, 201 selfloop transitions, 13 changer transitions 0/276 dead transitions. [2025-03-04 15:26:07,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 276 transitions, 1665 flow [2025-03-04 15:26:07,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:07,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2025-03-04 15:26:07,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6863905325443787 [2025-03-04 15:26:07,807 INFO L175 Difference]: Start difference. First operand has 181 places, 179 transitions, 757 flow. Second operand 4 states and 464 transitions. [2025-03-04 15:26:07,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 276 transitions, 1665 flow [2025-03-04 15:26:07,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 181 places, 276 transitions, 1635 flow, removed 3 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:07,967 INFO L231 Difference]: Finished difference. Result has 183 places, 184 transitions, 822 flow [2025-03-04 15:26:07,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=745, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=822, PETRI_PLACES=183, PETRI_TRANSITIONS=184} [2025-03-04 15:26:07,967 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 36 predicate places. [2025-03-04 15:26:07,967 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 184 transitions, 822 flow [2025-03-04 15:26:07,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.0) internal successors, (316), 4 states have internal predecessors, (316), 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-03-04 15:26:07,967 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:07,967 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:07,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 15:26:07,968 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:07,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:07,968 INFO L85 PathProgramCache]: Analyzing trace with hash -450874327, now seen corresponding path program 1 times [2025-03-04 15:26:07,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:07,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712342274] [2025-03-04 15:26:07,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:07,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:07,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:26:07,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:07,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:07,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:08,047 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:08,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:08,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712342274] [2025-03-04 15:26:08,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712342274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:08,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:08,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:08,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796057274] [2025-03-04 15:26:08,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:08,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:08,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:08,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:08,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 15:26:08,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 169 [2025-03-04 15:26:08,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 184 transitions, 822 flow. Second operand has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 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-03-04 15:26:08,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:08,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 169 [2025-03-04 15:26:08,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:09,776 INFO L124 PetriNetUnfolderBase]: 13556/26439 cut-off events. [2025-03-04 15:26:09,776 INFO L125 PetriNetUnfolderBase]: For 37976/39248 co-relation queries the response was YES. [2025-03-04 15:26:09,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66891 conditions, 26439 events. 13556/26439 cut-off events. For 37976/39248 co-relation queries the response was YES. Maximal size of possible extension queue 758. Compared 237360 event pairs, 6357 based on Foata normal form. 892/25830 useless extension candidates. Maximal degree in co-relation 66733. Up to 13118 conditions per place. [2025-03-04 15:26:09,982 INFO L140 encePairwiseOnDemand]: 158/169 looper letters, 201 selfloop transitions, 12 changer transitions 0/275 dead transitions. [2025-03-04 15:26:09,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 275 transitions, 1690 flow [2025-03-04 15:26:09,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:09,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:09,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 545 transitions. [2025-03-04 15:26:09,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6449704142011834 [2025-03-04 15:26:09,983 INFO L175 Difference]: Start difference. First operand has 183 places, 184 transitions, 822 flow. Second operand 5 states and 545 transitions. [2025-03-04 15:26:09,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 275 transitions, 1690 flow [2025-03-04 15:26:10,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 275 transitions, 1683 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:10,247 INFO L231 Difference]: Finished difference. Result has 188 places, 186 transitions, 874 flow [2025-03-04 15:26:10,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=171, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=874, PETRI_PLACES=188, PETRI_TRANSITIONS=186} [2025-03-04 15:26:10,247 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 41 predicate places. [2025-03-04 15:26:10,247 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 186 transitions, 874 flow [2025-03-04 15:26:10,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.4) internal successors, (402), 5 states have internal predecessors, (402), 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-03-04 15:26:10,248 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:10,248 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:10,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 15:26:10,248 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:10,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:10,248 INFO L85 PathProgramCache]: Analyzing trace with hash -220214289, now seen corresponding path program 1 times [2025-03-04 15:26:10,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:10,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608308626] [2025-03-04 15:26:10,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:10,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:10,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:26:10,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:10,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:10,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:10,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:10,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608308626] [2025-03-04 15:26:10,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608308626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:10,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:10,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:10,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050456066] [2025-03-04 15:26:10,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:10,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:10,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:10,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:10,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:10,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:26:10,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 186 transitions, 874 flow. Second operand has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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-03-04 15:26:10,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:10,330 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:26:10,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:12,020 INFO L124 PetriNetUnfolderBase]: 11809/23780 cut-off events. [2025-03-04 15:26:12,020 INFO L125 PetriNetUnfolderBase]: For 38430/39664 co-relation queries the response was YES. [2025-03-04 15:26:12,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62088 conditions, 23780 events. 11809/23780 cut-off events. For 38430/39664 co-relation queries the response was YES. Maximal size of possible extension queue 742. Compared 217925 event pairs, 6790 based on Foata normal form. 1072/23890 useless extension candidates. Maximal degree in co-relation 61925. Up to 13940 conditions per place. [2025-03-04 15:26:12,190 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 216 selfloop transitions, 3 changer transitions 0/285 dead transitions. [2025-03-04 15:26:12,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 285 transitions, 1770 flow [2025-03-04 15:26:12,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 490 transitions. [2025-03-04 15:26:12,191 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7248520710059172 [2025-03-04 15:26:12,191 INFO L175 Difference]: Start difference. First operand has 188 places, 186 transitions, 874 flow. Second operand 4 states and 490 transitions. [2025-03-04 15:26:12,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 285 transitions, 1770 flow [2025-03-04 15:26:12,453 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 285 transitions, 1760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:12,455 INFO L231 Difference]: Finished difference. Result has 191 places, 187 transitions, 882 flow [2025-03-04 15:26:12,455 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=864, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=882, PETRI_PLACES=191, PETRI_TRANSITIONS=187} [2025-03-04 15:26:12,456 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 44 predicate places. [2025-03-04 15:26:12,456 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 187 transitions, 882 flow [2025-03-04 15:26:12,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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-03-04 15:26:12,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:12,456 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:12,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 15:26:12,456 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1120824652, now seen corresponding path program 1 times [2025-03-04 15:26:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395247844] [2025-03-04 15:26:12,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:12,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:26:12,474 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:12,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:12,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:12,513 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:12,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:12,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395247844] [2025-03-04 15:26:12,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395247844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:12,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:12,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:12,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091535697] [2025-03-04 15:26:12,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:12,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:12,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:12,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:12,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:12,524 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:26:12,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 187 transitions, 882 flow. Second operand has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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-03-04 15:26:12,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:12,525 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:26:12,525 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:14,188 INFO L124 PetriNetUnfolderBase]: 10132/20676 cut-off events. [2025-03-04 15:26:14,188 INFO L125 PetriNetUnfolderBase]: For 27167/27810 co-relation queries the response was YES. [2025-03-04 15:26:14,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53003 conditions, 20676 events. 10132/20676 cut-off events. For 27167/27810 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 186597 event pairs, 5363 based on Foata normal form. 555/20434 useless extension candidates. Maximal degree in co-relation 52838. Up to 10902 conditions per place. [2025-03-04 15:26:14,285 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 249 selfloop transitions, 4 changer transitions 20/341 dead transitions. [2025-03-04 15:26:14,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 341 transitions, 2095 flow [2025-03-04 15:26:14,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:14,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:14,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 619 transitions. [2025-03-04 15:26:14,287 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7325443786982249 [2025-03-04 15:26:14,287 INFO L175 Difference]: Start difference. First operand has 191 places, 187 transitions, 882 flow. Second operand 5 states and 619 transitions. [2025-03-04 15:26:14,287 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 341 transitions, 2095 flow [2025-03-04 15:26:14,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 341 transitions, 2087 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:14,440 INFO L231 Difference]: Finished difference. Result has 197 places, 189 transitions, 905 flow [2025-03-04 15:26:14,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=905, PETRI_PLACES=197, PETRI_TRANSITIONS=189} [2025-03-04 15:26:14,440 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 50 predicate places. [2025-03-04 15:26:14,440 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 189 transitions, 905 flow [2025-03-04 15:26:14,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.0) internal successors, (348), 4 states have internal predecessors, (348), 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-03-04 15:26:14,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:14,441 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:14,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 15:26:14,441 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:14,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:14,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1737645480, now seen corresponding path program 1 times [2025-03-04 15:26:14,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:14,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186074404] [2025-03-04 15:26:14,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:14,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:14,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 15:26:14,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 15:26:14,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:14,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:14,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186074404] [2025-03-04 15:26:14,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186074404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:14,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:14,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:14,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465066610] [2025-03-04 15:26:14,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:14,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:14,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:14,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:14,512 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:14,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 189 transitions, 905 flow. Second operand has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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-03-04 15:26:14,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:14,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:14,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:16,050 INFO L124 PetriNetUnfolderBase]: 10827/21955 cut-off events. [2025-03-04 15:26:16,050 INFO L125 PetriNetUnfolderBase]: For 28598/28949 co-relation queries the response was YES. [2025-03-04 15:26:16,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57056 conditions, 21955 events. 10827/21955 cut-off events. For 28598/28949 co-relation queries the response was YES. Maximal size of possible extension queue 657. Compared 195505 event pairs, 5893 based on Foata normal form. 460/21559 useless extension candidates. Maximal degree in co-relation 56889. Up to 12140 conditions per place. [2025-03-04 15:26:16,269 INFO L140 encePairwiseOnDemand]: 159/169 looper letters, 203 selfloop transitions, 10 changer transitions 0/279 dead transitions. [2025-03-04 15:26:16,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 279 transitions, 1739 flow [2025-03-04 15:26:16,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:16,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:16,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 456 transitions. [2025-03-04 15:26:16,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6745562130177515 [2025-03-04 15:26:16,270 INFO L175 Difference]: Start difference. First operand has 197 places, 189 transitions, 905 flow. Second operand 4 states and 456 transitions. [2025-03-04 15:26:16,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 279 transitions, 1739 flow [2025-03-04 15:26:16,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 279 transitions, 1733 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:16,518 INFO L231 Difference]: Finished difference. Result has 197 places, 187 transitions, 909 flow [2025-03-04 15:26:16,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=889, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=177, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=909, PETRI_PLACES=197, PETRI_TRANSITIONS=187} [2025-03-04 15:26:16,519 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 50 predicate places. [2025-03-04 15:26:16,519 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 187 transitions, 909 flow [2025-03-04 15:26:16,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 78.75) internal successors, (315), 4 states have internal predecessors, (315), 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-03-04 15:26:16,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:16,519 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:16,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 15:26:16,519 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:16,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:16,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1092200783, now seen corresponding path program 1 times [2025-03-04 15:26:16,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:16,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173136529] [2025-03-04 15:26:16,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:16,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:16,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-04 15:26:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-04 15:26:16,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:16,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:16,593 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:16,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:16,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173136529] [2025-03-04 15:26:16,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173136529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:16,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:16,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 15:26:16,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733389064] [2025-03-04 15:26:16,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:16,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:16,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:16,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:16,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:16,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 169 [2025-03-04 15:26:16,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 187 transitions, 909 flow. Second operand has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-03-04 15:26:16,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:16,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 169 [2025-03-04 15:26:16,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:18,438 INFO L124 PetriNetUnfolderBase]: 12523/23635 cut-off events. [2025-03-04 15:26:18,438 INFO L125 PetriNetUnfolderBase]: For 38957/39647 co-relation queries the response was YES. [2025-03-04 15:26:18,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64412 conditions, 23635 events. 12523/23635 cut-off events. For 38957/39647 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 198114 event pairs, 6376 based on Foata normal form. 891/23503 useless extension candidates. Maximal degree in co-relation 64244. Up to 12833 conditions per place. [2025-03-04 15:26:18,639 INFO L140 encePairwiseOnDemand]: 156/169 looper letters, 349 selfloop transitions, 13 changer transitions 0/419 dead transitions. [2025-03-04 15:26:18,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 419 transitions, 2904 flow [2025-03-04 15:26:18,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-04 15:26:18,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-03-04 15:26:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 831 transitions. [2025-03-04 15:26:18,640 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6146449704142012 [2025-03-04 15:26:18,640 INFO L175 Difference]: Start difference. First operand has 197 places, 187 transitions, 909 flow. Second operand 8 states and 831 transitions. [2025-03-04 15:26:18,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 419 transitions, 2904 flow [2025-03-04 15:26:18,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 419 transitions, 2837 flow, removed 6 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:18,921 INFO L231 Difference]: Finished difference. Result has 205 places, 189 transitions, 954 flow [2025-03-04 15:26:18,921 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=954, PETRI_PLACES=205, PETRI_TRANSITIONS=189} [2025-03-04 15:26:18,921 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 58 predicate places. [2025-03-04 15:26:18,921 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 189 transitions, 954 flow [2025-03-04 15:26:18,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.83333333333333) internal successors, (443), 6 states have internal predecessors, (443), 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-03-04 15:26:18,922 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:18,922 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:18,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 15:26:18,922 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:18,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:18,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1419803318, now seen corresponding path program 1 times [2025-03-04 15:26:18,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:18,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107556131] [2025-03-04 15:26:18,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:18,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:18,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-04 15:26:18,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-04 15:26:18,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:18,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:18,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:18,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107556131] [2025-03-04 15:26:18,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107556131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:18,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:18,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:18,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286464143] [2025-03-04 15:26:18,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:18,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:18,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:18,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:18,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:19,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:19,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 189 transitions, 954 flow. Second operand has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:19,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:19,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:19,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:20,826 INFO L124 PetriNetUnfolderBase]: 11688/22679 cut-off events. [2025-03-04 15:26:20,826 INFO L125 PetriNetUnfolderBase]: For 41188/41833 co-relation queries the response was YES. [2025-03-04 15:26:20,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63609 conditions, 22679 events. 11688/22679 cut-off events. For 41188/41833 co-relation queries the response was YES. Maximal size of possible extension queue 667. Compared 195011 event pairs, 5941 based on Foata normal form. 765/22803 useless extension candidates. Maximal degree in co-relation 63437. Up to 12135 conditions per place. [2025-03-04 15:26:20,961 INFO L140 encePairwiseOnDemand]: 158/169 looper letters, 209 selfloop transitions, 11 changer transitions 0/280 dead transitions. [2025-03-04 15:26:20,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 280 transitions, 1881 flow [2025-03-04 15:26:20,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:20,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:20,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 457 transitions. [2025-03-04 15:26:20,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6760355029585798 [2025-03-04 15:26:20,962 INFO L175 Difference]: Start difference. First operand has 205 places, 189 transitions, 954 flow. Second operand 4 states and 457 transitions. [2025-03-04 15:26:20,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 280 transitions, 1881 flow [2025-03-04 15:26:21,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 280 transitions, 1872 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:21,201 INFO L231 Difference]: Finished difference. Result has 204 places, 188 transitions, 977 flow [2025-03-04 15:26:21,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=935, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=977, PETRI_PLACES=204, PETRI_TRANSITIONS=188} [2025-03-04 15:26:21,201 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 57 predicate places. [2025-03-04 15:26:21,201 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 188 transitions, 977 flow [2025-03-04 15:26:21,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.25) internal successors, (317), 4 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 15:26:21,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:21,202 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:21,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 15:26:21,202 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:21,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:21,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1157365347, now seen corresponding path program 1 times [2025-03-04 15:26:21,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:21,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522954290] [2025-03-04 15:26:21,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:21,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:21,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 15:26:21,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:26:21,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:21,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:21,283 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:21,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:21,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522954290] [2025-03-04 15:26:21,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522954290] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:21,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759506361] [2025-03-04 15:26:21,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:21,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:21,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:21,290 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:21,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 15:26:21,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-03-04 15:26:21,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-03-04 15:26:21,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:21,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:21,416 INFO L256 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:21,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:21,440 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759506361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:26:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647573907] [2025-03-04 15:26:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:21,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:21,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:26:21,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:26:21,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 188 transitions, 977 flow. Second operand has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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-03-04 15:26:21,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:21,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:26:21,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:23,186 INFO L124 PetriNetUnfolderBase]: 10441/20369 cut-off events. [2025-03-04 15:26:23,186 INFO L125 PetriNetUnfolderBase]: For 39883/40921 co-relation queries the response was YES. [2025-03-04 15:26:23,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58387 conditions, 20369 events. 10441/20369 cut-off events. For 39883/40921 co-relation queries the response was YES. Maximal size of possible extension queue 622. Compared 175992 event pairs, 2198 based on Foata normal form. 1115/20964 useless extension candidates. Maximal degree in co-relation 58214. Up to 7356 conditions per place. [2025-03-04 15:26:23,380 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 327 selfloop transitions, 5 changer transitions 0/394 dead transitions. [2025-03-04 15:26:23,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 394 transitions, 2737 flow [2025-03-04 15:26:23,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:23,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:23,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 725 transitions. [2025-03-04 15:26:23,382 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7149901380670611 [2025-03-04 15:26:23,382 INFO L175 Difference]: Start difference. First operand has 204 places, 188 transitions, 977 flow. Second operand 6 states and 725 transitions. [2025-03-04 15:26:23,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 394 transitions, 2737 flow [2025-03-04 15:26:23,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 394 transitions, 2680 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:23,597 INFO L231 Difference]: Finished difference. Result has 204 places, 185 transitions, 962 flow [2025-03-04 15:26:23,597 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=952, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=962, PETRI_PLACES=204, PETRI_TRANSITIONS=185} [2025-03-04 15:26:23,598 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 57 predicate places. [2025-03-04 15:26:23,598 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 185 transitions, 962 flow [2025-03-04 15:26:23,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.0) internal successors, (425), 5 states have internal predecessors, (425), 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-03-04 15:26:23,598 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:23,598 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:23,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-04 15:26:23,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2025-03-04 15:26:23,799 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:23,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:23,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1518586024, now seen corresponding path program 1 times [2025-03-04 15:26:23,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:23,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509634045] [2025-03-04 15:26:23,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:23,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:23,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:26:23,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:26:23,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:23,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509634045] [2025-03-04 15:26:23,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509634045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:23,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856367746] [2025-03-04 15:26:23,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:23,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:23,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:23,868 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:23,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 15:26:23,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-04 15:26:23,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-04 15:26:23,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:23,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:23,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:26:23,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:24,011 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:24,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:24,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856367746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:24,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:24,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 15:26:24,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219829031] [2025-03-04 15:26:24,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:24,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:24,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:24,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:24,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:24,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:26:24,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 185 transitions, 962 flow. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-04 15:26:24,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:24,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:26:24,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:25,519 INFO L124 PetriNetUnfolderBase]: 9959/20163 cut-off events. [2025-03-04 15:26:25,519 INFO L125 PetriNetUnfolderBase]: For 37986/38770 co-relation queries the response was YES. [2025-03-04 15:26:25,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56603 conditions, 20163 events. 9959/20163 cut-off events. For 37986/38770 co-relation queries the response was YES. Maximal size of possible extension queue 605. Compared 178443 event pairs, 4996 based on Foata normal form. 885/20476 useless extension candidates. Maximal degree in co-relation 56431. Up to 9978 conditions per place. [2025-03-04 15:26:25,662 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 171 selfloop transitions, 4 changer transitions 0/238 dead transitions. [2025-03-04 15:26:25,662 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 238 transitions, 1576 flow [2025-03-04 15:26:25,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:25,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2025-03-04 15:26:25,663 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7297830374753451 [2025-03-04 15:26:25,663 INFO L175 Difference]: Start difference. First operand has 204 places, 185 transitions, 962 flow. Second operand 3 states and 370 transitions. [2025-03-04 15:26:25,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 238 transitions, 1576 flow [2025-03-04 15:26:25,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 238 transitions, 1563 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:25,879 INFO L231 Difference]: Finished difference. Result has 200 places, 184 transitions, 957 flow [2025-03-04 15:26:25,879 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=957, PETRI_PLACES=200, PETRI_TRANSITIONS=184} [2025-03-04 15:26:25,880 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 53 predicate places. [2025-03-04 15:26:25,880 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 184 transitions, 957 flow [2025-03-04 15:26:25,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 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-03-04 15:26:25,880 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:25,880 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:25,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:26,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:26,080 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:26,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:26,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1406633761, now seen corresponding path program 1 times [2025-03-04 15:26:26,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:26,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440289019] [2025-03-04 15:26:26,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:26,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:26,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 15:26:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:26:26,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440289019] [2025-03-04 15:26:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440289019] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:26,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052181495] [2025-03-04 15:26:26,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:26,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:26,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:26,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:26,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 15:26:26,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-04 15:26:26,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-04 15:26:26,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:26,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:26,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:26,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:26,333 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:26,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:26,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052181495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:26,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2025-03-04 15:26:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944177832] [2025-03-04 15:26:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:26,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:26,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:26,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:26,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 15:26:26,346 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:26:26,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 184 transitions, 957 flow. Second operand has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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-03-04 15:26:26,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:26,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:26:26,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:28,036 INFO L124 PetriNetUnfolderBase]: 10752/21195 cut-off events. [2025-03-04 15:26:28,036 INFO L125 PetriNetUnfolderBase]: For 41649/42527 co-relation queries the response was YES. [2025-03-04 15:26:28,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59947 conditions, 21195 events. 10752/21195 cut-off events. For 41649/42527 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 183155 event pairs, 2275 based on Foata normal form. 1034/21899 useless extension candidates. Maximal degree in co-relation 59777. Up to 7696 conditions per place. [2025-03-04 15:26:28,357 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 318 selfloop transitions, 5 changer transitions 0/380 dead transitions. [2025-03-04 15:26:28,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 380 transitions, 2633 flow [2025-03-04 15:26:28,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 719 transitions. [2025-03-04 15:26:28,358 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7090729783037475 [2025-03-04 15:26:28,359 INFO L175 Difference]: Start difference. First operand has 200 places, 184 transitions, 957 flow. Second operand 6 states and 719 transitions. [2025-03-04 15:26:28,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 380 transitions, 2633 flow [2025-03-04 15:26:28,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 380 transitions, 2613 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 15:26:28,600 INFO L231 Difference]: Finished difference. Result has 201 places, 181 transitions, 951 flow [2025-03-04 15:26:28,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=941, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=951, PETRI_PLACES=201, PETRI_TRANSITIONS=181} [2025-03-04 15:26:28,600 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 54 predicate places. [2025-03-04 15:26:28,601 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 181 transitions, 951 flow [2025-03-04 15:26:28,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 85.4) internal successors, (427), 5 states have internal predecessors, (427), 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-03-04 15:26:28,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:28,601 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:28,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 15:26:28,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-03-04 15:26:28,801 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:28,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash 655975072, now seen corresponding path program 1 times [2025-03-04 15:26:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:28,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599593132] [2025-03-04 15:26:28,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:28,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 15:26:28,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:26:28,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:28,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:28,944 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:28,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599593132] [2025-03-04 15:26:28,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599593132] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:28,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1117828805] [2025-03-04 15:26:28,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:28,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:28,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:28,947 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:28,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 15:26:29,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-04 15:26:29,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-04 15:26:29,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:29,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:29,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 15:26:29,083 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:29,097 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:29,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1117828805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:29,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:29,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 15:26:29,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559767086] [2025-03-04 15:26:29,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:29,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 15:26:29,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:29,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 15:26:29,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-04 15:26:29,102 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 169 [2025-03-04 15:26:29,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 181 transitions, 951 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-03-04 15:26:29,103 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:29,103 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 169 [2025-03-04 15:26:29,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:30,619 INFO L124 PetriNetUnfolderBase]: 10236/20711 cut-off events. [2025-03-04 15:26:30,620 INFO L125 PetriNetUnfolderBase]: For 39795/40513 co-relation queries the response was YES. [2025-03-04 15:26:30,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 58468 conditions, 20711 events. 10236/20711 cut-off events. For 39795/40513 co-relation queries the response was YES. Maximal size of possible extension queue 609. Compared 182562 event pairs, 5315 based on Foata normal form. 852/21173 useless extension candidates. Maximal degree in co-relation 58297. Up to 10529 conditions per place. [2025-03-04 15:26:30,856 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 169 selfloop transitions, 4 changer transitions 0/231 dead transitions. [2025-03-04 15:26:30,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 231 transitions, 1550 flow [2025-03-04 15:26:30,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 15:26:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 15:26:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 368 transitions. [2025-03-04 15:26:30,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7258382642998028 [2025-03-04 15:26:30,857 INFO L175 Difference]: Start difference. First operand has 201 places, 181 transitions, 951 flow. Second operand 3 states and 368 transitions. [2025-03-04 15:26:30,857 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 231 transitions, 1550 flow [2025-03-04 15:26:31,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 231 transitions, 1537 flow, removed 2 selfloop flow, removed 5 redundant places. [2025-03-04 15:26:31,171 INFO L231 Difference]: Finished difference. Result has 197 places, 180 transitions, 946 flow [2025-03-04 15:26:31,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=197, PETRI_TRANSITIONS=180} [2025-03-04 15:26:31,172 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 50 predicate places. [2025-03-04 15:26:31,172 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 180 transitions, 946 flow [2025-03-04 15:26:31,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-03-04 15:26:31,172 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:31,172 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:31,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 15:26:31,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:31,373 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:31,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:31,373 INFO L85 PathProgramCache]: Analyzing trace with hash -1140808407, now seen corresponding path program 1 times [2025-03-04 15:26:31,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:31,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802758462] [2025-03-04 15:26:31,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:31,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:31,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:26:31,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:26:31,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:31,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:31,444 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:31,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:31,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802758462] [2025-03-04 15:26:31,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802758462] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:31,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882103769] [2025-03-04 15:26:31,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:31,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:31,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:31,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:31,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-04 15:26:31,557 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:26:31,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:26:31,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:31,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:31,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 15:26:31,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:31,601 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:31,601 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:31,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882103769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:31,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:31,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2025-03-04 15:26:31,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409173230] [2025-03-04 15:26:31,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:31,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:31,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:31,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:31,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:31,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 169 [2025-03-04 15:26:31,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 180 transitions, 946 flow. Second operand has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-03-04 15:26:31,630 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:31,630 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 169 [2025-03-04 15:26:31,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:33,540 INFO L124 PetriNetUnfolderBase]: 10372/21049 cut-off events. [2025-03-04 15:26:33,541 INFO L125 PetriNetUnfolderBase]: For 39745/40261 co-relation queries the response was YES. [2025-03-04 15:26:33,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59178 conditions, 21049 events. 10372/21049 cut-off events. For 39745/40261 co-relation queries the response was YES. Maximal size of possible extension queue 614. Compared 184973 event pairs, 6531 based on Foata normal form. 888/21752 useless extension candidates. Maximal degree in co-relation 59009. Up to 13049 conditions per place. [2025-03-04 15:26:33,745 INFO L140 encePairwiseOnDemand]: 155/169 looper letters, 257 selfloop transitions, 10 changer transitions 0/319 dead transitions. [2025-03-04 15:26:33,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 319 transitions, 2211 flow [2025-03-04 15:26:33,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 15:26:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-04 15:26:33,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 577 transitions. [2025-03-04 15:26:33,746 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6828402366863905 [2025-03-04 15:26:33,746 INFO L175 Difference]: Start difference. First operand has 197 places, 180 transitions, 946 flow. Second operand 5 states and 577 transitions. [2025-03-04 15:26:33,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 319 transitions, 2211 flow [2025-03-04 15:26:34,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 319 transitions, 2199 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 15:26:34,011 INFO L231 Difference]: Finished difference. Result has 198 places, 176 transitions, 924 flow [2025-03-04 15:26:34,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=924, PETRI_PLACES=198, PETRI_TRANSITIONS=176} [2025-03-04 15:26:34,011 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 51 predicate places. [2025-03-04 15:26:34,011 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 176 transitions, 924 flow [2025-03-04 15:26:34,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.0) internal successors, (332), 4 states have internal predecessors, (332), 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-03-04 15:26:34,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:34,012 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:34,018 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-04 15:26:34,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-03-04 15:26:34,212 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:34,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:34,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1273746222, now seen corresponding path program 1 times [2025-03-04 15:26:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807434963] [2025-03-04 15:26:34,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:34,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:34,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 15:26:34,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 15:26:34,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:34,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:34,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:34,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807434963] [2025-03-04 15:26:34,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807434963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:34,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:34,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:34,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562330270] [2025-03-04 15:26:34,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:34,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:34,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:34,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:34,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:34,294 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:26:34,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 176 transitions, 924 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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-03-04 15:26:34,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:34,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:26:34,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:35,761 INFO L124 PetriNetUnfolderBase]: 9682/19515 cut-off events. [2025-03-04 15:26:35,761 INFO L125 PetriNetUnfolderBase]: For 37313/38060 co-relation queries the response was YES. [2025-03-04 15:26:35,875 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55005 conditions, 19515 events. 9682/19515 cut-off events. For 37313/38060 co-relation queries the response was YES. Maximal size of possible extension queue 572. Compared 171142 event pairs, 4996 based on Foata normal form. 752/20115 useless extension candidates. Maximal degree in co-relation 54836. Up to 9840 conditions per place. [2025-03-04 15:26:35,931 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 215 selfloop transitions, 6 changer transitions 0/276 dead transitions. [2025-03-04 15:26:35,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 276 transitions, 1897 flow [2025-03-04 15:26:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:35,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:35,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2025-03-04 15:26:35,932 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7085798816568047 [2025-03-04 15:26:35,932 INFO L175 Difference]: Start difference. First operand has 198 places, 176 transitions, 924 flow. Second operand 4 states and 479 transitions. [2025-03-04 15:26:35,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 276 transitions, 1897 flow [2025-03-04 15:26:36,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 276 transitions, 1843 flow, removed 6 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:36,125 INFO L231 Difference]: Finished difference. Result has 196 places, 175 transitions, 910 flow [2025-03-04 15:26:36,125 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=898, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=910, PETRI_PLACES=196, PETRI_TRANSITIONS=175} [2025-03-04 15:26:36,126 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 49 predicate places. [2025-03-04 15:26:36,126 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 175 transitions, 910 flow [2025-03-04 15:26:36,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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-03-04 15:26:36,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:36,126 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:36,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-04 15:26:36,126 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:36,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1005320799, now seen corresponding path program 1 times [2025-03-04 15:26:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061611201] [2025-03-04 15:26:36,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:36,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:36,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 15:26:36,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:26:36,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:36,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:36,191 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:36,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061611201] [2025-03-04 15:26:36,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061611201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:36,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157648978] [2025-03-04 15:26:36,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:36,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:36,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:36,193 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:36,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-04 15:26:36,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 15:26:36,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:26:36,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:36,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:36,323 INFO L256 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:36,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:36,378 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:36,378 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:36,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157648978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:36,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:36,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2025-03-04 15:26:36,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856781382] [2025-03-04 15:26:36,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:36,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:36,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:36,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:36,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:36,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:26:36,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 175 transitions, 910 flow. Second operand has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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-03-04 15:26:36,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:36,404 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:26:36,404 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:37,829 INFO L124 PetriNetUnfolderBase]: 9856/20063 cut-off events. [2025-03-04 15:26:37,830 INFO L125 PetriNetUnfolderBase]: For 37607/38191 co-relation queries the response was YES. [2025-03-04 15:26:37,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56124 conditions, 20063 events. 9856/20063 cut-off events. For 37607/38191 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 176262 event pairs, 6075 based on Foata normal form. 648/20522 useless extension candidates. Maximal degree in co-relation 55957. Up to 12220 conditions per place. [2025-03-04 15:26:37,991 INFO L140 encePairwiseOnDemand]: 163/169 looper letters, 161 selfloop transitions, 7 changer transitions 0/221 dead transitions. [2025-03-04 15:26:37,992 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 221 transitions, 1505 flow [2025-03-04 15:26:37,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:37,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2025-03-04 15:26:37,992 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6479289940828402 [2025-03-04 15:26:37,993 INFO L175 Difference]: Start difference. First operand has 196 places, 175 transitions, 910 flow. Second operand 4 states and 438 transitions. [2025-03-04 15:26:37,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 221 transitions, 1505 flow [2025-03-04 15:26:38,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 221 transitions, 1481 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:38,217 INFO L231 Difference]: Finished difference. Result has 195 places, 174 transitions, 910 flow [2025-03-04 15:26:38,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=896, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=167, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=910, PETRI_PLACES=195, PETRI_TRANSITIONS=174} [2025-03-04 15:26:38,218 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 48 predicate places. [2025-03-04 15:26:38,218 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 174 transitions, 910 flow [2025-03-04 15:26:38,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 86.75) internal successors, (347), 4 states have internal predecessors, (347), 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-03-04 15:26:38,218 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:38,218 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:38,225 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-04 15:26:38,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-03-04 15:26:38,419 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:38,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:38,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1936579527, now seen corresponding path program 1 times [2025-03-04 15:26:38,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:38,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973967147] [2025-03-04 15:26:38,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:38,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:38,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 15:26:38,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:26:38,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:38,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:38,489 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:38,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973967147] [2025-03-04 15:26:38,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973967147] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:38,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859117562] [2025-03-04 15:26:38,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:38,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:38,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:38,492 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:38,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-04 15:26:38,610 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-04 15:26:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-04 15:26:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:38,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:38,636 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:38,714 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:38,715 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:38,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859117562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:38,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:38,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2025-03-04 15:26:38,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277941972] [2025-03-04 15:26:38,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:38,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:38,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:38,715 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:38,715 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:26:38,758 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:38,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 174 transitions, 910 flow. Second operand has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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-03-04 15:26:38,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:38,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:38,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:40,279 INFO L124 PetriNetUnfolderBase]: 10018/20438 cut-off events. [2025-03-04 15:26:40,279 INFO L125 PetriNetUnfolderBase]: For 37697/38105 co-relation queries the response was YES. [2025-03-04 15:26:40,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56915 conditions, 20438 events. 10018/20438 cut-off events. For 37697/38105 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 179401 event pairs, 6995 based on Foata normal form. 578/20804 useless extension candidates. Maximal degree in co-relation 56747. Up to 13892 conditions per place. [2025-03-04 15:26:40,469 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 260 selfloop transitions, 7 changer transitions 0/317 dead transitions. [2025-03-04 15:26:40,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 317 transitions, 2207 flow [2025-03-04 15:26:40,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:40,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:40,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 637 transitions. [2025-03-04 15:26:40,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6282051282051282 [2025-03-04 15:26:40,470 INFO L175 Difference]: Start difference. First operand has 195 places, 174 transitions, 910 flow. Second operand 6 states and 637 transitions. [2025-03-04 15:26:40,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 317 transitions, 2207 flow [2025-03-04 15:26:40,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 317 transitions, 2151 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-04 15:26:40,706 INFO L231 Difference]: Finished difference. Result has 193 places, 172 transitions, 872 flow [2025-03-04 15:26:40,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=858, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=872, PETRI_PLACES=193, PETRI_TRANSITIONS=172} [2025-03-04 15:26:40,706 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 46 predicate places. [2025-03-04 15:26:40,706 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 172 transitions, 872 flow [2025-03-04 15:26:40,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 79.8) internal successors, (399), 5 states have internal predecessors, (399), 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-03-04 15:26:40,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:40,706 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:40,713 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-04 15:26:40,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-03-04 15:26:40,907 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:40,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:40,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1100202988, now seen corresponding path program 1 times [2025-03-04 15:26:40,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:40,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094767259] [2025-03-04 15:26:40,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:40,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:40,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:26:40,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:26:40,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:40,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:40,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094767259] [2025-03-04 15:26:40,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094767259] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:40,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783641097] [2025-03-04 15:26:40,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:40,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:40,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:40,981 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:40,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-04 15:26:41,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:26:41,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:26:41,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:41,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:41,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 15:26:41,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:41,171 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:41,171 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:41,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783641097] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:41,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:41,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 8 [2025-03-04 15:26:41,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908903183] [2025-03-04 15:26:41,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:41,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:41,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:41,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:41,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-04 15:26:41,188 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 169 [2025-03-04 15:26:41,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 172 transitions, 872 flow. Second operand has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 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-03-04 15:26:41,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:41,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 169 [2025-03-04 15:26:41,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:42,508 INFO L124 PetriNetUnfolderBase]: 9684/19693 cut-off events. [2025-03-04 15:26:42,508 INFO L125 PetriNetUnfolderBase]: For 32861/33393 co-relation queries the response was YES. [2025-03-04 15:26:42,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53500 conditions, 19693 events. 9684/19693 cut-off events. For 32861/33393 co-relation queries the response was YES. Maximal size of possible extension queue 571. Compared 172411 event pairs, 6379 based on Foata normal form. 622/20122 useless extension candidates. Maximal degree in co-relation 53335. Up to 12772 conditions per place. [2025-03-04 15:26:42,649 INFO L140 encePairwiseOnDemand]: 165/169 looper letters, 162 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2025-03-04 15:26:42,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 218 transitions, 1435 flow [2025-03-04 15:26:42,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:42,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:42,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2025-03-04 15:26:42,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6316568047337278 [2025-03-04 15:26:42,650 INFO L175 Difference]: Start difference. First operand has 193 places, 172 transitions, 872 flow. Second operand 4 states and 427 transitions. [2025-03-04 15:26:42,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 218 transitions, 1435 flow [2025-03-04 15:26:42,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 218 transitions, 1420 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-04 15:26:42,834 INFO L231 Difference]: Finished difference. Result has 192 places, 171 transitions, 867 flow [2025-03-04 15:26:42,834 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=171, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=867, PETRI_PLACES=192, PETRI_TRANSITIONS=171} [2025-03-04 15:26:42,834 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 45 predicate places. [2025-03-04 15:26:42,834 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 171 transitions, 867 flow [2025-03-04 15:26:42,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 85.0) internal successors, (340), 4 states have internal predecessors, (340), 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-03-04 15:26:42,834 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:42,834 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:42,841 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:43,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2025-03-04 15:26:43,035 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:43,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:43,035 INFO L85 PathProgramCache]: Analyzing trace with hash 84213651, now seen corresponding path program 1 times [2025-03-04 15:26:43,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:43,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075258490] [2025-03-04 15:26:43,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:43,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:43,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:26:43,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:26:43,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:43,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:43,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:43,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075258490] [2025-03-04 15:26:43,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075258490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:43,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 15:26:43,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 15:26:43,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544246617] [2025-03-04 15:26:43,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:43,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 15:26:43,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:43,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 15:26:43,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 15:26:43,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 169 [2025-03-04 15:26:43,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 171 transitions, 867 flow. Second operand has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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-03-04 15:26:43,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:43,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 169 [2025-03-04 15:26:43,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:44,469 INFO L124 PetriNetUnfolderBase]: 9684/19295 cut-off events. [2025-03-04 15:26:44,470 INFO L125 PetriNetUnfolderBase]: For 34551/35205 co-relation queries the response was YES. [2025-03-04 15:26:44,547 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52450 conditions, 19295 events. 9684/19295 cut-off events. For 34551/35205 co-relation queries the response was YES. Maximal size of possible extension queue 554. Compared 166489 event pairs, 5011 based on Foata normal form. 724/19847 useless extension candidates. Maximal degree in co-relation 52285. Up to 9873 conditions per place. [2025-03-04 15:26:44,601 INFO L140 encePairwiseOnDemand]: 164/169 looper letters, 212 selfloop transitions, 6 changer transitions 0/268 dead transitions. [2025-03-04 15:26:44,601 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 268 transitions, 1765 flow [2025-03-04 15:26:44,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 15:26:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-04 15:26:44,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 476 transitions. [2025-03-04 15:26:44,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7041420118343196 [2025-03-04 15:26:44,602 INFO L175 Difference]: Start difference. First operand has 192 places, 171 transitions, 867 flow. Second operand 4 states and 476 transitions. [2025-03-04 15:26:44,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 268 transitions, 1765 flow [2025-03-04 15:26:44,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 268 transitions, 1753 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:44,766 INFO L231 Difference]: Finished difference. Result has 190 places, 170 transitions, 863 flow [2025-03-04 15:26:44,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=851, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=164, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=863, PETRI_PLACES=190, PETRI_TRANSITIONS=170} [2025-03-04 15:26:44,767 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 43 predicate places. [2025-03-04 15:26:44,767 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 170 transitions, 863 flow [2025-03-04 15:26:44,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 87.25) internal successors, (349), 4 states have internal predecessors, (349), 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-03-04 15:26:44,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:44,767 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:44,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-03-04 15:26:44,767 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:44,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash -95575405, now seen corresponding path program 1 times [2025-03-04 15:26:44,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:44,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892473163] [2025-03-04 15:26:44,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:44,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:44,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:26:44,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:26:44,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:44,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:44,842 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:44,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:44,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892473163] [2025-03-04 15:26:44,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892473163] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:44,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [539056063] [2025-03-04 15:26:44,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:44,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:44,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:44,846 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:44,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-04 15:26:44,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-03-04 15:26:44,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-03-04 15:26:44,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:44,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:44,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:44,989 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:45,065 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:45,066 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:45,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [539056063] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:45,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:45,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2025-03-04 15:26:45,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127890066] [2025-03-04 15:26:45,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:45,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:45,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:45,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:45,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:26:45,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:45,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 170 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 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-03-04 15:26:45,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:45,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:45,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:46,616 INFO L124 PetriNetUnfolderBase]: 10362/20433 cut-off events. [2025-03-04 15:26:46,616 INFO L125 PetriNetUnfolderBase]: For 34942/35341 co-relation queries the response was YES. [2025-03-04 15:26:46,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 56105 conditions, 20433 events. 10362/20433 cut-off events. For 34942/35341 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 173968 event pairs, 6695 based on Foata normal form. 567/20803 useless extension candidates. Maximal degree in co-relation 55942. Up to 13348 conditions per place. [2025-03-04 15:26:46,732 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 216 selfloop transitions, 10 changer transitions 88/361 dead transitions. [2025-03-04 15:26:46,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 361 transitions, 2535 flow [2025-03-04 15:26:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:26:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:26:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 746 transitions. [2025-03-04 15:26:46,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6306001690617076 [2025-03-04 15:26:46,733 INFO L175 Difference]: Start difference. First operand has 190 places, 170 transitions, 863 flow. Second operand 7 states and 746 transitions. [2025-03-04 15:26:46,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 361 transitions, 2535 flow [2025-03-04 15:26:46,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 361 transitions, 2473 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:46,898 INFO L231 Difference]: Finished difference. Result has 191 places, 169 transitions, 865 flow [2025-03-04 15:26:46,898 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=845, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=159, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=865, PETRI_PLACES=191, PETRI_TRANSITIONS=169} [2025-03-04 15:26:46,898 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 44 predicate places. [2025-03-04 15:26:46,898 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 169 transitions, 865 flow [2025-03-04 15:26:46,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.0) internal successors, (474), 6 states have internal predecessors, (474), 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-03-04 15:26:46,898 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:46,898 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:46,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:47,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:47,099 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:47,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 253446217, now seen corresponding path program 1 times [2025-03-04 15:26:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:47,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904159772] [2025-03-04 15:26:47,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:47,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:26:47,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:26:47,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:47,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:47,184 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:47,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:47,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904159772] [2025-03-04 15:26:47,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904159772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:47,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111296606] [2025-03-04 15:26:47,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:47,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:47,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:47,186 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:47,188 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-04 15:26:47,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-04 15:26:47,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-04 15:26:47,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:47,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:47,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:47,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:47,412 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:47,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111296606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:47,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:47,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 9 [2025-03-04 15:26:47,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359772994] [2025-03-04 15:26:47,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:47,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 15:26:47,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:47,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 15:26:47,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 15:26:47,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:47,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 169 transitions, 865 flow. Second operand has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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-03-04 15:26:47,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:47,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:47,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:48,867 INFO L124 PetriNetUnfolderBase]: 10028/19771 cut-off events. [2025-03-04 15:26:48,867 INFO L125 PetriNetUnfolderBase]: For 34894/35346 co-relation queries the response was YES. [2025-03-04 15:26:48,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54352 conditions, 19771 events. 10028/19771 cut-off events. For 34894/35346 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 167903 event pairs, 6987 based on Foata normal form. 648/20238 useless extension candidates. Maximal degree in co-relation 54189. Up to 13876 conditions per place. [2025-03-04 15:26:48,995 INFO L140 encePairwiseOnDemand]: 162/169 looper letters, 257 selfloop transitions, 7 changer transitions 0/309 dead transitions. [2025-03-04 15:26:48,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 309 transitions, 2111 flow [2025-03-04 15:26:48,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 15:26:48,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 15:26:48,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 634 transitions. [2025-03-04 15:26:48,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6252465483234714 [2025-03-04 15:26:48,996 INFO L175 Difference]: Start difference. First operand has 191 places, 169 transitions, 865 flow. Second operand 6 states and 634 transitions. [2025-03-04 15:26:48,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 309 transitions, 2111 flow [2025-03-04 15:26:49,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 309 transitions, 1998 flow, removed 4 selfloop flow, removed 9 redundant places. [2025-03-04 15:26:49,161 INFO L231 Difference]: Finished difference. Result has 186 places, 167 transitions, 812 flow [2025-03-04 15:26:49,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=798, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=812, PETRI_PLACES=186, PETRI_TRANSITIONS=167} [2025-03-04 15:26:49,162 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 39 predicate places. [2025-03-04 15:26:49,162 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 167 transitions, 812 flow [2025-03-04 15:26:49,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 80.2) internal successors, (401), 5 states have internal predecessors, (401), 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-03-04 15:26:49,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 15:26:49,162 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:49,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-04 15:26:49,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-03-04 15:26:49,363 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW, thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (and 77 more)] === [2025-03-04 15:26:49,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 15:26:49,363 INFO L85 PathProgramCache]: Analyzing trace with hash -733100391, now seen corresponding path program 1 times [2025-03-04 15:26:49,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 15:26:49,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286206445] [2025-03-04 15:26:49,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:49,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 15:26:49,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:26:49,380 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:26:49,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:49,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:49,439 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-04 15:26:49,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 15:26:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286206445] [2025-03-04 15:26:49,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286206445] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 15:26:49,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411522777] [2025-03-04 15:26:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 15:26:49,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:49,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 15:26:49,444 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 15:26:49,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-04 15:26:49,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-04 15:26:49,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-04 15:26:49,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 15:26:49,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 15:26:49,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-04 15:26:49,594 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 15:26:49,658 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 15:26:49,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 15:26:49,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411522777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 15:26:49,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 15:26:49,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 10 [2025-03-04 15:26:49,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814715464] [2025-03-04 15:26:49,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 15:26:49,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 15:26:49,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 15:26:49,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 15:26:49,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-03-04 15:26:49,721 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 169 [2025-03-04 15:26:49,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 167 transitions, 812 flow. Second operand has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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-03-04 15:26:49,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 15:26:49,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 169 [2025-03-04 15:26:49,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 15:26:51,161 INFO L124 PetriNetUnfolderBase]: 10372/19925 cut-off events. [2025-03-04 15:26:51,161 INFO L125 PetriNetUnfolderBase]: For 27979/28437 co-relation queries the response was YES. [2025-03-04 15:26:51,229 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52824 conditions, 19925 events. 10372/19925 cut-off events. For 27979/28437 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 165401 event pairs, 6683 based on Foata normal form. 648/20388 useless extension candidates. Maximal degree in co-relation 52665. Up to 13324 conditions per place. [2025-03-04 15:26:51,245 INFO L140 encePairwiseOnDemand]: 161/169 looper letters, 0 selfloop transitions, 0 changer transitions 354/354 dead transitions. [2025-03-04 15:26:51,245 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 354 transitions, 2320 flow [2025-03-04 15:26:51,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 15:26:51,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-04 15:26:51,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 742 transitions. [2025-03-04 15:26:51,246 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6272189349112426 [2025-03-04 15:26:51,246 INFO L175 Difference]: Start difference. First operand has 186 places, 167 transitions, 812 flow. Second operand 7 states and 742 transitions. [2025-03-04 15:26:51,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 354 transitions, 2320 flow [2025-03-04 15:26:51,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 354 transitions, 2307 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-04 15:26:51,353 INFO L231 Difference]: Finished difference. Result has 187 places, 0 transitions, 0 flow [2025-03-04 15:26:51,353 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=169, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=0, PETRI_PLACES=187, PETRI_TRANSITIONS=0} [2025-03-04 15:26:51,354 INFO L279 CegarLoopForPetriNet]: 147 programPoint places, 40 predicate places. [2025-03-04 15:26:51,354 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 0 transitions, 0 flow [2025-03-04 15:26:51,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.33333333333333) internal successors, (476), 6 states have internal predecessors, (476), 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-03-04 15:26:51,356 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (79 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (78 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (77 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (76 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (75 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (74 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (73 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (72 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (71 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (70 of 80 remaining) [2025-03-04 15:26:51,357 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (69 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (68 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (67 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (66 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (65 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (64 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (63 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (62 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (61 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (60 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (59 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (58 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (57 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (56 of 80 remaining) [2025-03-04 15:26:51,358 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (55 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (54 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (53 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (52 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (51 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (50 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (49 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (48 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (47 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (46 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (45 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (44 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (43 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (42 of 80 remaining) [2025-03-04 15:26:51,359 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (41 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (40 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (39 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (38 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (35 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (34 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (33 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (32 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (31 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (30 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (29 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (28 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (27 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (26 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (25 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (24 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (23 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (22 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (21 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (20 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (19 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (18 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONINTEGER_OVERFLOW (17 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONINTEGER_OVERFLOW (16 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 80 remaining) [2025-03-04 15:26:51,360 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 80 remaining) [2025-03-04 15:26:51,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 80 remaining) [2025-03-04 15:26:51,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 80 remaining) [2025-03-04 15:26:51,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 80 remaining) [2025-03-04 15:26:51,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 80 remaining) [2025-03-04 15:26:51,361 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 80 remaining) [2025-03-04 15:26:51,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-03-04 15:26:51,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 15:26:51,562 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 15:26:51,565 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-04 15:26:51,565 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 15:26:51,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 03:26:51 BasicIcfg [2025-03-04 15:26:51,571 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 15:26:51,572 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 15:26:51,572 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 15:26:51,572 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 15:26:51,572 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 03:25:34" (3/4) ... [2025-03-04 15:26:51,573 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 15:26:51,575 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-04 15:26:51,575 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-04 15:26:51,578 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 110 nodes and edges [2025-03-04 15:26:51,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2025-03-04 15:26:51,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-03-04 15:26:51,579 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-04 15:26:51,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 15:26:51,640 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 15:26:51,640 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 15:26:51,641 INFO L158 Benchmark]: Toolchain (without parser) took 78892.06ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 112.6MB in the beginning and 2.7GB in the end (delta: -2.6GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-04 15:26:51,642 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:51,642 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.48ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.3MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 15:26:51,642 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.70ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:51,642 INFO L158 Benchmark]: Boogie Preprocessor took 44.39ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 15:26:51,642 INFO L158 Benchmark]: IcfgBuilder took 1031.24ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 99.9MB in the end (delta: -7.8MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2025-03-04 15:26:51,643 INFO L158 Benchmark]: TraceAbstraction took 77500.01ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 99.1MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-03-04 15:26:51,643 INFO L158 Benchmark]: Witness Printer took 68.39ms. Allocated memory is still 4.1GB. Free memory was 2.8GB in the beginning and 2.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 15:26:51,644 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.28ms. Allocated memory is still 201.3MB. Free memory is still 123.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.48ms. Allocated memory is still 142.6MB. Free memory was 112.2MB in the beginning and 98.3MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.70ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 95.2MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.39ms. Allocated memory is still 142.6MB. Free memory was 95.2MB in the beginning and 92.0MB in the end (delta: 3.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 1031.24ms. Allocated memory is still 142.6MB. Free memory was 92.0MB in the beginning and 99.9MB in the end (delta: -7.8MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. * TraceAbstraction took 77500.01ms. Allocated memory was 142.6MB in the beginning and 4.1GB in the end (delta: 3.9GB). Free memory was 99.1MB in the beginning and 2.8GB in the end (delta: -2.7GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 68.39ms. Allocated memory is still 4.1GB. Free memory was 2.8GB in the beginning and 2.7GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 58]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 60]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 62]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 85]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 145]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 87]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 146]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 89]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 147]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 138]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 138]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 138]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 138]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 127]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 127]: 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, 268 locations, 80 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: 77.4s, OverallIterations: 41, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 67.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5790 SdHoareTripleChecker+Valid, 8.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5000 mSDsluCounter, 688 SdHoareTripleChecker+Invalid, 6.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 368 mSDsCounter, 407 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14537 IncrementalHoareTripleChecker+Invalid, 14944 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 407 mSolverCounterUnsat, 320 mSDtfsCounter, 14537 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 913 GetRequests, 683 SyntacticMatches, 5 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=977occurred in iteration=28, InterpolantAutomatonStates: 204, 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.3s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2238 NumberOfCodeBlocks, 2166 NumberOfCodeBlocksAsserted, 57 NumberOfCheckSat, 2247 ConstructedInterpolants, 0 QuantifiedInterpolants, 5407 SizeOfPredicates, 33 NumberOfNonLiveVariables, 4143 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 61 InterpolantComputations, 37 PerfectInterpolantSequences, 3021/3121 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 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-04 15:26:51,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE